/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/recursive/Addition01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:43:02,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:43:02,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:43:02,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:43:02,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:43:02,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:43:02,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:43:02,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:43:02,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:43:02,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:43:02,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:43:02,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:43:02,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:43:02,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:43:02,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:43:02,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:43:02,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:43:02,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:43:02,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:43:02,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:43:02,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:43:02,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:43:02,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:43:02,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:43:02,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:43:02,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:43:02,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:43:02,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:43:02,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:43:02,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:43:02,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:43:02,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:43:02,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:43:02,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:43:02,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:43:02,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:43:02,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:43:02,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:43:02,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:43:02,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:43:02,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:43:02,381 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-10 14:43:02,413 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:43:02,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:43:02,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:43:02,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:43:02,415 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:43:02,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:43:02,416 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:43:02,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:43:02,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:43:02,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:43:02,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:43:02,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:43:02,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:43:02,418 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:43:02,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:43:02,419 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:43:02,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:43:02,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:43:02,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:43:02,420 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:43:02,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:43:02,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:43:02,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:43:02,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:43:02,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:43:02,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:43:02,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:43:02,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:43:02,422 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:43:02,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:43:02,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:43:02,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:43:02,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:43:02,761 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:43:02,762 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:43:02,762 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Addition01-2.c [2020-07-10 14:43:02,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f993829/31d2faee7af0479a8b85461a3b6c02f5/FLAG4db1a367d [2020-07-10 14:43:03,379 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:43:03,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Addition01-2.c [2020-07-10 14:43:03,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f993829/31d2faee7af0479a8b85461a3b6c02f5/FLAG4db1a367d [2020-07-10 14:43:03,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f993829/31d2faee7af0479a8b85461a3b6c02f5 [2020-07-10 14:43:03,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:43:03,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:43:03,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:43:03,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:43:03,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:43:03,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:43:03" (1/1) ... [2020-07-10 14:43:03,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a645166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:03, skipping insertion in model container [2020-07-10 14:43:03,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:43:03" (1/1) ... [2020-07-10 14:43:03,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:43:03,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:43:03,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:43:03,969 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:43:03,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:43:04,005 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:43:04,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04 WrapperNode [2020-07-10 14:43:04,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:43:04,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:43:04,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:43:04,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:43:04,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (1/1) ... [2020-07-10 14:43:04,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (1/1) ... [2020-07-10 14:43:04,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (1/1) ... [2020-07-10 14:43:04,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (1/1) ... [2020-07-10 14:43:04,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (1/1) ... [2020-07-10 14:43:04,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (1/1) ... [2020-07-10 14:43:04,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (1/1) ... [2020-07-10 14:43:04,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:43:04,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:43:04,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:43:04,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:43:04,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (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-10 14:43:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:43:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:43:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-10 14:43:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:43:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:43:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:43:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-10 14:43:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:43:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:43:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:43:04,486 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:43:04,487 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:43:04,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:04 BoogieIcfgContainer [2020-07-10 14:43:04,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:43:04,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:43:04,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:43:04,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:43:04,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:43:03" (1/3) ... [2020-07-10 14:43:04,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af03db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:04, skipping insertion in model container [2020-07-10 14:43:04,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:04" (2/3) ... [2020-07-10 14:43:04,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af03db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:04, skipping insertion in model container [2020-07-10 14:43:04,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:04" (3/3) ... [2020-07-10 14:43:04,500 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition01-2.c [2020-07-10 14:43:04,517 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:43:04,530 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:43:04,549 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:43:04,581 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:43:04,582 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:43:04,582 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:43:04,582 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:43:04,582 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:43:04,583 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:43:04,583 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:43:04,583 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:43:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-10 14:43:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 14:43:04,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:04,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:04,617 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash -854965079, now seen corresponding path program 1 times [2020-07-10 14:43:04,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:04,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460471478] [2020-07-10 14:43:04,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:04,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 14:43:04,939 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #42#return; {29#true} is VALID [2020-07-10 14:43:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} ~m := #in~m;~n := #in~n; {39#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:05,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {40#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:05,028 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {40#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:05,031 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {29#true} #46#return; {37#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-10 14:43:05,032 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-10 14:43:05,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 14:43:05,033 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #42#return; {29#true} is VALID [2020-07-10 14:43:05,034 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2020-07-10 14:43:05,034 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {29#true} is VALID [2020-07-10 14:43:05,034 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {29#true} is VALID [2020-07-10 14:43:05,035 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {29#true} is VALID [2020-07-10 14:43:05,035 INFO L263 TraceCheckUtils]: 7: Hoare triple {29#true} call #t~ret4 := addition(~m~0, ~n~0); {29#true} is VALID [2020-07-10 14:43:05,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~m := #in~m;~n := #in~n; {39#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:05,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {40#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:05,040 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {40#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:05,044 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {29#true} #46#return; {37#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-10 14:43:05,047 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {38#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} is VALID [2020-07-10 14:43:05,048 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} assume !(~result~0 == ~m~0 + ~n~0); {30#false} is VALID [2020-07-10 14:43:05,049 INFO L280 TraceCheckUtils]: 14: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-10 14:43:05,052 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-10 14:43:05,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460471478] [2020-07-10 14:43:05,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:05,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:43:05,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254158944] [2020-07-10 14:43:05,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-10 14:43:05,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:05,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:43:05,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:05,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:43:05,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:05,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:43:05,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:05,115 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 6 states. [2020-07-10 14:43:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:05,566 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2020-07-10 14:43:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:43:05,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-10 14:43:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-10 14:43:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-10 14:43:05,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2020-07-10 14:43:05,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:05,672 INFO L225 Difference]: With dead ends: 38 [2020-07-10 14:43:05,672 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 14:43:05,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:43:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 14:43:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 14:43:05,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:05,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:05,724 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:05,724 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:05,730 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-10 14:43:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:43:05,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:05,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:05,732 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:05,732 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:05,737 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-10 14:43:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:43:05,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:05,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:05,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:05,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:43:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-10 14:43:05,745 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2020-07-10 14:43:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:05,745 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-10 14:43:05,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:43:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:43:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 14:43:05,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:05,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:05,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:43:05,748 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:05,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1632999070, now seen corresponding path program 1 times [2020-07-10 14:43:05,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:05,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254299941] [2020-07-10 14:43:05,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-10 14:43:05,781 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {171#true} {171#true} #42#return; {171#true} is VALID [2020-07-10 14:43:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {171#true} ~m := #in~m;~n := #in~n; {171#true} is VALID [2020-07-10 14:43:05,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} assume !(0 == ~n); {181#(not (= 0 addition_~n))} is VALID [2020-07-10 14:43:05,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {181#(not (= 0 addition_~n))} assume !(~n > 0); {182#(and (<= addition_~n 0) (not (= 0 addition_~n)))} is VALID [2020-07-10 14:43:05,836 INFO L280 TraceCheckUtils]: 3: Hoare triple {182#(and (<= addition_~n 0) (not (= 0 addition_~n)))} assume !(~n < 0); {172#false} is VALID [2020-07-10 14:43:05,836 INFO L280 TraceCheckUtils]: 4: Hoare triple {172#false} assume true; {172#false} is VALID [2020-07-10 14:43:05,836 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {172#false} {171#true} #46#return; {172#false} is VALID [2020-07-10 14:43:05,837 INFO L263 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2020-07-10 14:43:05,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-10 14:43:05,838 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #42#return; {171#true} is VALID [2020-07-10 14:43:05,838 INFO L263 TraceCheckUtils]: 3: Hoare triple {171#true} call #t~ret5 := main(); {171#true} is VALID [2020-07-10 14:43:05,838 INFO L280 TraceCheckUtils]: 4: Hoare triple {171#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {171#true} is VALID [2020-07-10 14:43:05,839 INFO L280 TraceCheckUtils]: 5: Hoare triple {171#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {171#true} is VALID [2020-07-10 14:43:05,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {171#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {171#true} is VALID [2020-07-10 14:43:05,839 INFO L263 TraceCheckUtils]: 7: Hoare triple {171#true} call #t~ret4 := addition(~m~0, ~n~0); {171#true} is VALID [2020-07-10 14:43:05,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {171#true} ~m := #in~m;~n := #in~n; {171#true} is VALID [2020-07-10 14:43:05,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {171#true} assume !(0 == ~n); {181#(not (= 0 addition_~n))} is VALID [2020-07-10 14:43:05,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {181#(not (= 0 addition_~n))} assume !(~n > 0); {182#(and (<= addition_~n 0) (not (= 0 addition_~n)))} is VALID [2020-07-10 14:43:05,843 INFO L280 TraceCheckUtils]: 11: Hoare triple {182#(and (<= addition_~n 0) (not (= 0 addition_~n)))} assume !(~n < 0); {172#false} is VALID [2020-07-10 14:43:05,843 INFO L280 TraceCheckUtils]: 12: Hoare triple {172#false} assume true; {172#false} is VALID [2020-07-10 14:43:05,843 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {172#false} {171#true} #46#return; {172#false} is VALID [2020-07-10 14:43:05,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {172#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {172#false} is VALID [2020-07-10 14:43:05,844 INFO L280 TraceCheckUtils]: 15: Hoare triple {172#false} assume !(~result~0 == ~m~0 + ~n~0); {172#false} is VALID [2020-07-10 14:43:05,844 INFO L280 TraceCheckUtils]: 16: Hoare triple {172#false} assume !false; {172#false} is VALID [2020-07-10 14:43:05,845 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-10 14:43:05,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254299941] [2020-07-10 14:43:05,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:05,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:43:05,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847753768] [2020-07-10 14:43:05,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 14:43:05,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:05,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:43:05,869 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-10 14:43:05,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:43:05,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:43:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:43:05,871 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 4 states. [2020-07-10 14:43:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:05,969 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-10 14:43:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:43:05,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 14:43:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:43:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-10 14:43:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:43:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-10 14:43:05,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2020-07-10 14:43:06,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:06,046 INFO L225 Difference]: With dead ends: 34 [2020-07-10 14:43:06,047 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 14:43:06,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10 14:43:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 14:43:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-10 14:43:06,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:06,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-10 14:43:06,064 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-10 14:43:06,064 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-10 14:43:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:06,068 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-10 14:43:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:43:06,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:06,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:06,069 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-10 14:43:06,070 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-10 14:43:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:06,073 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-10 14:43:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:43:06,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:06,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:06,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:06,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:43:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-10 14:43:06,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2020-07-10 14:43:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:06,079 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-10 14:43:06,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:43:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 14:43:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:43:06,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:06,080 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:06,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:43:06,081 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:06,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1746800232, now seen corresponding path program 1 times [2020-07-10 14:43:06,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:06,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021848033] [2020-07-10 14:43:06,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:06,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {311#true} assume true; {311#true} is VALID [2020-07-10 14:43:06,187 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {311#true} {311#true} #42#return; {311#true} is VALID [2020-07-10 14:43:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:06,317 INFO L280 TraceCheckUtils]: 0: Hoare triple {311#true} ~m := #in~m;~n := #in~n; {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:06,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:06,322 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} #48#return; {333#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-10 14:43:06,323 INFO L280 TraceCheckUtils]: 0: Hoare triple {311#true} ~m := #in~m;~n := #in~n; {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume !(0 == ~n); {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume ~n > 0; {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,326 INFO L263 TraceCheckUtils]: 3: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} call #t~ret0 := addition(1 + ~m, ~n - 1); {311#true} is VALID [2020-07-10 14:43:06,326 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#true} ~m := #in~m;~n := #in~n; {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,328 INFO L280 TraceCheckUtils]: 5: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:06,328 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:06,331 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} #48#return; {333#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-10 14:43:06,332 INFO L280 TraceCheckUtils]: 8: Hoare triple {333#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {334#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-10 14:43:06,333 INFO L280 TraceCheckUtils]: 9: Hoare triple {334#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} assume true; {334#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-10 14:43:06,335 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {334#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} {311#true} #46#return; {326#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-10 14:43:06,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {311#true} call ULTIMATE.init(); {311#true} is VALID [2020-07-10 14:43:06,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {311#true} assume true; {311#true} is VALID [2020-07-10 14:43:06,337 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {311#true} {311#true} #42#return; {311#true} is VALID [2020-07-10 14:43:06,337 INFO L263 TraceCheckUtils]: 3: Hoare triple {311#true} call #t~ret5 := main(); {311#true} is VALID [2020-07-10 14:43:06,338 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {311#true} is VALID [2020-07-10 14:43:06,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {311#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {311#true} is VALID [2020-07-10 14:43:06,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {311#true} is VALID [2020-07-10 14:43:06,339 INFO L263 TraceCheckUtils]: 7: Hoare triple {311#true} call #t~ret4 := addition(~m~0, ~n~0); {311#true} is VALID [2020-07-10 14:43:06,340 INFO L280 TraceCheckUtils]: 8: Hoare triple {311#true} ~m := #in~m;~n := #in~n; {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,341 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume !(0 == ~n); {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,342 INFO L280 TraceCheckUtils]: 10: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume ~n > 0; {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,343 INFO L263 TraceCheckUtils]: 11: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} call #t~ret0 := addition(1 + ~m, ~n - 1); {311#true} is VALID [2020-07-10 14:43:06,344 INFO L280 TraceCheckUtils]: 12: Hoare triple {311#true} ~m := #in~m;~n := #in~n; {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,345 INFO L280 TraceCheckUtils]: 13: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:06,346 INFO L280 TraceCheckUtils]: 14: Hoare triple {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:06,348 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {335#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} #48#return; {333#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} is VALID [2020-07-10 14:43:06,349 INFO L280 TraceCheckUtils]: 16: Hoare triple {333#(and (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#t~ret0|) (<= |addition_#t~ret0| (+ |addition_#in~n| |addition_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {334#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-10 14:43:06,350 INFO L280 TraceCheckUtils]: 17: Hoare triple {334#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} assume true; {334#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} is VALID [2020-07-10 14:43:06,352 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {334#(and (<= |addition_#res| (+ |addition_#in~n| |addition_#in~m|)) (<= (+ |addition_#in~n| |addition_#in~m|) |addition_#res|))} {311#true} #46#return; {326#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} is VALID [2020-07-10 14:43:06,353 INFO L280 TraceCheckUtils]: 19: Hoare triple {326#(and (<= (+ main_~m~0 main_~n~0) |main_#t~ret4|) (<= |main_#t~ret4| (+ main_~m~0 main_~n~0)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {327#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} is VALID [2020-07-10 14:43:06,355 INFO L280 TraceCheckUtils]: 20: Hoare triple {327#(and (<= (+ main_~m~0 main_~n~0) main_~result~0) (<= main_~result~0 (+ main_~m~0 main_~n~0)))} assume !(~result~0 == ~m~0 + ~n~0); {312#false} is VALID [2020-07-10 14:43:06,355 INFO L280 TraceCheckUtils]: 21: Hoare triple {312#false} assume !false; {312#false} is VALID [2020-07-10 14:43:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:43:06,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021848033] [2020-07-10 14:43:06,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777003285] [2020-07-10 14:43:06,359 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-10 14:43:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:06,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-10 14:43:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:06,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:06,781 INFO L263 TraceCheckUtils]: 0: Hoare triple {311#true} call ULTIMATE.init(); {311#true} is VALID [2020-07-10 14:43:06,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {311#true} assume true; {311#true} is VALID [2020-07-10 14:43:06,782 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {311#true} {311#true} #42#return; {311#true} is VALID [2020-07-10 14:43:06,782 INFO L263 TraceCheckUtils]: 3: Hoare triple {311#true} call #t~ret5 := main(); {311#true} is VALID [2020-07-10 14:43:06,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {311#true} is VALID [2020-07-10 14:43:06,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {311#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {311#true} is VALID [2020-07-10 14:43:06,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {311#true} is VALID [2020-07-10 14:43:06,783 INFO L263 TraceCheckUtils]: 7: Hoare triple {311#true} call #t~ret4 := addition(~m~0, ~n~0); {311#true} is VALID [2020-07-10 14:43:06,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {311#true} ~m := #in~m;~n := #in~n; {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,785 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume !(0 == ~n); {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,786 INFO L280 TraceCheckUtils]: 10: Hoare triple {328#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume ~n > 0; {369#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (< 0 addition_~n))} is VALID [2020-07-10 14:43:06,787 INFO L263 TraceCheckUtils]: 11: Hoare triple {369#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (< 0 addition_~n))} call #t~ret0 := addition(1 + ~m, ~n - 1); {311#true} is VALID [2020-07-10 14:43:06,787 INFO L280 TraceCheckUtils]: 12: Hoare triple {311#true} ~m := #in~m;~n := #in~n; {376#(and (<= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-10 14:43:06,788 INFO L280 TraceCheckUtils]: 13: Hoare triple {376#(and (<= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n;#res := ~m; {380#(and (<= |addition_#in~n| 0) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:06,789 INFO L280 TraceCheckUtils]: 14: Hoare triple {380#(and (<= |addition_#in~n| 0) (= |addition_#in~m| |addition_#res|))} assume true; {380#(and (<= |addition_#in~n| 0) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-10 14:43:06,791 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {380#(and (<= |addition_#in~n| 0) (= |addition_#in~m| |addition_#res|))} {369#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (< 0 addition_~n))} #48#return; {387#(and (< 0 |addition_#in~n|) (<= |addition_#in~n| 1) (= (+ |addition_#in~m| 1) |addition_#t~ret0|))} is VALID [2020-07-10 14:43:06,793 INFO L280 TraceCheckUtils]: 16: Hoare triple {387#(and (< 0 |addition_#in~n|) (<= |addition_#in~n| 1) (= (+ |addition_#in~m| 1) |addition_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {391#(and (< 0 |addition_#in~n|) (<= |addition_#in~n| 1) (= |addition_#res| (+ |addition_#in~m| 1)))} is VALID [2020-07-10 14:43:06,794 INFO L280 TraceCheckUtils]: 17: Hoare triple {391#(and (< 0 |addition_#in~n|) (<= |addition_#in~n| 1) (= |addition_#res| (+ |addition_#in~m| 1)))} assume true; {391#(and (< 0 |addition_#in~n|) (<= |addition_#in~n| 1) (= |addition_#res| (+ |addition_#in~m| 1)))} is VALID [2020-07-10 14:43:06,796 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {391#(and (< 0 |addition_#in~n|) (<= |addition_#in~n| 1) (= |addition_#res| (+ |addition_#in~m| 1)))} {311#true} #46#return; {398#(and (< 0 main_~n~0) (= |main_#t~ret4| (+ main_~m~0 1)) (<= main_~n~0 1))} is VALID [2020-07-10 14:43:06,797 INFO L280 TraceCheckUtils]: 19: Hoare triple {398#(and (< 0 main_~n~0) (= |main_#t~ret4| (+ main_~m~0 1)) (<= main_~n~0 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {402#(and (< 0 main_~n~0) (= main_~result~0 (+ main_~m~0 1)) (<= main_~n~0 1))} is VALID [2020-07-10 14:43:06,798 INFO L280 TraceCheckUtils]: 20: Hoare triple {402#(and (< 0 main_~n~0) (= main_~result~0 (+ main_~m~0 1)) (<= main_~n~0 1))} assume !(~result~0 == ~m~0 + ~n~0); {312#false} is VALID [2020-07-10 14:43:06,799 INFO L280 TraceCheckUtils]: 21: Hoare triple {312#false} assume !false; {312#false} is VALID [2020-07-10 14:43:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 14:43:06,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:06,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2020-07-10 14:43:06,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41281143] [2020-07-10 14:43:06,803 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-07-10 14:43:06,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:06,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 14:43:06,853 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-10 14:43:06,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 14:43:06,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:06,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 14:43:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:43:06,855 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 15 states. [2020-07-10 14:43:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:07,719 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2020-07-10 14:43:07,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 14:43:07,720 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-07-10 14:43:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:43:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 47 transitions. [2020-07-10 14:43:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:43:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 47 transitions. [2020-07-10 14:43:07,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 47 transitions. [2020-07-10 14:43:07,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:07,804 INFO L225 Difference]: With dead ends: 38 [2020-07-10 14:43:07,805 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 14:43:07,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-07-10 14:43:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 14:43:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2020-07-10 14:43:07,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:07,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 25 states. [2020-07-10 14:43:07,822 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 25 states. [2020-07-10 14:43:07,822 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 25 states. [2020-07-10 14:43:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:07,826 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-10 14:43:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-10 14:43:07,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:07,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:07,828 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 32 states. [2020-07-10 14:43:07,828 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 32 states. [2020-07-10 14:43:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:07,832 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-10 14:43:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-10 14:43:07,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:07,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:07,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:07,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 14:43:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-10 14:43:07,836 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2020-07-10 14:43:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:07,836 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-10 14:43:07,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 14:43:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-10 14:43:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:43:07,838 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:07,838 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:08,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:43:08,052 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1365148867, now seen corresponding path program 1 times [2020-07-10 14:43:08,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:08,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570160845] [2020-07-10 14:43:08,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {561#true} assume true; {561#true} is VALID [2020-07-10 14:43:08,094 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {561#true} {561#true} #42#return; {561#true} is VALID [2020-07-10 14:43:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {561#true} ~m := #in~m;~n := #in~n; {561#true} is VALID [2020-07-10 14:43:08,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {561#true} assume 0 == ~n;#res := ~m; {561#true} is VALID [2020-07-10 14:43:08,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {561#true} assume true; {561#true} is VALID [2020-07-10 14:43:08,143 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {561#true} {579#(<= (+ |addition_#in~n| 1) 0)} #50#return; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {561#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(~n > 0); {578#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n < 0; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,146 INFO L263 TraceCheckUtils]: 4: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} call #t~ret1 := addition(~m - 1, 1 + ~n); {561#true} is VALID [2020-07-10 14:43:08,146 INFO L280 TraceCheckUtils]: 5: Hoare triple {561#true} ~m := #in~m;~n := #in~n; {561#true} is VALID [2020-07-10 14:43:08,147 INFO L280 TraceCheckUtils]: 6: Hoare triple {561#true} assume 0 == ~n;#res := ~m; {561#true} is VALID [2020-07-10 14:43:08,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {561#true} assume true; {561#true} is VALID [2020-07-10 14:43:08,148 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {561#true} {579#(<= (+ |addition_#in~n| 1) 0)} #50#return; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,149 INFO L280 TraceCheckUtils]: 9: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,150 INFO L280 TraceCheckUtils]: 10: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} assume true; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,151 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {579#(<= (+ |addition_#in~n| 1) 0)} {565#(<= 0 main_~n~0)} #46#return; {562#false} is VALID [2020-07-10 14:43:08,152 INFO L263 TraceCheckUtils]: 0: Hoare triple {561#true} call ULTIMATE.init(); {561#true} is VALID [2020-07-10 14:43:08,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {561#true} assume true; {561#true} is VALID [2020-07-10 14:43:08,152 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {561#true} {561#true} #42#return; {561#true} is VALID [2020-07-10 14:43:08,153 INFO L263 TraceCheckUtils]: 3: Hoare triple {561#true} call #t~ret5 := main(); {561#true} is VALID [2020-07-10 14:43:08,153 INFO L280 TraceCheckUtils]: 4: Hoare triple {561#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {561#true} is VALID [2020-07-10 14:43:08,153 INFO L280 TraceCheckUtils]: 5: Hoare triple {561#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {561#true} is VALID [2020-07-10 14:43:08,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {561#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {565#(<= 0 main_~n~0)} is VALID [2020-07-10 14:43:08,154 INFO L263 TraceCheckUtils]: 7: Hoare triple {565#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {561#true} is VALID [2020-07-10 14:43:08,155 INFO L280 TraceCheckUtils]: 8: Hoare triple {561#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,157 INFO L280 TraceCheckUtils]: 10: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(~n > 0); {578#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,158 INFO L280 TraceCheckUtils]: 11: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n < 0; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,158 INFO L263 TraceCheckUtils]: 12: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} call #t~ret1 := addition(~m - 1, 1 + ~n); {561#true} is VALID [2020-07-10 14:43:08,158 INFO L280 TraceCheckUtils]: 13: Hoare triple {561#true} ~m := #in~m;~n := #in~n; {561#true} is VALID [2020-07-10 14:43:08,158 INFO L280 TraceCheckUtils]: 14: Hoare triple {561#true} assume 0 == ~n;#res := ~m; {561#true} is VALID [2020-07-10 14:43:08,159 INFO L280 TraceCheckUtils]: 15: Hoare triple {561#true} assume true; {561#true} is VALID [2020-07-10 14:43:08,160 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {561#true} {579#(<= (+ |addition_#in~n| 1) 0)} #50#return; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,161 INFO L280 TraceCheckUtils]: 17: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,161 INFO L280 TraceCheckUtils]: 18: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} assume true; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,163 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {579#(<= (+ |addition_#in~n| 1) 0)} {565#(<= 0 main_~n~0)} #46#return; {562#false} is VALID [2020-07-10 14:43:08,163 INFO L280 TraceCheckUtils]: 20: Hoare triple {562#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {562#false} is VALID [2020-07-10 14:43:08,163 INFO L280 TraceCheckUtils]: 21: Hoare triple {562#false} assume !(~result~0 == ~m~0 + ~n~0); {562#false} is VALID [2020-07-10 14:43:08,163 INFO L280 TraceCheckUtils]: 22: Hoare triple {562#false} assume !false; {562#false} is VALID [2020-07-10 14:43:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 14:43:08,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570160845] [2020-07-10 14:43:08,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670328994] [2020-07-10 14:43:08,165 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-10 14:43:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 14:43:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:08,263 INFO L263 TraceCheckUtils]: 0: Hoare triple {561#true} call ULTIMATE.init(); {561#true} is VALID [2020-07-10 14:43:08,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {561#true} assume true; {561#true} is VALID [2020-07-10 14:43:08,264 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {561#true} {561#true} #42#return; {561#true} is VALID [2020-07-10 14:43:08,264 INFO L263 TraceCheckUtils]: 3: Hoare triple {561#true} call #t~ret5 := main(); {561#true} is VALID [2020-07-10 14:43:08,264 INFO L280 TraceCheckUtils]: 4: Hoare triple {561#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {561#true} is VALID [2020-07-10 14:43:08,264 INFO L280 TraceCheckUtils]: 5: Hoare triple {561#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {561#true} is VALID [2020-07-10 14:43:08,265 INFO L280 TraceCheckUtils]: 6: Hoare triple {561#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {565#(<= 0 main_~n~0)} is VALID [2020-07-10 14:43:08,265 INFO L263 TraceCheckUtils]: 7: Hoare triple {565#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {561#true} is VALID [2020-07-10 14:43:08,266 INFO L280 TraceCheckUtils]: 8: Hoare triple {561#true} ~m := #in~m;~n := #in~n; {611#(<= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,267 INFO L280 TraceCheckUtils]: 9: Hoare triple {611#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {611#(<= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {611#(<= |addition_#in~n| addition_~n)} assume !(~n > 0); {611#(<= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,268 INFO L280 TraceCheckUtils]: 11: Hoare triple {611#(<= |addition_#in~n| addition_~n)} assume ~n < 0; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,269 INFO L263 TraceCheckUtils]: 12: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} call #t~ret1 := addition(~m - 1, 1 + ~n); {561#true} is VALID [2020-07-10 14:43:08,269 INFO L280 TraceCheckUtils]: 13: Hoare triple {561#true} ~m := #in~m;~n := #in~n; {561#true} is VALID [2020-07-10 14:43:08,269 INFO L280 TraceCheckUtils]: 14: Hoare triple {561#true} assume 0 == ~n;#res := ~m; {561#true} is VALID [2020-07-10 14:43:08,270 INFO L280 TraceCheckUtils]: 15: Hoare triple {561#true} assume true; {561#true} is VALID [2020-07-10 14:43:08,271 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {561#true} {579#(<= (+ |addition_#in~n| 1) 0)} #50#return; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,271 INFO L280 TraceCheckUtils]: 17: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,272 INFO L280 TraceCheckUtils]: 18: Hoare triple {579#(<= (+ |addition_#in~n| 1) 0)} assume true; {579#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,273 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {579#(<= (+ |addition_#in~n| 1) 0)} {565#(<= 0 main_~n~0)} #46#return; {562#false} is VALID [2020-07-10 14:43:08,274 INFO L280 TraceCheckUtils]: 20: Hoare triple {562#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {562#false} is VALID [2020-07-10 14:43:08,274 INFO L280 TraceCheckUtils]: 21: Hoare triple {562#false} assume !(~result~0 == ~m~0 + ~n~0); {562#false} is VALID [2020-07-10 14:43:08,274 INFO L280 TraceCheckUtils]: 22: Hoare triple {562#false} assume !false; {562#false} is VALID [2020-07-10 14:43:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 14:43:08,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:08,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-10 14:43:08,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675889357] [2020-07-10 14:43:08,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:43:08,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:08,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:43:08,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:08,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:43:08,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:08,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:43:08,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:08,311 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 6 states. [2020-07-10 14:43:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:08,502 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 14:43:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:43:08,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:43:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-10 14:43:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-10 14:43:08,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-10 14:43:08,549 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-10 14:43:08,551 INFO L225 Difference]: With dead ends: 31 [2020-07-10 14:43:08,551 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:43:08,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:43:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:43:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-10 14:43:08,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:08,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-10 14:43:08,584 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:43:08,585 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:43:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:08,590 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-10 14:43:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-10 14:43:08,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:08,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:08,591 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:43:08,591 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:43:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:08,596 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-10 14:43:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-10 14:43:08,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:08,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:08,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:08,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 14:43:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-07-10 14:43:08,601 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 23 [2020-07-10 14:43:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:08,601 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-07-10 14:43:08,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:43:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-10 14:43:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:43:08,603 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:08,603 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:08,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:08,804 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1459427924, now seen corresponding path program 1 times [2020-07-10 14:43:08,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:08,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676713900] [2020-07-10 14:43:08,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {784#true} assume true; {784#true} is VALID [2020-07-10 14:43:08,847 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {784#true} {784#true} #42#return; {784#true} is VALID [2020-07-10 14:43:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {784#true} is VALID [2020-07-10 14:43:08,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {784#true} assume 0 == ~n;#res := ~m; {784#true} is VALID [2020-07-10 14:43:08,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2020-07-10 14:43:08,936 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {784#true} {821#(<= (+ |addition_#in~n| 1) 0)} #50#return; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,937 INFO L280 TraceCheckUtils]: 1: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume !(~n > 0); {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume ~n < 0; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,939 INFO L263 TraceCheckUtils]: 4: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} call #t~ret1 := addition(~m - 1, 1 + ~n); {784#true} is VALID [2020-07-10 14:43:08,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {784#true} is VALID [2020-07-10 14:43:08,940 INFO L280 TraceCheckUtils]: 6: Hoare triple {784#true} assume 0 == ~n;#res := ~m; {784#true} is VALID [2020-07-10 14:43:08,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {784#true} assume true; {784#true} is VALID [2020-07-10 14:43:08,942 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {784#true} {821#(<= (+ |addition_#in~n| 1) 0)} #50#return; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} assume true; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,945 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {821#(<= (+ |addition_#in~n| 1) 0)} {807#(<= 1 addition_~n)} #48#return; {785#false} is VALID [2020-07-10 14:43:08,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {784#true} is VALID [2020-07-10 14:43:08,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {784#true} assume !(0 == ~n); {784#true} is VALID [2020-07-10 14:43:08,951 INFO L280 TraceCheckUtils]: 2: Hoare triple {784#true} assume ~n > 0; {807#(<= 1 addition_~n)} is VALID [2020-07-10 14:43:08,951 INFO L263 TraceCheckUtils]: 3: Hoare triple {807#(<= 1 addition_~n)} call #t~ret0 := addition(1 + ~m, ~n - 1); {784#true} is VALID [2020-07-10 14:43:08,957 INFO L280 TraceCheckUtils]: 4: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,958 INFO L280 TraceCheckUtils]: 5: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume !(~n > 0); {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,959 INFO L280 TraceCheckUtils]: 7: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume ~n < 0; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,959 INFO L263 TraceCheckUtils]: 8: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} call #t~ret1 := addition(~m - 1, 1 + ~n); {784#true} is VALID [2020-07-10 14:43:08,960 INFO L280 TraceCheckUtils]: 9: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {784#true} is VALID [2020-07-10 14:43:08,960 INFO L280 TraceCheckUtils]: 10: Hoare triple {784#true} assume 0 == ~n;#res := ~m; {784#true} is VALID [2020-07-10 14:43:08,960 INFO L280 TraceCheckUtils]: 11: Hoare triple {784#true} assume true; {784#true} is VALID [2020-07-10 14:43:08,961 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {784#true} {821#(<= (+ |addition_#in~n| 1) 0)} #50#return; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,962 INFO L280 TraceCheckUtils]: 13: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} assume true; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,964 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {821#(<= (+ |addition_#in~n| 1) 0)} {807#(<= 1 addition_~n)} #48#return; {785#false} is VALID [2020-07-10 14:43:08,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {785#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {785#false} is VALID [2020-07-10 14:43:08,965 INFO L280 TraceCheckUtils]: 17: Hoare triple {785#false} assume true; {785#false} is VALID [2020-07-10 14:43:08,965 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {785#false} {784#true} #46#return; {785#false} is VALID [2020-07-10 14:43:08,966 INFO L263 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2020-07-10 14:43:08,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {784#true} assume true; {784#true} is VALID [2020-07-10 14:43:08,966 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {784#true} {784#true} #42#return; {784#true} is VALID [2020-07-10 14:43:08,966 INFO L263 TraceCheckUtils]: 3: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2020-07-10 14:43:08,967 INFO L280 TraceCheckUtils]: 4: Hoare triple {784#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {784#true} is VALID [2020-07-10 14:43:08,967 INFO L280 TraceCheckUtils]: 5: Hoare triple {784#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {784#true} is VALID [2020-07-10 14:43:08,967 INFO L280 TraceCheckUtils]: 6: Hoare triple {784#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {784#true} is VALID [2020-07-10 14:43:08,968 INFO L263 TraceCheckUtils]: 7: Hoare triple {784#true} call #t~ret4 := addition(~m~0, ~n~0); {784#true} is VALID [2020-07-10 14:43:08,968 INFO L280 TraceCheckUtils]: 8: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {784#true} is VALID [2020-07-10 14:43:08,968 INFO L280 TraceCheckUtils]: 9: Hoare triple {784#true} assume !(0 == ~n); {784#true} is VALID [2020-07-10 14:43:08,969 INFO L280 TraceCheckUtils]: 10: Hoare triple {784#true} assume ~n > 0; {807#(<= 1 addition_~n)} is VALID [2020-07-10 14:43:08,969 INFO L263 TraceCheckUtils]: 11: Hoare triple {807#(<= 1 addition_~n)} call #t~ret0 := addition(1 + ~m, ~n - 1); {784#true} is VALID [2020-07-10 14:43:08,970 INFO L280 TraceCheckUtils]: 12: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,971 INFO L280 TraceCheckUtils]: 13: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,972 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume !(~n > 0); {820#(= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:08,973 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#(= |addition_#in~n| addition_~n)} assume ~n < 0; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,973 INFO L263 TraceCheckUtils]: 16: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} call #t~ret1 := addition(~m - 1, 1 + ~n); {784#true} is VALID [2020-07-10 14:43:08,974 INFO L280 TraceCheckUtils]: 17: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {784#true} is VALID [2020-07-10 14:43:08,974 INFO L280 TraceCheckUtils]: 18: Hoare triple {784#true} assume 0 == ~n;#res := ~m; {784#true} is VALID [2020-07-10 14:43:08,974 INFO L280 TraceCheckUtils]: 19: Hoare triple {784#true} assume true; {784#true} is VALID [2020-07-10 14:43:08,976 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {784#true} {821#(<= (+ |addition_#in~n| 1) 0)} #50#return; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,977 INFO L280 TraceCheckUtils]: 21: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,978 INFO L280 TraceCheckUtils]: 22: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} assume true; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:08,980 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {821#(<= (+ |addition_#in~n| 1) 0)} {807#(<= 1 addition_~n)} #48#return; {785#false} is VALID [2020-07-10 14:43:08,981 INFO L280 TraceCheckUtils]: 24: Hoare triple {785#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {785#false} is VALID [2020-07-10 14:43:08,981 INFO L280 TraceCheckUtils]: 25: Hoare triple {785#false} assume true; {785#false} is VALID [2020-07-10 14:43:08,982 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {785#false} {784#true} #46#return; {785#false} is VALID [2020-07-10 14:43:08,982 INFO L280 TraceCheckUtils]: 27: Hoare triple {785#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {785#false} is VALID [2020-07-10 14:43:08,982 INFO L280 TraceCheckUtils]: 28: Hoare triple {785#false} assume !(~result~0 == ~m~0 + ~n~0); {785#false} is VALID [2020-07-10 14:43:08,982 INFO L280 TraceCheckUtils]: 29: Hoare triple {785#false} assume !false; {785#false} is VALID [2020-07-10 14:43:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:43:08,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676713900] [2020-07-10 14:43:08,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211551131] [2020-07-10 14:43:08,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:09,043 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 14:43:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:09,059 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:09,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2020-07-10 14:43:09,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {784#true} assume true; {784#true} is VALID [2020-07-10 14:43:09,145 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {784#true} {784#true} #42#return; {784#true} is VALID [2020-07-10 14:43:09,145 INFO L263 TraceCheckUtils]: 3: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2020-07-10 14:43:09,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {784#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {784#true} is VALID [2020-07-10 14:43:09,146 INFO L280 TraceCheckUtils]: 5: Hoare triple {784#true} assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {784#true} is VALID [2020-07-10 14:43:09,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {784#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {784#true} is VALID [2020-07-10 14:43:09,147 INFO L263 TraceCheckUtils]: 7: Hoare triple {784#true} call #t~ret4 := addition(~m~0, ~n~0); {784#true} is VALID [2020-07-10 14:43:09,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {784#true} is VALID [2020-07-10 14:43:09,147 INFO L280 TraceCheckUtils]: 9: Hoare triple {784#true} assume !(0 == ~n); {784#true} is VALID [2020-07-10 14:43:09,148 INFO L280 TraceCheckUtils]: 10: Hoare triple {784#true} assume ~n > 0; {807#(<= 1 addition_~n)} is VALID [2020-07-10 14:43:09,149 INFO L263 TraceCheckUtils]: 11: Hoare triple {807#(<= 1 addition_~n)} call #t~ret0 := addition(1 + ~m, ~n - 1); {784#true} is VALID [2020-07-10 14:43:09,150 INFO L280 TraceCheckUtils]: 12: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {865#(<= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:09,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {865#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {865#(<= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:09,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {865#(<= |addition_#in~n| addition_~n)} assume !(~n > 0); {865#(<= |addition_#in~n| addition_~n)} is VALID [2020-07-10 14:43:09,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {865#(<= |addition_#in~n| addition_~n)} assume ~n < 0; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:09,156 INFO L263 TraceCheckUtils]: 16: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} call #t~ret1 := addition(~m - 1, 1 + ~n); {784#true} is VALID [2020-07-10 14:43:09,157 INFO L280 TraceCheckUtils]: 17: Hoare triple {784#true} ~m := #in~m;~n := #in~n; {784#true} is VALID [2020-07-10 14:43:09,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {784#true} assume 0 == ~n;#res := ~m; {784#true} is VALID [2020-07-10 14:43:09,157 INFO L280 TraceCheckUtils]: 19: Hoare triple {784#true} assume true; {784#true} is VALID [2020-07-10 14:43:09,160 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {784#true} {821#(<= (+ |addition_#in~n| 1) 0)} #50#return; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:09,161 INFO L280 TraceCheckUtils]: 21: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:09,162 INFO L280 TraceCheckUtils]: 22: Hoare triple {821#(<= (+ |addition_#in~n| 1) 0)} assume true; {821#(<= (+ |addition_#in~n| 1) 0)} is VALID [2020-07-10 14:43:09,163 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {821#(<= (+ |addition_#in~n| 1) 0)} {807#(<= 1 addition_~n)} #48#return; {785#false} is VALID [2020-07-10 14:43:09,163 INFO L280 TraceCheckUtils]: 24: Hoare triple {785#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {785#false} is VALID [2020-07-10 14:43:09,164 INFO L280 TraceCheckUtils]: 25: Hoare triple {785#false} assume true; {785#false} is VALID [2020-07-10 14:43:09,164 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {785#false} {784#true} #46#return; {785#false} is VALID [2020-07-10 14:43:09,164 INFO L280 TraceCheckUtils]: 27: Hoare triple {785#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {785#false} is VALID [2020-07-10 14:43:09,164 INFO L280 TraceCheckUtils]: 28: Hoare triple {785#false} assume !(~result~0 == ~m~0 + ~n~0); {785#false} is VALID [2020-07-10 14:43:09,165 INFO L280 TraceCheckUtils]: 29: Hoare triple {785#false} assume !false; {785#false} is VALID [2020-07-10 14:43:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:43:09,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:09,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-10 14:43:09,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840135005] [2020-07-10 14:43:09,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:43:09,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:09,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:43:09,204 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-10 14:43:09,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:43:09,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:09,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:43:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:09,206 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 6 states. [2020-07-10 14:43:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:09,383 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-07-10 14:43:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:43:09,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:43:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 14:43:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 14:43:09,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-10 14:43:09,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:09,448 INFO L225 Difference]: With dead ends: 32 [2020-07-10 14:43:09,448 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:43:09,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-10 14:43:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:43:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:43:09,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:09,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:09,450 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:09,450 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:09,450 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:43:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:09,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:09,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:09,451 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:09,451 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:09,451 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:43:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:09,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:09,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:09,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:09,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:43:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:43:09,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2020-07-10 14:43:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:09,453 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:43:09,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:43:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:09,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:09,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:09,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:43:09,745 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:43:09,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:43:09,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:43:09,745 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:43:09,745 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:43:09,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:43:09,745 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2020-07-10 14:43:09,746 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 45) the Hoare annotation is: true [2020-07-10 14:43:09,746 INFO L268 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2020-07-10 14:43:09,746 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 26 45) no Hoare annotation was computed. [2020-07-10 14:43:09,746 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 26 45) no Hoare annotation was computed. [2020-07-10 14:43:09,746 INFO L268 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2020-07-10 14:43:09,746 INFO L268 CegarLoopResult]: For program point L40(lines 40 44) no Hoare annotation was computed. [2020-07-10 14:43:09,746 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-10 14:43:09,746 INFO L268 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2020-07-10 14:43:09,746 INFO L268 CegarLoopResult]: For program point L34(lines 34 38) no Hoare annotation was computed. [2020-07-10 14:43:09,747 INFO L268 CegarLoopResult]: For program point additionFINAL(lines 13 23) no Hoare annotation was computed. [2020-07-10 14:43:09,747 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (<= addition_~n 0) (= |addition_#in~m| addition_~m) (not (= 0 addition_~n))) [2020-07-10 14:43:09,747 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-10 14:43:09,747 INFO L268 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2020-07-10 14:43:09,747 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m) (< 0 addition_~n)) [2020-07-10 14:43:09,747 INFO L268 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-07-10 14:43:09,747 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-10 14:43:09,747 INFO L271 CegarLoopResult]: At program point additionENTRY(lines 13 23) the Hoare annotation is: true [2020-07-10 14:43:09,748 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-10 14:43:09,748 INFO L268 CegarLoopResult]: For program point additionEXIT(lines 13 23) no Hoare annotation was computed. [2020-07-10 14:43:09,753 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:43:09,753 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:43:09,753 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:43:09,753 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:43:09,753 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:43:09,754 WARN L170 areAnnotationChecker]: additionFINAL has no Hoare annotation [2020-07-10 14:43:09,755 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:43:09,755 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:43:09,755 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:43:09,755 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 14:43:09,755 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-10 14:43:09,755 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-10 14:43:09,755 WARN L170 areAnnotationChecker]: additionEXIT has no Hoare annotation [2020-07-10 14:43:09,755 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 14:43:09,756 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:43:09,756 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:43:09,756 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 14:43:09,756 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 14:43:09,756 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-10 14:43:09,756 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-10 14:43:09,756 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 14:43:09,756 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 14:43:09,757 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:43:09,757 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:43:09,757 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-10 14:43:09,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:43:09 BoogieIcfgContainer [2020-07-10 14:43:09,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:43:09,763 INFO L168 Benchmark]: Toolchain (without parser) took 6034.34 ms. Allocated memory was 145.2 MB in the beginning and 277.9 MB in the end (delta: 132.6 MB). Free memory was 102.0 MB in the beginning and 142.0 MB in the end (delta: -40.1 MB). Peak memory consumption was 92.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:09,763 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:43:09,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.94 ms. Allocated memory is still 145.2 MB. Free memory was 101.8 MB in the beginning and 91.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:09,765 INFO L168 Benchmark]: Boogie Preprocessor took 30.38 ms. Allocated memory is still 145.2 MB. Free memory was 91.9 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:09,766 INFO L168 Benchmark]: RCFGBuilder took 454.23 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 90.3 MB in the beginning and 163.1 MB in the end (delta: -72.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:09,767 INFO L168 Benchmark]: TraceAbstraction took 5267.19 ms. Allocated memory was 202.4 MB in the beginning and 277.9 MB in the end (delta: 75.5 MB). Free memory was 162.5 MB in the beginning and 142.0 MB in the end (delta: 20.4 MB). Peak memory consumption was 95.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:09,770 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.94 ms. Allocated memory is still 145.2 MB. Free memory was 101.8 MB in the beginning and 91.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.38 ms. Allocated memory is still 145.2 MB. Free memory was 91.9 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 454.23 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 90.3 MB in the beginning and 163.1 MB in the end (delta: -72.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5267.19 ms. Allocated memory was 202.4 MB in the beginning and 277.9 MB in the end (delta: 75.5 MB). Free memory was 162.5 MB in the beginning and 142.0 MB in the end (delta: 20.4 MB). Peak memory consumption was 95.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 101 SDtfs, 58 SDslu, 245 SDs, 0 SdLazy, 305 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 14 NumberOfFragments, 32 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 10904 SizeOfPredicates, 11 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 33/42 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...