/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/bhmr2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:47,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:47,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:47,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:47,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:47,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:47,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:47,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:47,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:47,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:47,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:47,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:47,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:47,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:47,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:47,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:47,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:47,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:47,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:47,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:47,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:47,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:47,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:47,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:47,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:47,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:47,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:47,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:47,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:47,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:47,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:47,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:47,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:47,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:47,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:47,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:47,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:47,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:47,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:47,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:47,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:47,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:47,450 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:47,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:47,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:47,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:47,455 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:47,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:47,456 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:47,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:47,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:47,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:47,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:47,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:47,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:47,457 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:47,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:47,457 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:47,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:47,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:47,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:47,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:47,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:47,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:47,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:47,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:47,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:47,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:47,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:47,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:47,461 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:47,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:47,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:47,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:47,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:47,835 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:47,835 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:47,837 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007.i [2020-07-17 22:51:47,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3b8cfa1/2ae1184ae6c54567afc6ea90bedad385/FLAG6af170f66 [2020-07-17 22:51:48,485 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:48,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2020-07-17 22:51:48,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3b8cfa1/2ae1184ae6c54567afc6ea90bedad385/FLAG6af170f66 [2020-07-17 22:51:48,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3b8cfa1/2ae1184ae6c54567afc6ea90bedad385 [2020-07-17 22:51:48,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:48,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:48,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:48,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:48,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:48,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:48" (1/1) ... [2020-07-17 22:51:48,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4db0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:48, skipping insertion in model container [2020-07-17 22:51:48,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:48" (1/1) ... [2020-07-17 22:51:48,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:48,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:49,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:49,122 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:49,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:49,165 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:49,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49 WrapperNode [2020-07-17 22:51:49,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:49,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:49,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:49,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:49,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (1/1) ... [2020-07-17 22:51:49,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (1/1) ... [2020-07-17 22:51:49,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (1/1) ... [2020-07-17 22:51:49,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (1/1) ... [2020-07-17 22:51:49,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (1/1) ... [2020-07-17 22:51:49,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (1/1) ... [2020-07-17 22:51:49,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (1/1) ... [2020-07-17 22:51:49,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:49,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:49,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:49,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:49,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (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-17 22:51:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:51:49,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:49,736 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:49,737 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:51:49,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:49 BoogieIcfgContainer [2020-07-17 22:51:49,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:49,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:49,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:49,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:49,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:48" (1/3) ... [2020-07-17 22:51:49,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662411e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:49, skipping insertion in model container [2020-07-17 22:51:49,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:49" (2/3) ... [2020-07-17 22:51:49,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662411e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:49, skipping insertion in model container [2020-07-17 22:51:49,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:49" (3/3) ... [2020-07-17 22:51:49,755 INFO L109 eAbstractionObserver]: Analyzing ICFG bhmr2007.i [2020-07-17 22:51:49,773 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:49,785 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:51:49,811 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:51:49,879 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:49,879 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:49,879 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:49,879 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:49,885 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:49,885 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:49,885 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:49,885 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-17 22:51:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:51:49,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:49,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:49,933 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:49,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:49,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1473011041, now seen corresponding path program 1 times [2020-07-17 22:51:49,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:49,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402783909] [2020-07-17 22:51:49,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:50,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:51:50,161 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #51#return; {24#true} is VALID [2020-07-17 22:51:50,163 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-17 22:51:50,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:51:50,164 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #51#return; {24#true} is VALID [2020-07-17 22:51:50,165 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2020-07-17 22:51:50,165 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {24#true} is VALID [2020-07-17 22:51:50,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {24#true} is VALID [2020-07-17 22:51:50,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-17 22:51:50,168 INFO L263 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {25#false} is VALID [2020-07-17 22:51:50,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2020-07-17 22:51:50,169 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2020-07-17 22:51:50,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-17 22:51:50,171 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-17 22:51:50,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402783909] [2020-07-17 22:51:50,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:50,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:51:50,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587046833] [2020-07-17 22:51:50,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-17 22:51:50,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:50,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:51:50,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:50,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:51:50,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:51:50,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:51:50,249 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-17 22:51:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:50,351 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-17 22:51:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:51:50,351 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-17 22:51:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:51:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-17 22:51:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:51:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-17 22:51:50,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2020-07-17 22:51:50,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:50,477 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:51:50,478 INFO L226 Difference]: Without dead ends: 14 [2020-07-17 22:51:50,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:51:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-17 22:51:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-17 22:51:50,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:50,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:50,550 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:50,550 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:50,556 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-17 22:51:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:51:50,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:50,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:50,558 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:50,559 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:50,564 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-17 22:51:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:51:50,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:50,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:50,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:50,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:51:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-17 22:51:50,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2020-07-17 22:51:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:50,574 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-17 22:51:50,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:51:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:51:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:51:50,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:50,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:50,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:50,577 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1462852310, now seen corresponding path program 1 times [2020-07-17 22:51:50,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:50,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223691936] [2020-07-17 22:51:50,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:50,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-17 22:51:50,928 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {121#true} {121#true} #51#return; {121#true} is VALID [2020-07-17 22:51:50,929 INFO L263 TraceCheckUtils]: 0: Hoare triple {121#true} call ULTIMATE.init(); {121#true} is VALID [2020-07-17 22:51:50,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-17 22:51:50,930 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} #51#return; {121#true} is VALID [2020-07-17 22:51:50,930 INFO L263 TraceCheckUtils]: 3: Hoare triple {121#true} call #t~ret2 := main(); {121#true} is VALID [2020-07-17 22:51:50,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {121#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {125#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-17 22:51:50,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {126#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-17 22:51:50,936 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {127#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-17 22:51:50,940 INFO L263 TraceCheckUtils]: 7: Hoare triple {127#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {128#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:50,942 INFO L280 TraceCheckUtils]: 8: Hoare triple {128#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {129#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:50,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {129#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {122#false} is VALID [2020-07-17 22:51:50,943 INFO L280 TraceCheckUtils]: 10: Hoare triple {122#false} assume !false; {122#false} is VALID [2020-07-17 22:51:50,945 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-17 22:51:50,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223691936] [2020-07-17 22:51:50,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:50,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:51:50,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720729463] [2020-07-17 22:51:50,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-17 22:51:50,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:50,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:51:50,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:50,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:51:50,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:51:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:50,976 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2020-07-17 22:51:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:51,301 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-17 22:51:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:51,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-17 22:51:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2020-07-17 22:51:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2020-07-17 22:51:51,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2020-07-17 22:51:51,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:51,351 INFO L225 Difference]: With dead ends: 21 [2020-07-17 22:51:51,352 INFO L226 Difference]: Without dead ends: 16 [2020-07-17 22:51:51,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:51:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-17 22:51:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-17 22:51:51,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:51,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2020-07-17 22:51:51,369 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2020-07-17 22:51:51,369 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2020-07-17 22:51:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:51,372 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-17 22:51:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-17 22:51:51,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:51,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:51,373 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2020-07-17 22:51:51,374 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2020-07-17 22:51:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:51,377 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-17 22:51:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-17 22:51:51,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:51,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:51,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:51,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:51:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-17 22:51:51,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2020-07-17 22:51:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:51,381 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-17 22:51:51,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:51:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:51:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:51:51,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:51,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:51,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:51:51,383 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash 467761921, now seen corresponding path program 1 times [2020-07-17 22:51:51,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:51,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419400223] [2020-07-17 22:51:51,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:51,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-17 22:51:51,730 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {224#true} {224#true} #51#return; {224#true} is VALID [2020-07-17 22:51:51,731 INFO L263 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2020-07-17 22:51:51,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-17 22:51:51,732 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #51#return; {224#true} is VALID [2020-07-17 22:51:51,732 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#true} call #t~ret2 := main(); {224#true} is VALID [2020-07-17 22:51:51,733 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {228#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-17 22:51:51,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {228#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-17 22:51:51,737 INFO L280 TraceCheckUtils]: 6: Hoare triple {228#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {229#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-17 22:51:51,740 INFO L280 TraceCheckUtils]: 7: Hoare triple {229#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1;havoc #t~nondet1;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {230#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-17 22:51:51,743 INFO L280 TraceCheckUtils]: 8: Hoare triple {230#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {231#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-17 22:51:51,745 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {232#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-17 22:51:51,748 INFO L263 TraceCheckUtils]: 10: Hoare triple {232#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {233#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:51,750 INFO L280 TraceCheckUtils]: 11: Hoare triple {233#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {234#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:51,751 INFO L280 TraceCheckUtils]: 12: Hoare triple {234#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {225#false} is VALID [2020-07-17 22:51:51,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-17 22:51:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:51,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419400223] [2020-07-17 22:51:51,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780128668] [2020-07-17 22:51:51,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:51,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-17 22:51:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:51,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:52,179 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:52,290 INFO L263 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2020-07-17 22:51:52,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-17 22:51:52,291 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #51#return; {224#true} is VALID [2020-07-17 22:51:52,291 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#true} call #t~ret2 := main(); {224#true} is VALID [2020-07-17 22:51:52,294 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {250#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:51:52,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {250#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:51:52,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {250#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {257#(and (< main_~i~0 main_~n~0) (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:51:52,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {257#(and (< main_~i~0 main_~n~0) (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} assume 0 != #t~nondet1;havoc #t~nondet1;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {261#(and (= 2 main_~b~0) (< main_~i~0 main_~n~0) (= 0 main_~i~0) (= 1 main_~a~0))} is VALID [2020-07-17 22:51:52,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {261#(and (= 2 main_~b~0) (< main_~i~0 main_~n~0) (= 0 main_~i~0) (= 1 main_~a~0))} ~i~0 := 1 + ~i~0; {265#(and (< 0 main_~n~0) (= 2 main_~b~0) (<= main_~i~0 1) (= 1 main_~a~0))} is VALID [2020-07-17 22:51:52,314 INFO L280 TraceCheckUtils]: 9: Hoare triple {265#(and (< 0 main_~n~0) (= 2 main_~b~0) (<= main_~i~0 1) (= 1 main_~a~0))} assume !(~i~0 < ~n~0); {269#(and (< 0 main_~n~0) (= 2 main_~b~0) (<= main_~n~0 1) (= 1 main_~a~0))} is VALID [2020-07-17 22:51:52,317 INFO L263 TraceCheckUtils]: 10: Hoare triple {269#(and (< 0 main_~n~0) (= 2 main_~b~0) (<= main_~n~0 1) (= 1 main_~a~0))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:52,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:52,322 INFO L280 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2020-07-17 22:51:52,323 INFO L280 TraceCheckUtils]: 13: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-17 22:51:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:52,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:52,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-17 22:51:52,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792611655] [2020-07-17 22:51:52,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-07-17 22:51:52,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:52,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:51:52,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:52,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:51:52,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:52,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:51:52,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:51:52,384 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 16 states. [2020-07-17 22:51:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:53,166 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-17 22:51:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:51:53,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-07-17 22:51:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:51:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2020-07-17 22:51:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:51:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2020-07-17 22:51:53,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 33 transitions. [2020-07-17 22:51:53,252 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-17 22:51:53,254 INFO L225 Difference]: With dead ends: 28 [2020-07-17 22:51:53,254 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:51:53,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:51:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:51:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-17 22:51:53,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:53,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-17 22:51:53,278 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-17 22:51:53,278 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-17 22:51:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:53,281 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-17 22:51:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-17 22:51:53,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:53,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:53,283 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-17 22:51:53,283 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-17 22:51:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:53,286 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-17 22:51:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-17 22:51:53,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:53,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:53,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:53,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:51:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-07-17 22:51:53,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2020-07-17 22:51:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:53,290 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-17 22:51:53,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:51:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-17 22:51:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:51:53,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:53,291 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:53,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:51:53,493 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash -798766796, now seen corresponding path program 1 times [2020-07-17 22:51:53,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:53,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574205545] [2020-07-17 22:51:53,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:53,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-17 22:51:53,931 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-17 22:51:53,932 INFO L263 TraceCheckUtils]: 0: Hoare triple {409#true} call ULTIMATE.init(); {409#true} is VALID [2020-07-17 22:51:53,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-17 22:51:53,934 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-17 22:51:53,935 INFO L263 TraceCheckUtils]: 3: Hoare triple {409#true} call #t~ret2 := main(); {409#true} is VALID [2020-07-17 22:51:53,938 INFO L280 TraceCheckUtils]: 4: Hoare triple {409#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {413#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-17 22:51:53,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {413#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {413#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-17 22:51:53,942 INFO L280 TraceCheckUtils]: 6: Hoare triple {413#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {413#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-17 22:51:53,943 INFO L280 TraceCheckUtils]: 7: Hoare triple {413#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !(0 != #t~nondet1);havoc #t~nondet1;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {414#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-17 22:51:53,945 INFO L280 TraceCheckUtils]: 8: Hoare triple {414#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {413#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-17 22:51:53,946 INFO L280 TraceCheckUtils]: 9: Hoare triple {413#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {415#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-17 22:51:53,948 INFO L280 TraceCheckUtils]: 10: Hoare triple {415#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1;havoc #t~nondet1;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {416#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-17 22:51:53,955 INFO L280 TraceCheckUtils]: 11: Hoare triple {416#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {417#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-17 22:51:53,957 INFO L280 TraceCheckUtils]: 12: Hoare triple {417#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {418#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-17 22:51:53,959 INFO L263 TraceCheckUtils]: 13: Hoare triple {418#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {419#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:53,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {419#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {420#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:53,961 INFO L280 TraceCheckUtils]: 15: Hoare triple {420#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {410#false} is VALID [2020-07-17 22:51:53,962 INFO L280 TraceCheckUtils]: 16: Hoare triple {410#false} assume !false; {410#false} is VALID [2020-07-17 22:51:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:51:53,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574205545] [2020-07-17 22:51:53,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746246330] [2020-07-17 22:51:53,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:53,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-17 22:51:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:54,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:54,331 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:54,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {409#true} call ULTIMATE.init(); {409#true} is VALID [2020-07-17 22:51:54,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-17 22:51:54,407 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-17 22:51:54,407 INFO L263 TraceCheckUtils]: 3: Hoare triple {409#true} call #t~ret2 := main(); {409#true} is VALID [2020-07-17 22:51:54,408 INFO L280 TraceCheckUtils]: 4: Hoare triple {409#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {436#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:51:54,409 INFO L280 TraceCheckUtils]: 5: Hoare triple {436#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {436#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:51:54,410 INFO L280 TraceCheckUtils]: 6: Hoare triple {436#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {436#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:51:54,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {436#(and (= 0 main_~a~0) (= 0 main_~b~0) (= 0 main_~i~0))} assume !(0 != #t~nondet1);havoc #t~nondet1;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {446#(and (= 2 main_~a~0) (= 0 main_~i~0) (= 1 main_~b~0))} is VALID [2020-07-17 22:51:54,412 INFO L280 TraceCheckUtils]: 8: Hoare triple {446#(and (= 2 main_~a~0) (= 0 main_~i~0) (= 1 main_~b~0))} ~i~0 := 1 + ~i~0; {450#(and (= 1 main_~i~0) (= 2 main_~a~0) (= 1 main_~b~0))} is VALID [2020-07-17 22:51:54,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {450#(and (= 1 main_~i~0) (= 2 main_~a~0) (= 1 main_~b~0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {454#(and (= 1 main_~i~0) (= 2 main_~a~0) (< main_~i~0 main_~n~0) (= 1 main_~b~0))} is VALID [2020-07-17 22:51:54,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {454#(and (= 1 main_~i~0) (= 2 main_~a~0) (< main_~i~0 main_~n~0) (= 1 main_~b~0))} assume 0 != #t~nondet1;havoc #t~nondet1;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {458#(and (= 3 main_~b~0) (= 3 main_~a~0) (= 1 main_~i~0) (< main_~i~0 main_~n~0))} is VALID [2020-07-17 22:51:54,416 INFO L280 TraceCheckUtils]: 11: Hoare triple {458#(and (= 3 main_~b~0) (= 3 main_~a~0) (= 1 main_~i~0) (< main_~i~0 main_~n~0))} ~i~0 := 1 + ~i~0; {462#(and (= 3 main_~b~0) (= 3 main_~a~0) (< 1 main_~n~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:51:54,417 INFO L280 TraceCheckUtils]: 12: Hoare triple {462#(and (= 3 main_~b~0) (= 3 main_~a~0) (< 1 main_~n~0) (<= main_~i~0 2))} assume !(~i~0 < ~n~0); {466#(and (= 3 main_~b~0) (= 3 main_~a~0) (< 1 main_~n~0) (<= main_~n~0 2))} is VALID [2020-07-17 22:51:54,419 INFO L263 TraceCheckUtils]: 13: Hoare triple {466#(and (= 3 main_~b~0) (= 3 main_~a~0) (< 1 main_~n~0) (<= main_~n~0 2))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:54,421 INFO L280 TraceCheckUtils]: 14: Hoare triple {470#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:54,422 INFO L280 TraceCheckUtils]: 15: Hoare triple {474#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {410#false} is VALID [2020-07-17 22:51:54,422 INFO L280 TraceCheckUtils]: 16: Hoare triple {410#false} assume !false; {410#false} is VALID [2020-07-17 22:51:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:54,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:54,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2020-07-17 22:51:54,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208455741] [2020-07-17 22:51:54,425 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-17 22:51:54,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:54,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:51:54,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:54,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:51:54,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:51:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:51:54,469 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 19 states. [2020-07-17 22:51:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:55,451 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-07-17 22:51:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 22:51:55,451 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-17 22:51:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:51:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-07-17 22:51:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:51:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-07-17 22:51:55,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 28 transitions. [2020-07-17 22:51:55,520 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-17 22:51:55,520 INFO L225 Difference]: With dead ends: 28 [2020-07-17 22:51:55,521 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:55,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2020-07-17 22:51:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:55,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:55,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,524 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,524 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:55,525 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:55,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:55,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:55,525 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,526 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:55,526 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:55,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:55,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:55,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:55,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:55,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-17 22:51:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:55,528 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:55,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:51:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:55,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:55,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:55,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:55,888 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:51:55,888 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:55,888 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:55,889 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:55,889 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:55,889 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:55,889 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:55,889 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:51:55,889 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:55,889 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:55,889 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 29) the Hoare annotation is: true [2020-07-17 22:51:55,890 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-17 22:51:55,890 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 29) no Hoare annotation was computed. [2020-07-17 22:51:55,890 INFO L268 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2020-07-17 22:51:55,890 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-17 22:51:55,890 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 24) no Hoare annotation was computed. [2020-07-17 22:51:55,890 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 26) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0)) (.cse1 (* 3 main_~i~0))) (and (<= .cse0 (* 3 main_~n~0)) (<= .cse1 .cse0) (<= .cse0 .cse1))) [2020-07-17 22:51:55,890 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 26) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~n~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-17 22:51:55,890 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 29) no Hoare annotation was computed. [2020-07-17 22:51:55,890 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:51:55,891 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:55,891 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:51:55,891 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:51:55,891 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:55,891 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:51:55,896 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:55,896 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:55,896 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:51:55,896 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:55,896 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:55,897 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:55,899 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:55,900 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:55,900 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:55,900 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:51:55,900 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:55,900 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:55,900 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:55,900 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:55,900 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:55,901 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:55,901 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-17 22:51:55,901 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:51:55,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:55 BoogieIcfgContainer [2020-07-17 22:51:55,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:55,918 INFO L168 Benchmark]: Toolchain (without parser) took 7134.34 ms. Allocated memory was 137.9 MB in the beginning and 276.8 MB in the end (delta: 138.9 MB). Free memory was 103.3 MB in the beginning and 172.4 MB in the end (delta: -69.1 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:55,918 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:55,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.81 ms. Allocated memory is still 137.9 MB. Free memory was 102.9 MB in the beginning and 92.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:55,920 INFO L168 Benchmark]: Boogie Preprocessor took 44.56 ms. Allocated memory is still 137.9 MB. Free memory was 92.9 MB in the beginning and 91.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:55,921 INFO L168 Benchmark]: RCFGBuilder took 530.91 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.3 MB in the beginning and 165.1 MB in the end (delta: -73.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:55,922 INFO L168 Benchmark]: TraceAbstraction took 6169.16 ms. Allocated memory was 202.4 MB in the beginning and 276.8 MB in the end (delta: 74.4 MB). Free memory was 164.4 MB in the beginning and 172.4 MB in the end (delta: -8.0 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:55,926 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.72 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 381.81 ms. Allocated memory is still 137.9 MB. Free memory was 102.9 MB in the beginning and 92.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.56 ms. Allocated memory is still 137.9 MB. Free memory was 92.9 MB in the beginning and 91.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 530.91 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.3 MB in the beginning and 165.1 MB in the end (delta: -73.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6169.16 ms. Allocated memory was 202.4 MB in the beginning and 276.8 MB in the end (delta: 74.4 MB). Free memory was 164.4 MB in the beginning and 172.4 MB in the end (delta: -8.0 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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 Derived loop invariant: (a + b <= 3 * n && 3 * i <= a + b) && a + b <= 3 * i - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.8s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 49 SDtfs, 26 SDslu, 135 SDs, 0 SdLazy, 266 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 42 HoareAnnotationTreeSize, 12 FomulaSimplifications, 127 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 137 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 7959 SizeOfPredicates, 6 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1/12 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...