./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/nested_1-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/nested_1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ec34260dbdf702968911eb4443c2b37192d60c9 .............................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/nested_1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ec34260dbdf702968911eb4443c2b37192d60c9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:13:33,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:13:33,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:13:33,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:13:33,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:13:33,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:13:33,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:13:33,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:13:33,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:13:33,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:13:33,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:13:33,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:13:33,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:13:33,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:13:33,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:13:33,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:13:33,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:13:33,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:13:33,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:13:33,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:13:33,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:13:33,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:13:33,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:13:33,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:13:33,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:13:33,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:13:33,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:13:33,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:13:33,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:13:33,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:13:33,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:13:33,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:13:33,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:13:33,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:13:33,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:13:33,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:13:33,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:13:33,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:13:33,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:13:33,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:13:33,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:13:33,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:13:33,379 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:13:33,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:13:33,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:13:33,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:13:33,382 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:13:33,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:13:33,382 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:13:33,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:13:33,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:13:33,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:13:33,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:13:33,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:13:33,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:13:33,384 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:13:33,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:13:33,384 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:13:33,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:13:33,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:13:33,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:13:33,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:13:33,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:13:33,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:33,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:13:33,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:13:33,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:13:33,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:13:33,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:13:33,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:13:33,387 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:13:33,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ec34260dbdf702968911eb4443c2b37192d60c9 [2020-07-28 18:13:33,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:13:33,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:13:33,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:13:33,770 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:13:33,771 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:13:33,771 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/nested_1-1.c [2020-07-28 18:13:33,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d61055f/dd3c6230a9874e87b4825167b078d815/FLAG7c12a5510 [2020-07-28 18:13:34,315 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:13:34,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/nested_1-1.c [2020-07-28 18:13:34,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d61055f/dd3c6230a9874e87b4825167b078d815/FLAG7c12a5510 [2020-07-28 18:13:34,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d61055f/dd3c6230a9874e87b4825167b078d815 [2020-07-28 18:13:34,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:13:34,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:13:34,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:34,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:13:34,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:13:34,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:34,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab0d7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34, skipping insertion in model container [2020-07-28 18:13:34,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:34,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:13:34,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:13:34,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:34,938 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:13:34,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:34,971 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:13:34,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34 WrapperNode [2020-07-28 18:13:34,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:34,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:34,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:13:34,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:13:34,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:34,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:35,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:35,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:13:35,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:13:35,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:13:35,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:35,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:35,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:35,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:35,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:35,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:35,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... [2020-07-28 18:13:35,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:13:35,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:13:35,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:13:35,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:13:35,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:13:35,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:13:35,370 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:13:35,370 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 18:13:35,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:35 BoogieIcfgContainer [2020-07-28 18:13:35,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:13:35,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:13:35,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:13:35,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:13:35,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:13:34" (1/3) ... [2020-07-28 18:13:35,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8649cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:35, skipping insertion in model container [2020-07-28 18:13:35,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:34" (2/3) ... [2020-07-28 18:13:35,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8649cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:35, skipping insertion in model container [2020-07-28 18:13:35,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:35" (3/3) ... [2020-07-28 18:13:35,384 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2020-07-28 18:13:35,395 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:13:35,403 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:13:35,420 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:13:35,451 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:13:35,452 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:13:35,452 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:13:35,452 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:13:35,453 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:13:35,454 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:13:35,454 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:13:35,454 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:13:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-07-28 18:13:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:35,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:35,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:35,498 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:35,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:35,517 INFO L82 PathProgramCache]: Analyzing trace with hash 29817909, now seen corresponding path program 1 times [2020-07-28 18:13:35,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:13:35,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895283945] [2020-07-28 18:13:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:13:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:35,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:13:35,685 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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-28 18:13:35,691 INFO L168 Benchmark]: Toolchain (without parser) took 990.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:35,692 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:35,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.73 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:35,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:35,697 INFO L168 Benchmark]: Boogie Preprocessor took 24.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:35,698 INFO L168 Benchmark]: RCFGBuilder took 289.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:35,699 INFO L168 Benchmark]: TraceAbstraction took 312.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:35,708 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.73 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 289.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 312.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:13:37,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:13:37,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:13:37,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:13:37,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:13:37,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:13:37,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:13:37,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:13:37,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:13:37,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:13:37,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:13:37,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:13:37,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:13:37,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:13:37,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:13:37,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:13:37,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:13:37,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:13:37,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:13:37,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:13:37,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:13:37,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:13:37,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:13:37,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:13:37,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:13:37,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:13:37,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:13:37,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:13:37,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:13:37,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:13:37,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:13:37,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:13:37,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:13:37,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:13:37,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:13:37,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:13:37,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:13:37,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:13:37,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:13:37,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:13:37,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:13:37,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 18:13:37,773 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:13:37,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:13:37,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:13:37,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:13:37,778 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:13:37,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:13:37,779 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:13:37,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:13:37,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:13:37,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:13:37,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:13:37,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:13:37,783 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:13:37,783 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:13:37,783 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:13:37,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:13:37,783 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:13:37,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:13:37,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:13:37,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:13:37,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:13:37,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:13:37,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:37,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:13:37,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:13:37,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:13:37,786 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:13:37,786 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:13:37,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:13:37,787 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:13:37,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:13:37,788 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ec34260dbdf702968911eb4443c2b37192d60c9 [2020-07-28 18:13:38,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:13:38,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:13:38,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:13:38,102 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:13:38,105 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:13:38,106 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/nested_1-1.c [2020-07-28 18:13:38,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f00b8698/c79f43df340c4b20b05e0e2a4e72b971/FLAGd9492f4ed [2020-07-28 18:13:38,659 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:13:38,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/nested_1-1.c [2020-07-28 18:13:38,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f00b8698/c79f43df340c4b20b05e0e2a4e72b971/FLAGd9492f4ed [2020-07-28 18:13:39,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f00b8698/c79f43df340c4b20b05e0e2a4e72b971 [2020-07-28 18:13:39,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:13:39,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:13:39,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:39,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:13:39,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:13:39,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bdcc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39, skipping insertion in model container [2020-07-28 18:13:39,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:13:39,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:13:39,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:39,224 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:13:39,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:39,254 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:13:39,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39 WrapperNode [2020-07-28 18:13:39,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:39,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:39,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:13:39,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:13:39,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:39,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:13:39,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:13:39,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:13:39,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... [2020-07-28 18:13:39,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:13:39,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:13:39,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:13:39,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:13:39,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:13:39,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:13:39,650 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:13:39,651 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 18:13:39,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:39 BoogieIcfgContainer [2020-07-28 18:13:39,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:13:39,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:13:39,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:13:39,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:13:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:13:39" (1/3) ... [2020-07-28 18:13:39,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357ed7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:39, skipping insertion in model container [2020-07-28 18:13:39,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:39" (2/3) ... [2020-07-28 18:13:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357ed7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:39, skipping insertion in model container [2020-07-28 18:13:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:39" (3/3) ... [2020-07-28 18:13:39,663 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2020-07-28 18:13:39,674 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:13:39,681 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:13:39,698 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:13:39,741 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:13:39,742 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:13:39,742 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:13:39,742 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:13:39,742 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:13:39,743 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:13:39,743 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:13:39,743 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:13:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-07-28 18:13:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:39,772 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:39,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:39,773 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:39,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 29817909, now seen corresponding path program 1 times [2020-07-28 18:13:39,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:39,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147951288] [2020-07-28 18:13:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:39,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:13:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:39,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:39,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {19#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:39,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 268435455bv32); {15#false} is VALID [2020-07-28 18:13:39,931 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15#false} is VALID [2020-07-28 18:13:39,931 INFO L280 TraceCheckUtils]: 3: Hoare triple {15#false} assume 0bv32 == __VERIFIER_assert_~cond; {15#false} is VALID [2020-07-28 18:13:39,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {15#false} assume !false; {15#false} is VALID [2020-07-28 18:13:39,934 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-28 18:13:39,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:39,956 INFO L280 TraceCheckUtils]: 4: Hoare triple {15#false} assume !false; {15#false} is VALID [2020-07-28 18:13:39,956 INFO L280 TraceCheckUtils]: 3: Hoare triple {15#false} assume 0bv32 == __VERIFIER_assert_~cond; {15#false} is VALID [2020-07-28 18:13:39,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15#false} is VALID [2020-07-28 18:13:39,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#(bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32))} assume !~bvult32(main_~x~0, 268435455bv32); {15#false} is VALID [2020-07-28 18:13:39,959 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {41#(bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32))} is VALID [2020-07-28 18:13:39,960 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-28 18:13:39,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147951288] [2020-07-28 18:13:39,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:39,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-07-28 18:13:39,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146981452] [2020-07-28 18:13:39,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:13:39,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:39,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:13:40,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:40,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:13:40,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:40,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:13:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:13:40,015 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2020-07-28 18:13:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:40,152 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. [2020-07-28 18:13:40,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:13:40,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:13:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:13:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2020-07-28 18:13:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:13:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2020-07-28 18:13:40,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2020-07-28 18:13:40,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:40,253 INFO L225 Difference]: With dead ends: 25 [2020-07-28 18:13:40,253 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:13:40,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:13:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:13:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-28 18:13:40,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:40,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-28 18:13:40,298 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:13:40,299 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:13:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:40,301 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-28 18:13:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-28 18:13:40,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:40,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:40,303 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:13:40,303 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:13:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:40,305 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-28 18:13:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-28 18:13:40,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:40,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:40,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:40,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:13:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-07-28 18:13:40,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2020-07-28 18:13:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:40,311 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-28 18:13:40,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:13:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-28 18:13:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 18:13:40,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:40,313 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2020-07-28 18:13:40,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:13:40,525 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:40,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:40,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2071722443, now seen corresponding path program 1 times [2020-07-28 18:13:40,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:40,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524849324] [2020-07-28 18:13:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:40,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:13:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:40,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:40,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {119#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {119#true} is VALID [2020-07-28 18:13:40,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {119#true} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {127#(= (_ bv0 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:13:40,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {127#(= (_ bv0 32) ULTIMATE.start_main_~y~0)} assume !~bvult32(main_~y~0, 10bv32); {120#false} is VALID [2020-07-28 18:13:40,585 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {120#false} is VALID [2020-07-28 18:13:40,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#false} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {120#false} is VALID [2020-07-28 18:13:40,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {120#false} assume !~bvult32(main_~y~0, 10bv32); {120#false} is VALID [2020-07-28 18:13:40,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {120#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {120#false} is VALID [2020-07-28 18:13:40,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {120#false} assume !~bvult32(main_~x~0, 268435455bv32); {120#false} is VALID [2020-07-28 18:13:40,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {120#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {120#false} is VALID [2020-07-28 18:13:40,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {120#false} assume 0bv32 == __VERIFIER_assert_~cond; {120#false} is VALID [2020-07-28 18:13:40,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {120#false} assume !false; {120#false} is VALID [2020-07-28 18:13:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:13:40,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:40,619 INFO L280 TraceCheckUtils]: 10: Hoare triple {120#false} assume !false; {120#false} is VALID [2020-07-28 18:13:40,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {120#false} assume 0bv32 == __VERIFIER_assert_~cond; {120#false} is VALID [2020-07-28 18:13:40,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {120#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {120#false} is VALID [2020-07-28 18:13:40,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {120#false} assume !~bvult32(main_~x~0, 268435455bv32); {120#false} is VALID [2020-07-28 18:13:40,621 INFO L280 TraceCheckUtils]: 6: Hoare triple {120#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {120#false} is VALID [2020-07-28 18:13:40,621 INFO L280 TraceCheckUtils]: 5: Hoare triple {120#false} assume !~bvult32(main_~y~0, 10bv32); {120#false} is VALID [2020-07-28 18:13:40,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#false} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {120#false} is VALID [2020-07-28 18:13:40,622 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {120#false} is VALID [2020-07-28 18:13:40,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {179#(bvult ULTIMATE.start_main_~y~0 (_ bv10 32))} assume !~bvult32(main_~y~0, 10bv32); {120#false} is VALID [2020-07-28 18:13:40,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {119#true} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {179#(bvult ULTIMATE.start_main_~y~0 (_ bv10 32))} is VALID [2020-07-28 18:13:40,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {119#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {119#true} is VALID [2020-07-28 18:13:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:13:40,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524849324] [2020-07-28 18:13:40,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:40,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-07-28 18:13:40,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779088228] [2020-07-28 18:13:40,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 18:13:40,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:40,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:13:40,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:40,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:13:40,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:40,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:13:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:13:40,655 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 4 states. [2020-07-28 18:13:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:40,724 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-07-28 18:13:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:13:40,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 18:13:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:13:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-07-28 18:13:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:13:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-07-28 18:13:40,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2020-07-28 18:13:40,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:40,775 INFO L225 Difference]: With dead ends: 25 [2020-07-28 18:13:40,775 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 18:13:40,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:13:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 18:13:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 18:13:40,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:40,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:40,794 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:40,794 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:40,797 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-28 18:13:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 18:13:40,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:40,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:40,798 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:40,798 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:40,801 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-28 18:13:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 18:13:40,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:40,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:40,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:40,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:13:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-28 18:13:40,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2020-07-28 18:13:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:40,805 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-28 18:13:40,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:13:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 18:13:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 18:13:40,807 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:40,807 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1] [2020-07-28 18:13:41,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:13:41,027 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1249079755, now seen corresponding path program 1 times [2020-07-28 18:13:41,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:41,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913869689] [2020-07-28 18:13:41,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2020-07-28 18:13:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:41,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:41,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:41,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {279#true} is VALID [2020-07-28 18:13:41,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {287#(= (_ bv0 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:13:41,152 INFO L280 TraceCheckUtils]: 2: Hoare triple {287#(= (_ bv0 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {291#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:41,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {291#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {295#(= (_ bv2 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:13:41,155 INFO L280 TraceCheckUtils]: 4: Hoare triple {295#(= (_ bv2 32) ULTIMATE.start_main_~y~0)} assume !~bvult32(main_~y~0, 10bv32); {280#false} is VALID [2020-07-28 18:13:41,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {280#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {280#false} is VALID [2020-07-28 18:13:41,156 INFO L280 TraceCheckUtils]: 6: Hoare triple {280#false} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {280#false} is VALID [2020-07-28 18:13:41,156 INFO L280 TraceCheckUtils]: 7: Hoare triple {280#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {280#false} is VALID [2020-07-28 18:13:41,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {280#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {280#false} is VALID [2020-07-28 18:13:41,157 INFO L280 TraceCheckUtils]: 9: Hoare triple {280#false} assume !~bvult32(main_~y~0, 10bv32); {280#false} is VALID [2020-07-28 18:13:41,157 INFO L280 TraceCheckUtils]: 10: Hoare triple {280#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {280#false} is VALID [2020-07-28 18:13:41,158 INFO L280 TraceCheckUtils]: 11: Hoare triple {280#false} assume !~bvult32(main_~x~0, 268435455bv32); {280#false} is VALID [2020-07-28 18:13:41,158 INFO L280 TraceCheckUtils]: 12: Hoare triple {280#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {280#false} is VALID [2020-07-28 18:13:41,159 INFO L280 TraceCheckUtils]: 13: Hoare triple {280#false} assume 0bv32 == __VERIFIER_assert_~cond; {280#false} is VALID [2020-07-28 18:13:41,159 INFO L280 TraceCheckUtils]: 14: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-28 18:13:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 18:13:41,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:41,274 INFO L280 TraceCheckUtils]: 14: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-28 18:13:41,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {280#false} assume 0bv32 == __VERIFIER_assert_~cond; {280#false} is VALID [2020-07-28 18:13:41,275 INFO L280 TraceCheckUtils]: 12: Hoare triple {280#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {280#false} is VALID [2020-07-28 18:13:41,276 INFO L280 TraceCheckUtils]: 11: Hoare triple {280#false} assume !~bvult32(main_~x~0, 268435455bv32); {280#false} is VALID [2020-07-28 18:13:41,276 INFO L280 TraceCheckUtils]: 10: Hoare triple {280#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {280#false} is VALID [2020-07-28 18:13:41,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {280#false} assume !~bvult32(main_~y~0, 10bv32); {280#false} is VALID [2020-07-28 18:13:41,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {280#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {280#false} is VALID [2020-07-28 18:13:41,277 INFO L280 TraceCheckUtils]: 7: Hoare triple {280#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {280#false} is VALID [2020-07-28 18:13:41,281 INFO L280 TraceCheckUtils]: 6: Hoare triple {280#false} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {280#false} is VALID [2020-07-28 18:13:41,282 INFO L280 TraceCheckUtils]: 5: Hoare triple {280#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {280#false} is VALID [2020-07-28 18:13:41,287 INFO L280 TraceCheckUtils]: 4: Hoare triple {359#(bvult ULTIMATE.start_main_~y~0 (_ bv10 32))} assume !~bvult32(main_~y~0, 10bv32); {280#false} is VALID [2020-07-28 18:13:41,289 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {359#(bvult ULTIMATE.start_main_~y~0 (_ bv10 32))} is VALID [2020-07-28 18:13:41,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {363#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv1 32)) (_ bv10 32))} is VALID [2020-07-28 18:13:41,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {367#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv2 32)) (_ bv10 32))} is VALID [2020-07-28 18:13:41,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {279#true} is VALID [2020-07-28 18:13:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 18:13:41,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913869689] [2020-07-28 18:13:41,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:13:41,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-28 18:13:41,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787431470] [2020-07-28 18:13:41,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-28 18:13:41,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:41,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:13:41,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:41,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:13:41,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:41,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:13:41,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:13:41,340 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2020-07-28 18:13:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:41,670 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-07-28 18:13:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:13:41,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-28 18:13:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:13:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2020-07-28 18:13:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:13:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2020-07-28 18:13:41,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2020-07-28 18:13:41,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:41,733 INFO L225 Difference]: With dead ends: 35 [2020-07-28 18:13:41,733 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 18:13:41,734 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:13:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 18:13:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-28 18:13:41,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:41,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-28 18:13:41,763 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-28 18:13:41,763 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-28 18:13:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:41,765 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-28 18:13:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-28 18:13:41,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:41,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:41,767 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-28 18:13:41,767 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-28 18:13:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:41,769 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-28 18:13:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-28 18:13:41,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:41,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:41,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:41,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 18:13:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-28 18:13:41,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2020-07-28 18:13:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:41,773 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-28 18:13:41,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:13:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-28 18:13:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 18:13:41,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:41,774 INFO L422 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1] [2020-07-28 18:13:41,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:13:41,975 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1393978933, now seen corresponding path program 2 times [2020-07-28 18:13:41,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:41,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869224102] [2020-07-28 18:13:41,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:42,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:13:42,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:13:42,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 18:13:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:42,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:42,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {523#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {523#true} is VALID [2020-07-28 18:13:42,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#true} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {531#(= (_ bv0 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:13:42,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {531#(= (_ bv0 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {535#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:42,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {535#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {539#(= (_ bv2 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:13:42,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {539#(= (_ bv2 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {543#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:42,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {543#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {547#(= (_ bv4 32) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:13:42,139 INFO L280 TraceCheckUtils]: 6: Hoare triple {547#(= (_ bv4 32) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {551#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:42,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {551#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {555#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:42,141 INFO L280 TraceCheckUtils]: 8: Hoare triple {555#(= (bvadd ULTIMATE.start_main_~y~0 (_ bv4294967290 32)) (_ bv0 32))} assume !~bvult32(main_~y~0, 10bv32); {524#false} is VALID [2020-07-28 18:13:42,141 INFO L280 TraceCheckUtils]: 9: Hoare triple {524#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {524#false} is VALID [2020-07-28 18:13:42,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {524#false} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {524#false} is VALID [2020-07-28 18:13:42,142 INFO L280 TraceCheckUtils]: 11: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,142 INFO L280 TraceCheckUtils]: 12: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,143 INFO L280 TraceCheckUtils]: 13: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,143 INFO L280 TraceCheckUtils]: 15: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,144 INFO L280 TraceCheckUtils]: 16: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,144 INFO L280 TraceCheckUtils]: 17: Hoare triple {524#false} assume !~bvult32(main_~y~0, 10bv32); {524#false} is VALID [2020-07-28 18:13:42,144 INFO L280 TraceCheckUtils]: 18: Hoare triple {524#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {524#false} is VALID [2020-07-28 18:13:42,144 INFO L280 TraceCheckUtils]: 19: Hoare triple {524#false} assume !~bvult32(main_~x~0, 268435455bv32); {524#false} is VALID [2020-07-28 18:13:42,145 INFO L280 TraceCheckUtils]: 20: Hoare triple {524#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {524#false} is VALID [2020-07-28 18:13:42,145 INFO L280 TraceCheckUtils]: 21: Hoare triple {524#false} assume 0bv32 == __VERIFIER_assert_~cond; {524#false} is VALID [2020-07-28 18:13:42,145 INFO L280 TraceCheckUtils]: 22: Hoare triple {524#false} assume !false; {524#false} is VALID [2020-07-28 18:13:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-28 18:13:42,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:42,395 INFO L280 TraceCheckUtils]: 22: Hoare triple {524#false} assume !false; {524#false} is VALID [2020-07-28 18:13:42,396 INFO L280 TraceCheckUtils]: 21: Hoare triple {524#false} assume 0bv32 == __VERIFIER_assert_~cond; {524#false} is VALID [2020-07-28 18:13:42,396 INFO L280 TraceCheckUtils]: 20: Hoare triple {524#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {524#false} is VALID [2020-07-28 18:13:42,396 INFO L280 TraceCheckUtils]: 19: Hoare triple {524#false} assume !~bvult32(main_~x~0, 268435455bv32); {524#false} is VALID [2020-07-28 18:13:42,396 INFO L280 TraceCheckUtils]: 18: Hoare triple {524#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {524#false} is VALID [2020-07-28 18:13:42,397 INFO L280 TraceCheckUtils]: 17: Hoare triple {524#false} assume !~bvult32(main_~y~0, 10bv32); {524#false} is VALID [2020-07-28 18:13:42,397 INFO L280 TraceCheckUtils]: 16: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,397 INFO L280 TraceCheckUtils]: 15: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,398 INFO L280 TraceCheckUtils]: 14: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,398 INFO L280 TraceCheckUtils]: 13: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,399 INFO L280 TraceCheckUtils]: 12: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,399 INFO L280 TraceCheckUtils]: 11: Hoare triple {524#false} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {524#false} is VALID [2020-07-28 18:13:42,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {524#false} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {524#false} is VALID [2020-07-28 18:13:42,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {524#false} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {524#false} is VALID [2020-07-28 18:13:42,401 INFO L280 TraceCheckUtils]: 8: Hoare triple {643#(bvult ULTIMATE.start_main_~y~0 (_ bv10 32))} assume !~bvult32(main_~y~0, 10bv32); {524#false} is VALID [2020-07-28 18:13:42,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {647#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {643#(bvult ULTIMATE.start_main_~y~0 (_ bv10 32))} is VALID [2020-07-28 18:13:42,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {647#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv1 32)) (_ bv10 32))} is VALID [2020-07-28 18:13:42,407 INFO L280 TraceCheckUtils]: 5: Hoare triple {655#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv3 32)) (_ bv10 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {651#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv2 32)) (_ bv10 32))} is VALID [2020-07-28 18:13:42,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {659#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {655#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv3 32)) (_ bv10 32))} is VALID [2020-07-28 18:13:42,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {663#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv5 32)) (_ bv10 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {659#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv4 32)) (_ bv10 32))} is VALID [2020-07-28 18:13:42,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv6 32)) (_ bv10 32))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {663#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv5 32)) (_ bv10 32))} is VALID [2020-07-28 18:13:42,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#true} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {667#(bvult (bvadd ULTIMATE.start_main_~y~0 (_ bv6 32)) (_ bv10 32))} is VALID [2020-07-28 18:13:42,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {523#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {523#true} is VALID [2020-07-28 18:13:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-28 18:13:42,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869224102] [2020-07-28 18:13:42,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:13:42,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-28 18:13:42,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670717402] [2020-07-28 18:13:42,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2020-07-28 18:13:42,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:42,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-28 18:13:42,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:42,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-28 18:13:42,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:42,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-28 18:13:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:13:42,482 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 16 states. [2020-07-28 18:13:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:43,038 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2020-07-28 18:13:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 18:13:43,038 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2020-07-28 18:13:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:13:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2020-07-28 18:13:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:13:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2020-07-28 18:13:43,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 32 transitions. [2020-07-28 18:13:43,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:43,088 INFO L225 Difference]: With dead ends: 47 [2020-07-28 18:13:43,088 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 18:13:43,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-07-28 18:13:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 18:13:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-28 18:13:43,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:43,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-28 18:13:43,143 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-28 18:13:43,143 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-28 18:13:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:43,146 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-28 18:13:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-28 18:13:43,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:43,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:43,147 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-28 18:13:43,148 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-28 18:13:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:43,151 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-28 18:13:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-28 18:13:43,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:43,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:43,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:43,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 18:13:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-28 18:13:43,154 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2020-07-28 18:13:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:43,155 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-28 18:13:43,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-28 18:13:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-28 18:13:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-28 18:13:43,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:43,157 INFO L422 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1] [2020-07-28 18:13:43,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:13:43,368 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:43,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:43,369 INFO L82 PathProgramCache]: Analyzing trace with hash -180613579, now seen corresponding path program 3 times [2020-07-28 18:13:43,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:43,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045490126] [2020-07-28 18:13:43,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:43,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-07-28 18:13:43,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:13:43,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 18:13:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:43,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:43,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {879#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,538 INFO L280 TraceCheckUtils]: 4: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,540 INFO L280 TraceCheckUtils]: 8: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,548 INFO L280 TraceCheckUtils]: 11: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~y~0, 10bv32); {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,550 INFO L280 TraceCheckUtils]: 13: Hoare triple {884#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,551 INFO L280 TraceCheckUtils]: 15: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,553 INFO L280 TraceCheckUtils]: 17: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,554 INFO L280 TraceCheckUtils]: 18: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,555 INFO L280 TraceCheckUtils]: 19: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,556 INFO L280 TraceCheckUtils]: 20: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,557 INFO L280 TraceCheckUtils]: 21: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,558 INFO L280 TraceCheckUtils]: 22: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,558 INFO L280 TraceCheckUtils]: 23: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,559 INFO L280 TraceCheckUtils]: 24: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~y~0, 10bv32); {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,561 INFO L280 TraceCheckUtils]: 26: Hoare triple {924#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {964#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:43,562 INFO L280 TraceCheckUtils]: 27: Hoare triple {964#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 268435455bv32); {880#false} is VALID [2020-07-28 18:13:43,562 INFO L280 TraceCheckUtils]: 28: Hoare triple {880#false} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {880#false} is VALID [2020-07-28 18:13:43,563 INFO L280 TraceCheckUtils]: 29: Hoare triple {880#false} assume 0bv32 == __VERIFIER_assert_~cond; {880#false} is VALID [2020-07-28 18:13:43,563 INFO L280 TraceCheckUtils]: 30: Hoare triple {880#false} assume !false; {880#false} is VALID [2020-07-28 18:13:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-07-28 18:13:43,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:43,791 INFO L280 TraceCheckUtils]: 30: Hoare triple {880#false} assume !false; {880#false} is VALID [2020-07-28 18:13:43,791 INFO L280 TraceCheckUtils]: 29: Hoare triple {980#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {880#false} is VALID [2020-07-28 18:13:43,792 INFO L280 TraceCheckUtils]: 28: Hoare triple {984#(not (= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32)))} __VERIFIER_assert_#in~cond := ~bvurem32(main_~x~0, 2bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {980#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:13:43,792 INFO L280 TraceCheckUtils]: 27: Hoare triple {988#(or (not (= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32))) (bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32)))} assume !~bvult32(main_~x~0, 268435455bv32); {984#(not (= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2020-07-28 18:13:43,798 INFO L280 TraceCheckUtils]: 26: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {988#(or (not (= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32))) (bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32)))} is VALID [2020-07-28 18:13:43,799 INFO L280 TraceCheckUtils]: 25: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !~bvult32(main_~y~0, 10bv32); {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,799 INFO L280 TraceCheckUtils]: 24: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,800 INFO L280 TraceCheckUtils]: 23: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,800 INFO L280 TraceCheckUtils]: 22: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,800 INFO L280 TraceCheckUtils]: 21: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,801 INFO L280 TraceCheckUtils]: 20: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,801 INFO L280 TraceCheckUtils]: 19: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,802 INFO L280 TraceCheckUtils]: 18: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,802 INFO L280 TraceCheckUtils]: 17: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,803 INFO L280 TraceCheckUtils]: 15: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,803 INFO L280 TraceCheckUtils]: 14: Hoare triple {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,809 INFO L280 TraceCheckUtils]: 13: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {992#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,811 INFO L280 TraceCheckUtils]: 12: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !~bvult32(main_~y~0, 10bv32); {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,812 INFO L280 TraceCheckUtils]: 8: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,813 INFO L280 TraceCheckUtils]: 6: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,814 INFO L280 TraceCheckUtils]: 5: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,815 INFO L280 TraceCheckUtils]: 4: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,816 INFO L280 TraceCheckUtils]: 3: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~y~0, 10bv32);main_#t~post0 := main_~y~0;main_~y~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} assume !!~bvult32(main_~x~0, 268435455bv32);main_~y~0 := 0bv32; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {879#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := 0bv32; {1032#(or (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32)))))} is VALID [2020-07-28 18:13:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-07-28 18:13:43,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045490126] [2020-07-28 18:13:43,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:13:43,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2020-07-28 18:13:43,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358920635] [2020-07-28 18:13:43,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-28 18:13:43,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:43,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 18:13:43,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:43,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 18:13:43,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:43,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 18:13:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:13:43,867 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2020-07-28 18:13:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:44,371 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2020-07-28 18:13:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 18:13:44,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-28 18:13:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:13:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-28 18:13:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:13:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-28 18:13:44,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2020-07-28 18:13:44,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:44,446 INFO L225 Difference]: With dead ends: 75 [2020-07-28 18:13:44,446 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:13:44,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-28 18:13:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:13:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:13:44,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:44,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:44,449 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:44,450 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:44,450 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:13:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:44,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:44,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:44,450 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:44,451 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:44,451 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:13:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:44,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:44,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:44,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:44,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:13:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:13:44,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-28 18:13:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:44,452 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:13:44,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 18:13:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:44,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:44,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 18:13:44,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:13:44,817 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 19 [2020-07-28 18:13:44,906 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:13:44,906 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 19) the Hoare annotation is: (bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32)) [2020-07-28 18:13:44,909 INFO L268 CegarLoopResult]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2020-07-28 18:13:44,909 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 18:13:44,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:13:44,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:13:44,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-28 18:13:44,909 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 22) the Hoare annotation is: (or (not (= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32))) (bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32))) [2020-07-28 18:13:44,909 INFO L268 CegarLoopResult]: For program point L14-3(lines 14 22) no Hoare annotation was computed. [2020-07-28 18:13:44,909 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-28 18:13:44,910 INFO L271 CegarLoopResult]: At program point L4-2(lines 1 25) the Hoare annotation is: true [2020-07-28 18:13:44,914 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:13:44,915 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-28 18:13:44,915 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-28 18:13:44,916 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-28 18:13:44,916 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 18:13:44,916 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 18:13:44,916 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:13:44,917 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:13:44,917 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 18:13:44,917 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:13:44,917 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:13:44,917 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:13:44,917 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:13:44,917 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:13:44,922 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2020-07-28 18:13:44,923 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2020-07-28 18:13:44,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:13:44 BoogieIcfgContainer [2020-07-28 18:13:44,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:13:44,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:13:44,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:13:44,937 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:13:44,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:39" (3/4) ... [2020-07-28 18:13:44,943 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:13:44,956 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:13:44,956 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:13:44,997 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:13:44,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:13:44,999 INFO L168 Benchmark]: Toolchain (without parser) took 5971.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -122.1 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:45,000 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:45,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.63 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:45,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:45,002 INFO L168 Benchmark]: Boogie Preprocessor took 25.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:45,002 INFO L168 Benchmark]: RCFGBuilder took 278.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:45,003 INFO L168 Benchmark]: TraceAbstraction took 5280.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:45,004 INFO L168 Benchmark]: Witness Printer took 60.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:45,007 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 224.63 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 278.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5280.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. * Witness Printer took 60.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-07-28 18:13:45,015 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2020-07-28 18:13:45,015 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 Derived loop invariant: NULL - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: !(~bvurem32(x, 2bv32) == 0bv32) || ~bvult32(x, 268435455bv32) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 20, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 41 SDtfs, 33 SDslu, 105 SDs, 0 SdLazy, 151 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 65 NumberOfFragments, 14 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1029 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 17026 SizeOfPredicates, 4 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 410/708 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...