/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:29:51,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:29:51,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:29:51,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:29:51,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:29:51,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:29:51,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:29:52,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:29:52,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:29:52,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:29:52,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:29:52,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:29:52,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:29:52,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:29:52,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:29:52,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:29:52,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:29:52,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:29:52,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:29:52,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:29:52,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:29:52,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:29:52,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:29:52,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:29:52,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:29:52,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:29:52,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:29:52,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:29:52,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:29:52,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:29:52,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:29:52,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:29:52,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:29:52,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:29:52,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:29:52,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:29:52,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:29:52,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:29:52,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:29:52,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:29:52,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:29:52,029 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:29:52,043 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:29:52,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:29:52,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:29:52,044 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:29:52,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:29:52,045 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:29:52,045 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:29:52,045 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:29:52,045 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:29:52,045 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:29:52,046 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:29:52,046 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:29:52,046 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:29:52,046 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:29:52,046 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:29:52,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:29:52,047 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:29:52,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:29:52,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:29:52,047 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:29:52,047 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:29:52,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:29:52,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:29:52,048 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:29:52,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:29:52,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:29:52,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:29:52,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:29:52,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:29:52,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:29:52,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:29:52,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:29:52,231 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:29:52,232 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:29:52,232 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:29:52,293 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_XQAJHH/tmp/f191f52b2f744c70bccefacbf105139e/FLAG2b028b897 [2020-07-01 12:29:52,630 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:29:52,631 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:29:52,631 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:29:52,637 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_XQAJHH/tmp/f191f52b2f744c70bccefacbf105139e/FLAG2b028b897 [2020-07-01 12:29:53,030 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_XQAJHH/tmp/f191f52b2f744c70bccefacbf105139e [2020-07-01 12:29:53,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:29:53,042 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:29:53,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:29:53,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:29:53,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:29:53,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54794d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53, skipping insertion in model container [2020-07-01 12:29:53,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:29:53,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:29:53,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:29:53,324 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:29:53,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:29:53,357 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:29:53,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53 WrapperNode [2020-07-01 12:29:53,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:29:53,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:29:53,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:29:53,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:29:53,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:29:53,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:29:53,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:29:53,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:29:53,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:29:53,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:29:53,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:29:53,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:29:53,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:29:53,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:29:53,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:29:53,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:29:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:29:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:29:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:29:53,764 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:29:53,764 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:29:53,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:29:53 BoogieIcfgContainer [2020-07-01 12:29:53,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:29:53,769 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:29:53,769 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:29:53,771 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:29:53,772 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:29:53" (1/1) ... [2020-07-01 12:29:53,787 INFO L313 BlockEncoder]: Initial Icfg 41 locations, 43 edges [2020-07-01 12:29:53,788 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:29:53,789 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:29:53,789 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:29:53,790 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:29:53,792 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:29:53,793 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:29:53,793 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:29:53,817 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:29:53,854 INFO L200 BlockEncoder]: SBE split 21 edges [2020-07-01 12:29:53,858 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:29:53,860 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:29:53,896 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:29:53,899 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:29:53,900 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:29:53,901 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:29:53,901 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:29:53,902 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:29:53,902 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 58 edges [2020-07-01 12:29:53,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:29:53 BasicIcfg [2020-07-01 12:29:53,903 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:29:53,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:29:53,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:29:53,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:29:53,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:29:53" (1/4) ... [2020-07-01 12:29:53,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2f76e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:29:53, skipping insertion in model container [2020-07-01 12:29:53,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (2/4) ... [2020-07-01 12:29:53,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2f76e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:29:53, skipping insertion in model container [2020-07-01 12:29:53,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:29:53" (3/4) ... [2020-07-01 12:29:53,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2f76e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:29:53, skipping insertion in model container [2020-07-01 12:29:53,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:29:53" (4/4) ... [2020-07-01 12:29:53,912 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:29:53,922 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:29:53,930 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-07-01 12:29:53,944 INFO L251 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-07-01 12:29:53,967 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:29:53,968 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:29:53,968 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:29:53,968 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:29:53,968 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:29:53,968 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:29:53,968 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:29:53,968 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:29:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-01 12:29:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:29:53,990 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:29:53,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:29:53,991 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:29:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 116378, now seen corresponding path program 1 times [2020-07-01 12:29:54,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:54,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32031016] [2020-07-01 12:29:54,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:54,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32031016] [2020-07-01 12:29:54,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:54,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:29:54,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829763952] [2020-07-01 12:29:54,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:29:54,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:29:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:29:54,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,186 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-01 12:29:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:29:54,309 INFO L93 Difference]: Finished difference Result 64 states and 111 transitions. [2020-07-01 12:29:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:29:54,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:29:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:29:54,324 INFO L225 Difference]: With dead ends: 64 [2020-07-01 12:29:54,324 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:29:54,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:29:54,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:29:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:29:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 55 transitions. [2020-07-01 12:29:54,366 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 55 transitions. Word has length 3 [2020-07-01 12:29:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:29:54,367 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 55 transitions. [2020-07-01 12:29:54,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:29:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2020-07-01 12:29:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:29:54,367 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:29:54,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:29:54,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:29:54,369 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:29:54,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:54,370 INFO L82 PathProgramCache]: Analyzing trace with hash 116440, now seen corresponding path program 1 times [2020-07-01 12:29:54,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:54,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577591538] [2020-07-01 12:29:54,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:54,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577591538] [2020-07-01 12:29:54,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:54,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:29:54,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547717883] [2020-07-01 12:29:54,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:29:54,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:29:54,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:29:54,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,425 INFO L87 Difference]: Start difference. First operand 33 states and 55 transitions. Second operand 3 states. [2020-07-01 12:29:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:29:54,528 INFO L93 Difference]: Finished difference Result 33 states and 55 transitions. [2020-07-01 12:29:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:29:54,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:29:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:29:54,550 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:29:54,550 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:29:54,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:29:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:29:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:29:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2020-07-01 12:29:54,556 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 3 [2020-07-01 12:29:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:29:54,557 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-07-01 12:29:54,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:29:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2020-07-01 12:29:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:29:54,557 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:29:54,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:29:54,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:29:54,558 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:29:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash 116441, now seen corresponding path program 1 times [2020-07-01 12:29:54,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:54,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614420898] [2020-07-01 12:29:54,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:54,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614420898] [2020-07-01 12:29:54,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:54,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:29:54,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226763458] [2020-07-01 12:29:54,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:29:54,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:29:54,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:29:54,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,585 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 3 states. [2020-07-01 12:29:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:29:54,648 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-07-01 12:29:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:29:54,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:29:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:29:54,650 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:29:54,650 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:29:54,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:29:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:29:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:29:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2020-07-01 12:29:54,655 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 3 [2020-07-01 12:29:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:29:54,655 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2020-07-01 12:29:54,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:29:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-01 12:29:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:29:54,656 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:29:54,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:29:54,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:29:54,656 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:29:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash 116442, now seen corresponding path program 1 times [2020-07-01 12:29:54,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:54,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430858739] [2020-07-01 12:29:54,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:54,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430858739] [2020-07-01 12:29:54,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:54,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:29:54,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836905698] [2020-07-01 12:29:54,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:29:54,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:29:54,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:29:54,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,694 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 3 states. [2020-07-01 12:29:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:29:54,765 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2020-07-01 12:29:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:29:54,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:29:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:29:54,766 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:29:54,766 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:29:54,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:29:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:29:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:29:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2020-07-01 12:29:54,770 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 3 [2020-07-01 12:29:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:29:54,770 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2020-07-01 12:29:54,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:29:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2020-07-01 12:29:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:29:54,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:29:54,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:29:54,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:29:54,772 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:29:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash 3607787, now seen corresponding path program 1 times [2020-07-01 12:29:54,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:54,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897701290] [2020-07-01 12:29:54,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:54,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897701290] [2020-07-01 12:29:54,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:54,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:29:54,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916278254] [2020-07-01 12:29:54,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:29:54,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:29:54,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:29:54,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,801 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 3 states. [2020-07-01 12:29:54,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:29:54,846 INFO L93 Difference]: Finished difference Result 22 states and 34 transitions. [2020-07-01 12:29:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:29:54,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:29:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:29:54,847 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:29:54,847 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:29:54,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:29:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:29:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:29:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-01 12:29:54,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 4 [2020-07-01 12:29:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:29:54,852 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-01 12:29:54,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:29:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-01 12:29:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:29:54,852 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:29:54,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:29:54,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:29:54,853 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:29:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:54,853 INFO L82 PathProgramCache]: Analyzing trace with hash 3607789, now seen corresponding path program 1 times [2020-07-01 12:29:54,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:54,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060744238] [2020-07-01 12:29:54,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:54,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060744238] [2020-07-01 12:29:54,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:54,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:29:54,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533975897] [2020-07-01 12:29:54,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:29:54,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:29:54,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:29:54,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,879 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 3 states. [2020-07-01 12:29:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:29:54,924 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-01 12:29:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:29:54,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:29:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:29:54,926 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:29:54,926 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:29:54,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:29:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:29:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:29:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-07-01 12:29:54,930 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 4 [2020-07-01 12:29:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:29:54,930 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-07-01 12:29:54,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:29:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-07-01 12:29:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:29:54,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:29:54,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:29:54,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:29:54,931 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:29:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash 3607790, now seen corresponding path program 1 times [2020-07-01 12:29:54,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:54,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499470788] [2020-07-01 12:29:54,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:54,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499470788] [2020-07-01 12:29:54,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:54,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:29:54,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198877141] [2020-07-01 12:29:54,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:29:54,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:29:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:29:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:54,968 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 3 states. [2020-07-01 12:29:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:29:55,003 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-01 12:29:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:29:55,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:29:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:29:55,004 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:29:55,004 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:29:55,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:29:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:29:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:29:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:29:55,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 12:29:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:29:55,006 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:29:55,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:29:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:29:55,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:29:55,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:29:55,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:29:55,041 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:29:55,041 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 12:29:55,041 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 12:29:55,042 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 12:29:55,042 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:29:55,042 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:29:55,042 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:29:55,042 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:29:55,042 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:29:55,043 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:29:55,043 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:29:55,043 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:29:55,043 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:29:55,043 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:29:55,043 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:29:55,044 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:29:55,044 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:29:55,044 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:29:55,044 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:29:55,044 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:29:55,044 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:29:55,044 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:29:55,044 INFO L268 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-07-01 12:29:55,045 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:29:55,045 INFO L268 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-07-01 12:29:55,045 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:29:55,045 INFO L268 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-07-01 12:29:55,045 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:29:55,045 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:29:55,045 INFO L268 CegarLoopResult]: For program point L12-6(lines 12 15) no Hoare annotation was computed. [2020-07-01 12:29:55,046 INFO L264 CegarLoopResult]: At program point L12-8(lines 12 15) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~tmp_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:29:55,046 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:29:55,046 INFO L268 CegarLoopResult]: For program point L12-9(lines 12 15) no Hoare annotation was computed. [2020-07-01 12:29:55,049 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:29:55,059 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:29:55,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:29:55,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:29:55,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:29:55,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:29:55,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:29:55,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:29:55 BasicIcfg [2020-07-01 12:29:55,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:29:55,071 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:29:55,071 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:29:55,074 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:29:55,075 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:29:55,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:29:53" (1/5) ... [2020-07-01 12:29:55,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@788f1fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:29:55, skipping insertion in model container [2020-07-01 12:29:55,076 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:29:55,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:29:53" (2/5) ... [2020-07-01 12:29:55,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@788f1fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:29:55, skipping insertion in model container [2020-07-01 12:29:55,076 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:29:55,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:29:53" (3/5) ... [2020-07-01 12:29:55,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@788f1fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:29:55, skipping insertion in model container [2020-07-01 12:29:55,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:29:55,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:29:53" (4/5) ... [2020-07-01 12:29:55,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@788f1fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:29:55, skipping insertion in model container [2020-07-01 12:29:55,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:29:55,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:29:55" (5/5) ... [2020-07-01 12:29:55,080 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:29:55,101 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:29:55,101 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:29:55,101 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:29:55,101 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:29:55,102 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:29:55,102 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:29:55,102 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:29:55,102 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:29:55,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-01 12:29:55,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 12:29:55,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:29:55,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:29:55,117 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:29:55,117 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:29:55,117 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:29:55,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-01 12:29:55,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 12:29:55,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:29:55,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:29:55,120 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:29:55,120 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:29:55,126 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [86] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [126] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, ULTIMATE.start_test_fun_#t~nondet7, #length, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~nondet2, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11] 8#L9true [64] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 6#L9-1true [61] L9-1-->L10: Formula: (and (= (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_3|) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= 1 (select |v_#valid_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 12#L10true [168] L10-->L12-8: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11) (= (store |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15 (store (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~nondet2_5|)) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15)) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) 1)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_4|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~nondet2] 35#L12-8true [2020-07-01 12:29:55,127 INFO L796 eck$LassoCheckResult]: Loop: 35#L12-8true [99] L12-8-->L12-1: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 15#L12-1true [147] L12-1-->L12-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 13#L12-2true [73] L12-2-->L12-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_5|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[] 22#L12-6true [81] L12-6-->L13: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 33#L13true [92] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 32#L13-1true [171] L13-1-->L14: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (store |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20 (store (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_20)) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_20))) InVars {#valid=|v_#valid_32|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 19#L14true [174] L14-->L12-8: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 4) (select |v_#length_28| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 |v_ULTIMATE.start_test_fun_#t~nondet7_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_24|, #length=|v_#length_28|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_4|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~nondet7, #memory_int] 35#L12-8true [2020-07-01 12:29:55,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash 111869186, now seen corresponding path program 1 times [2020-07-01 12:29:55,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:55,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176203263] [2020-07-01 12:29:55,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:55,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176203263] [2020-07-01 12:29:55,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:55,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:29:55,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352569597] [2020-07-01 12:29:55,157 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:29:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:29:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash -605196570, now seen corresponding path program 1 times [2020-07-01 12:29:55,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:29:55,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609737788] [2020-07-01 12:29:55,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:29:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:29:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:29:55,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609737788] [2020-07-01 12:29:55,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:29:55,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:29:55,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592245396] [2020-07-01 12:29:55,176 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:29:55,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:29:55,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:29:55,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:29:55,178 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-01 12:29:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:29:55,248 INFO L93 Difference]: Finished difference Result 33 states and 55 transitions. [2020-07-01 12:29:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:29:55,251 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:29:55,255 INFO L168 Benchmark]: Toolchain (without parser) took 2211.99 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 562.7 MB in the beginning and 478.7 MB in the end (delta: 84.0 MB). Peak memory consumption was 127.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:29:55,255 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:29:55,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.60 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 562.7 MB in the beginning and 654.6 MB in the end (delta: -91.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:29:55,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.40 ms. Allocated memory is still 692.6 MB. Free memory was 654.6 MB in the beginning and 653.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:29:55,257 INFO L168 Benchmark]: Boogie Preprocessor took 24.11 ms. Allocated memory is still 692.6 MB. Free memory was 653.2 MB in the beginning and 651.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:29:55,258 INFO L168 Benchmark]: RCFGBuilder took 345.02 ms. Allocated memory is still 692.6 MB. Free memory was 651.9 MB in the beginning and 626.8 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:29:55,259 INFO L168 Benchmark]: BlockEncodingV2 took 133.98 ms. Allocated memory is still 692.6 MB. Free memory was 626.8 MB in the beginning and 616.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:29:55,259 INFO L168 Benchmark]: TraceAbstraction took 1165.81 ms. Allocated memory is still 692.6 MB. Free memory was 616.0 MB in the beginning and 499.0 MB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:29:55,260 INFO L168 Benchmark]: BuchiAutomizer took 182.02 ms. Allocated memory is still 692.6 MB. Free memory was 499.0 MB in the beginning and 478.7 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:29:55,264 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 41 locations, 43 edges - StatisticsResult: Encoded RCFG 33 locations, 58 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 314.60 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 562.7 MB in the beginning and 654.6 MB in the end (delta: -91.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.40 ms. Allocated memory is still 692.6 MB. Free memory was 654.6 MB in the beginning and 653.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.11 ms. Allocated memory is still 692.6 MB. Free memory was 653.2 MB in the beginning and 651.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 345.02 ms. Allocated memory is still 692.6 MB. Free memory was 651.9 MB in the beginning and 626.8 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 133.98 ms. Allocated memory is still 692.6 MB. Free memory was 626.8 MB in the beginning and 616.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1165.81 ms. Allocated memory is still 692.6 MB. Free memory was 616.0 MB in the beginning and 499.0 MB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 182.02 ms. Allocated memory is still 692.6 MB. Free memory was 499.0 MB in the beginning and 478.7 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 12:29:55,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:29:55,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:29:55,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:29:55,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:29:55,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:29:55,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((1 == \valid[tmp_ref] && 1 == \valid[x_ref]) && 4 == unknown-#length-unknown[x_ref]) && 0 == tmp_ref) && 4 == unknown-#length-unknown[tmp_ref]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 48 SDtfs, 225 SDslu, 4 SDs, 0 SdLazy, 195 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:29:49.791 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_XQAJHH/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:29:55.501 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check