/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-simple/id_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:16:31,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:16:31,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:16:31,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:16:31,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:16:31,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:16:31,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:16:31,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:16:31,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:16:31,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:16:31,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:16:31,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:16:31,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:16:31,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:16:31,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:16:31,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:16:31,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:16:31,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:16:31,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:16:31,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:16:31,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:16:31,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:16:31,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:16:31,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:16:31,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:16:31,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:16:31,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:16:31,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:16:31,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:16:31,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:16:31,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:16:31,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:16:31,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:16:31,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:16:31,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:16:31,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:16:31,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:16:31,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:16:31,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:16:31,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:16:31,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:16:31,529 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-08 12:16:31,543 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:16:31,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:16:31,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:16:31,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:16:31,545 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:16:31,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:16:31,546 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:16:31,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:16:31,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:16:31,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:16:31,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:16:31,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:16:31,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:16:31,547 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:16:31,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:16:31,547 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:16:31,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:16:31,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:16:31,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:16:31,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:16:31,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:16:31,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:16:31,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:16:31,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:16:31,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:16:31,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:16:31,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:16:31,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:16:31,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:16:31,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:16:31,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:16:31,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:16:31,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:16:31,851 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:16:31,852 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:16:31,852 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c [2020-07-08 12:16:31,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e42f6ae/d8e616f0a1974a1bb81a71464a0b3790/FLAG004c7f216 [2020-07-08 12:16:32,449 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:16:32,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c [2020-07-08 12:16:32,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e42f6ae/d8e616f0a1974a1bb81a71464a0b3790/FLAG004c7f216 [2020-07-08 12:16:32,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e42f6ae/d8e616f0a1974a1bb81a71464a0b3790 [2020-07-08 12:16:32,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:16:32,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:16:32,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:16:32,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:16:32,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:16:32,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:16:32" (1/1) ... [2020-07-08 12:16:32,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75237d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:32, skipping insertion in model container [2020-07-08 12:16:32,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:16:32" (1/1) ... [2020-07-08 12:16:32,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:16:32,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:16:32,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:16:32,976 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:16:32,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:16:33,008 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:16:33,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33 WrapperNode [2020-07-08 12:16:33,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:16:33,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:16:33,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:16:33,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:16:33,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (1/1) ... [2020-07-08 12:16:33,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (1/1) ... [2020-07-08 12:16:33,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (1/1) ... [2020-07-08 12:16:33,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (1/1) ... [2020-07-08 12:16:33,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (1/1) ... [2020-07-08 12:16:33,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (1/1) ... [2020-07-08 12:16:33,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (1/1) ... [2020-07-08 12:16:33,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:16:33,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:16:33,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:16:33,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:16:33,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (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-08 12:16:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:16:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:16:33,169 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-08 12:16:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:16:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:16:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:16:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-08 12:16:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:16:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:16:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:16:33,383 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:16:33,384 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:16:33,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:16:33 BoogieIcfgContainer [2020-07-08 12:16:33,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:16:33,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:16:33,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:16:33,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:16:33,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:16:32" (1/3) ... [2020-07-08 12:16:33,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62053ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:16:33, skipping insertion in model container [2020-07-08 12:16:33,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:33" (2/3) ... [2020-07-08 12:16:33,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62053ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:16:33, skipping insertion in model container [2020-07-08 12:16:33,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:16:33" (3/3) ... [2020-07-08 12:16:33,395 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-1.c [2020-07-08 12:16:33,407 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:16:33,415 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:16:33,427 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:16:33,452 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:16:33,452 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:16:33,453 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:16:33,453 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:16:33,453 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:16:33,453 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:16:33,453 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:16:33,453 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:16:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-08 12:16:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:16:33,481 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:33,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:33,483 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:33,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-07-08 12:16:33,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:33,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743297805] [2020-07-08 12:16:33,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:33,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:16:33,782 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-08 12:16:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:33,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:33,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {33#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:33,843 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:33,845 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-08 12:16:33,846 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-08 12:16:33,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:16:33,846 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-08 12:16:33,847 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-08 12:16:33,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} ~input~0 := 5; {27#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:33,849 INFO L263 TraceCheckUtils]: 5: Hoare triple {27#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {23#true} is VALID [2020-07-08 12:16:33,850 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:33,851 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {33#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:33,852 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:33,854 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-08 12:16:33,855 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {24#false} is VALID [2020-07-08 12:16:33,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume 5 == ~result~0; {24#false} is VALID [2020-07-08 12:16:33,856 INFO L280 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-08 12:16:33,857 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-08 12:16:33,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743297805] [2020-07-08 12:16:33,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:16:33,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:16:33,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945617501] [2020-07-08 12:16:33,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:16:33,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:33,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:16:33,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:33,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:16:33,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:33,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:16:33,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:16:33,934 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-07-08 12:16:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:34,161 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:16:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:16:34,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:16:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:16:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-08 12:16:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:16:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-08 12:16:34,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-08 12:16:34,237 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-08 12:16:34,248 INFO L225 Difference]: With dead ends: 30 [2020-07-08 12:16:34,249 INFO L226 Difference]: Without dead ends: 18 [2020-07-08 12:16:34,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:16:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-08 12:16:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-08 12:16:34,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:34,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:34,305 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:34,305 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:34,310 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-08 12:16:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 12:16:34,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:34,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:34,312 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:34,312 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:34,316 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-08 12:16:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 12:16:34,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:34,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:34,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:34,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:16:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-08 12:16:34,322 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-08 12:16:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:34,322 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-08 12:16:34,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:16:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 12:16:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:16:34,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:34,324 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:34,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:16:34,324 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-07-08 12:16:34,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:34,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624078728] [2020-07-08 12:16:34,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:34,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-08 12:16:34,378 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-08 12:16:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:34,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:34,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:34,460 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |id_#in~x| id_~x)} assume !(0 == ~x); {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,463 INFO L263 TraceCheckUtils]: 2: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-08 12:16:34,464 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:34,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:34,468 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,469 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,470 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,471 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-08 12:16:34,472 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-08 12:16:34,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-08 12:16:34,473 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-08 12:16:34,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-08 12:16:34,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:34,475 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-08 12:16:34,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,477 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#(= |id_#in~x| id_~x)} assume !(0 == ~x); {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,478 INFO L263 TraceCheckUtils]: 8: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-08 12:16:34,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,480 INFO L280 TraceCheckUtils]: 10: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:34,481 INFO L280 TraceCheckUtils]: 11: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:34,483 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,485 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,487 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-08 12:16:34,487 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-08 12:16:34,488 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 == ~result~0; {137#false} is VALID [2020-07-08 12:16:34,488 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-08 12:16:34,490 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-08 12:16:34,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624078728] [2020-07-08 12:16:34,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771282015] [2020-07-08 12:16:34,491 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-08 12:16:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:34,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:16:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:34,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:34,699 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-08 12:16:34,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-08 12:16:34,700 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-08 12:16:34,700 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-08 12:16:34,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:34,701 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-08 12:16:34,702 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,703 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,704 INFO L263 TraceCheckUtils]: 8: Hoare triple {179#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-08 12:16:34,705 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:34,706 INFO L280 TraceCheckUtils]: 10: Hoare triple {179#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {192#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:34,707 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(<= |id_#in~x| 0)} assume true; {192#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:34,709 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {192#(<= |id_#in~x| 0)} {179#(<= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,710 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,710 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:34,712 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-08 12:16:34,712 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-08 12:16:34,713 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 == ~result~0; {137#false} is VALID [2020-07-08 12:16:34,713 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-08 12:16:34,714 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-08 12:16:34,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:34,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-08 12:16:34,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941692833] [2020-07-08 12:16:34,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-08 12:16:34,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:34,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:16:34,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:34,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:16:34,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:16:34,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:16:34,756 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2020-07-08 12:16:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:34,916 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-08 12:16:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:16:34,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-08 12:16:34,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:16:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-08 12:16:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:16:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-08 12:16:34,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-08 12:16:34,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:34,963 INFO L225 Difference]: With dead ends: 25 [2020-07-08 12:16:34,963 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:16:34,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:16:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:16:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-08 12:16:34,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:34,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:34,974 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:34,974 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:34,978 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-08 12:16:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-08 12:16:34,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:34,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:34,979 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:34,979 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:34,982 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-08 12:16:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-08 12:16:34,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:34,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:34,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:34,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:16:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-08 12:16:34,987 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-08 12:16:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:34,987 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-08 12:16:34,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:16:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-08 12:16:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:16:34,989 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:34,989 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:35,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:16:35,203 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-07-08 12:16:35,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:35,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283100495] [2020-07-08 12:16:35,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:35,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-08 12:16:35,282 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-08 12:16:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:35,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:35,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:35,400 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,402 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:35,403 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:35,405 INFO L280 TraceCheckUtils]: 5: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:35,406 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,410 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,412 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:35,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,413 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,414 INFO L263 TraceCheckUtils]: 5: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:35,414 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,415 INFO L280 TraceCheckUtils]: 7: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:35,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:35,417 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,418 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,419 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,420 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,421 INFO L280 TraceCheckUtils]: 13: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,423 INFO L280 TraceCheckUtils]: 14: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,425 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-08 12:16:35,426 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-08 12:16:35,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-08 12:16:35,427 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-08 12:16:35,427 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-08 12:16:35,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:35,429 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-08 12:16:35,431 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,431 INFO L280 TraceCheckUtils]: 7: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,432 INFO L263 TraceCheckUtils]: 8: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:35,432 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,433 INFO L280 TraceCheckUtils]: 10: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,433 INFO L263 TraceCheckUtils]: 11: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:35,434 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,435 INFO L280 TraceCheckUtils]: 13: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:35,436 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:35,437 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,438 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,439 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,441 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,441 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,442 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,443 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-08 12:16:35,444 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {323#false} is VALID [2020-07-08 12:16:35,444 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 == ~result~0; {323#false} is VALID [2020-07-08 12:16:35,444 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-08 12:16:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:16:35,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283100495] [2020-07-08 12:16:35,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647047666] [2020-07-08 12:16:35,446 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-08 12:16:35,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:16:35,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:16:35,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-08 12:16:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:35,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:35,638 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-08 12:16:35,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-08 12:16:35,639 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-08 12:16:35,639 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-08 12:16:35,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:35,641 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-08 12:16:35,642 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {382#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,643 INFO L263 TraceCheckUtils]: 8: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:35,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,645 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,645 INFO L263 TraceCheckUtils]: 11: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:35,646 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:35,647 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {404#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:35,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#(<= |id_#in~x| 0)} assume true; {404#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:35,651 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {404#(<= |id_#in~x| 0)} {382#(<= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,652 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,653 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:35,655 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |id_#in~x| 1)} {382#(<= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,656 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,656 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:35,658 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-08 12:16:35,658 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {323#false} is VALID [2020-07-08 12:16:35,659 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 == ~result~0; {323#false} is VALID [2020-07-08 12:16:35,659 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-08 12:16:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:16:35,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:35,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-08 12:16:35,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168540412] [2020-07-08 12:16:35,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 12:16:35,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:35,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:16:35,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:35,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:16:35,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:35,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:16:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:16:35,705 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2020-07-08 12:16:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:35,915 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:16:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:16:35,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 12:16:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:16:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-08 12:16:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:16:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-08 12:16:35,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-08 12:16:35,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:35,971 INFO L225 Difference]: With dead ends: 28 [2020-07-08 12:16:35,972 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 12:16:35,973 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:16:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 12:16:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-08 12:16:35,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:35,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:35,990 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:35,992 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:35,998 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-08 12:16:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:16:36,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:36,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:36,002 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:36,002 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:36,008 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-08 12:16:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:16:36,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:36,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:36,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:36,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:16:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-08 12:16:36,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-07-08 12:16:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:36,019 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-08 12:16:36,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:16:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:16:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:16:36,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:36,021 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:36,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:36,236 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:36,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-07-08 12:16:36,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:36,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612595348] [2020-07-08 12:16:36,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:36,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 12:16:36,277 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-08 12:16:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:36,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,405 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,406 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,407 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,407 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,409 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,410 INFO L280 TraceCheckUtils]: 8: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,412 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,414 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,414 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,415 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,416 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,419 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,420 INFO L280 TraceCheckUtils]: 10: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,420 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,422 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,423 INFO L280 TraceCheckUtils]: 13: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,423 INFO L280 TraceCheckUtils]: 14: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,425 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:36,426 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,427 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,428 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,428 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,429 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,429 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,430 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,430 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,431 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,432 INFO L280 TraceCheckUtils]: 10: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,433 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,434 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,435 INFO L280 TraceCheckUtils]: 13: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,436 INFO L280 TraceCheckUtils]: 14: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,437 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,438 INFO L280 TraceCheckUtils]: 16: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,439 INFO L280 TraceCheckUtils]: 17: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,440 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:36,441 INFO L280 TraceCheckUtils]: 19: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:36,442 INFO L280 TraceCheckUtils]: 20: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:36,443 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-08 12:16:36,444 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-08 12:16:36,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 12:16:36,444 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-08 12:16:36,444 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-08 12:16:36,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {561#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:36,446 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-08 12:16:36,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,447 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,447 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,448 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,449 INFO L280 TraceCheckUtils]: 10: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,449 INFO L263 TraceCheckUtils]: 11: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,450 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,450 INFO L280 TraceCheckUtils]: 13: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,450 INFO L263 TraceCheckUtils]: 14: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,451 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:36,452 INFO L280 TraceCheckUtils]: 16: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,452 INFO L280 TraceCheckUtils]: 17: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:36,454 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,454 INFO L280 TraceCheckUtils]: 19: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,455 INFO L280 TraceCheckUtils]: 20: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:36,457 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,458 INFO L280 TraceCheckUtils]: 22: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,458 INFO L280 TraceCheckUtils]: 23: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:36,460 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:36,461 INFO L280 TraceCheckUtils]: 25: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:36,461 INFO L280 TraceCheckUtils]: 26: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:36,463 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-08 12:16:36,463 INFO L280 TraceCheckUtils]: 28: Hoare triple {558#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {558#false} is VALID [2020-07-08 12:16:36,463 INFO L280 TraceCheckUtils]: 29: Hoare triple {558#false} assume 5 == ~result~0; {558#false} is VALID [2020-07-08 12:16:36,463 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-08 12:16:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-08 12:16:36,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612595348] [2020-07-08 12:16:36,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120245800] [2020-07-08 12:16:36,465 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-08 12:16:36,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-08 12:16:36,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:16:36,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-08 12:16:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:36,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:36,735 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-08 12:16:36,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 12:16:36,735 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-08 12:16:36,735 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-08 12:16:36,736 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {557#true} is VALID [2020-07-08 12:16:36,736 INFO L263 TraceCheckUtils]: 5: Hoare triple {557#true} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-08 12:16:36,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {557#true} is VALID [2020-07-08 12:16:36,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {557#true} assume !(0 == ~x); {557#true} is VALID [2020-07-08 12:16:36,737 INFO L263 TraceCheckUtils]: 8: Hoare triple {557#true} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,737 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {557#true} is VALID [2020-07-08 12:16:36,737 INFO L280 TraceCheckUtils]: 10: Hoare triple {557#true} assume !(0 == ~x); {557#true} is VALID [2020-07-08 12:16:36,738 INFO L263 TraceCheckUtils]: 11: Hoare triple {557#true} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {557#true} is VALID [2020-07-08 12:16:36,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {557#true} assume !(0 == ~x); {557#true} is VALID [2020-07-08 12:16:36,738 INFO L263 TraceCheckUtils]: 14: Hoare triple {557#true} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:36,739 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {557#true} is VALID [2020-07-08 12:16:36,740 INFO L280 TraceCheckUtils]: 16: Hoare triple {557#true} assume 0 == ~x;#res := 0; {670#(<= |id_#res| 0)} is VALID [2020-07-08 12:16:36,740 INFO L280 TraceCheckUtils]: 17: Hoare triple {670#(<= |id_#res| 0)} assume true; {670#(<= |id_#res| 0)} is VALID [2020-07-08 12:16:36,742 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {670#(<= |id_#res| 0)} {557#true} #32#return; {677#(<= |id_#t~ret0| 0)} is VALID [2020-07-08 12:16:36,743 INFO L280 TraceCheckUtils]: 19: Hoare triple {677#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {681#(<= |id_#res| 1)} is VALID [2020-07-08 12:16:36,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {681#(<= |id_#res| 1)} assume true; {681#(<= |id_#res| 1)} is VALID [2020-07-08 12:16:36,744 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {681#(<= |id_#res| 1)} {557#true} #32#return; {688#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:16:36,745 INFO L280 TraceCheckUtils]: 22: Hoare triple {688#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {692#(<= |id_#res| 2)} is VALID [2020-07-08 12:16:36,745 INFO L280 TraceCheckUtils]: 23: Hoare triple {692#(<= |id_#res| 2)} assume true; {692#(<= |id_#res| 2)} is VALID [2020-07-08 12:16:36,746 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {692#(<= |id_#res| 2)} {557#true} #32#return; {699#(<= |id_#t~ret0| 2)} is VALID [2020-07-08 12:16:36,747 INFO L280 TraceCheckUtils]: 25: Hoare triple {699#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {703#(<= |id_#res| 3)} is VALID [2020-07-08 12:16:36,748 INFO L280 TraceCheckUtils]: 26: Hoare triple {703#(<= |id_#res| 3)} assume true; {703#(<= |id_#res| 3)} is VALID [2020-07-08 12:16:36,749 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {703#(<= |id_#res| 3)} {557#true} #30#return; {710#(<= |main_#t~ret1| 3)} is VALID [2020-07-08 12:16:36,750 INFO L280 TraceCheckUtils]: 28: Hoare triple {710#(<= |main_#t~ret1| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {714#(<= main_~result~0 3)} is VALID [2020-07-08 12:16:36,751 INFO L280 TraceCheckUtils]: 29: Hoare triple {714#(<= main_~result~0 3)} assume 5 == ~result~0; {558#false} is VALID [2020-07-08 12:16:36,752 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-08 12:16:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-08 12:16:36,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:36,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2020-07-08 12:16:36,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870162460] [2020-07-08 12:16:36,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-08 12:16:36,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:36,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 12:16:36,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:36,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 12:16:36,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 12:16:36,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:16:36,840 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 17 states. [2020-07-08 12:16:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:37,301 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-08 12:16:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:16:37,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-08 12:16:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:16:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2020-07-08 12:16:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:16:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2020-07-08 12:16:37,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 32 transitions. [2020-07-08 12:16:37,346 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-08 12:16:37,347 INFO L225 Difference]: With dead ends: 31 [2020-07-08 12:16:37,347 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 12:16:37,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2020-07-08 12:16:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 12:16:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-08 12:16:37,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:37,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:37,357 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:37,357 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:37,360 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-08 12:16:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 12:16:37,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:37,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:37,361 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:37,361 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:37,364 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-08 12:16:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 12:16:37,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:37,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:37,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:37,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:16:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-08 12:16:37,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-07-08 12:16:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:37,367 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-08 12:16:37,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 12:16:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 12:16:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:16:37,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:37,369 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:37,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:37,580 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-07-08 12:16:37,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:37,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290632424] [2020-07-08 12:16:37,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:37,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} assume true; {860#true} is VALID [2020-07-08 12:16:37,630 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {860#true} {860#true} #26#return; {860#true} is VALID [2020-07-08 12:16:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:37,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,831 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {950#(= 0 |id_#in~x|)} {893#(= |id_#in~x| id_~x)} #32#return; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,833 INFO L263 TraceCheckUtils]: 2: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,834 INFO L280 TraceCheckUtils]: 3: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,834 INFO L280 TraceCheckUtils]: 4: Hoare triple {893#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,835 INFO L280 TraceCheckUtils]: 5: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,837 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {950#(= 0 |id_#in~x|)} {893#(= |id_#in~x| id_~x)} #32#return; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {949#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,841 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {949#(<= |id_#in~x| 1)} {893#(= |id_#in~x| id_~x)} #32#return; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,843 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,845 INFO L263 TraceCheckUtils]: 2: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,846 INFO L280 TraceCheckUtils]: 3: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,847 INFO L263 TraceCheckUtils]: 5: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,848 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,849 INFO L280 TraceCheckUtils]: 7: Hoare triple {893#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,850 INFO L280 TraceCheckUtils]: 8: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,852 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {950#(= 0 |id_#in~x|)} {893#(= |id_#in~x| id_~x)} #32#return; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,853 INFO L280 TraceCheckUtils]: 10: Hoare triple {949#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,853 INFO L280 TraceCheckUtils]: 11: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,855 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {949#(<= |id_#in~x| 1)} {893#(= |id_#in~x| id_~x)} #32#return; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,856 INFO L280 TraceCheckUtils]: 13: Hoare triple {944#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,857 INFO L280 TraceCheckUtils]: 14: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,859 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {944#(<= |id_#in~x| 2)} {893#(= |id_#in~x| id_~x)} #32#return; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,862 INFO L263 TraceCheckUtils]: 2: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,863 INFO L280 TraceCheckUtils]: 3: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,864 INFO L263 TraceCheckUtils]: 5: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,865 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,865 INFO L280 TraceCheckUtils]: 7: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,865 INFO L263 TraceCheckUtils]: 8: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,867 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,868 INFO L280 TraceCheckUtils]: 10: Hoare triple {893#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,868 INFO L280 TraceCheckUtils]: 11: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,870 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {950#(= 0 |id_#in~x|)} {893#(= |id_#in~x| id_~x)} #32#return; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,871 INFO L280 TraceCheckUtils]: 13: Hoare triple {949#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,871 INFO L280 TraceCheckUtils]: 14: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,873 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {949#(<= |id_#in~x| 1)} {893#(= |id_#in~x| id_~x)} #32#return; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {944#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,874 INFO L280 TraceCheckUtils]: 17: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,876 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {944#(<= |id_#in~x| 2)} {893#(= |id_#in~x| id_~x)} #32#return; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,878 INFO L280 TraceCheckUtils]: 19: Hoare triple {933#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,879 INFO L280 TraceCheckUtils]: 20: Hoare triple {933#(<= |id_#in~x| 3)} assume true; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,880 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {933#(<= |id_#in~x| 3)} {893#(= |id_#in~x| id_~x)} #32#return; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:37,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,884 INFO L263 TraceCheckUtils]: 2: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,885 INFO L280 TraceCheckUtils]: 3: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,886 INFO L280 TraceCheckUtils]: 4: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,886 INFO L263 TraceCheckUtils]: 5: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,888 INFO L280 TraceCheckUtils]: 7: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,888 INFO L263 TraceCheckUtils]: 8: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,889 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,899 INFO L263 TraceCheckUtils]: 11: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,903 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,904 INFO L280 TraceCheckUtils]: 13: Hoare triple {893#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,905 INFO L280 TraceCheckUtils]: 14: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,906 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {950#(= 0 |id_#in~x|)} {893#(= |id_#in~x| id_~x)} #32#return; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,907 INFO L280 TraceCheckUtils]: 16: Hoare triple {949#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,907 INFO L280 TraceCheckUtils]: 17: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,909 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {949#(<= |id_#in~x| 1)} {893#(= |id_#in~x| id_~x)} #32#return; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,910 INFO L280 TraceCheckUtils]: 19: Hoare triple {944#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,911 INFO L280 TraceCheckUtils]: 20: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,913 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {944#(<= |id_#in~x| 2)} {893#(= |id_#in~x| id_~x)} #32#return; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,914 INFO L280 TraceCheckUtils]: 22: Hoare triple {933#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,915 INFO L280 TraceCheckUtils]: 23: Hoare triple {933#(<= |id_#in~x| 3)} assume true; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,917 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {933#(<= |id_#in~x| 3)} {893#(= |id_#in~x| id_~x)} #32#return; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:37,917 INFO L280 TraceCheckUtils]: 25: Hoare triple {916#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:37,918 INFO L280 TraceCheckUtils]: 26: Hoare triple {916#(<= |id_#in~x| 4)} assume true; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:37,920 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {916#(<= |id_#in~x| 4)} {864#(<= 5 main_~input~0)} #30#return; {861#false} is VALID [2020-07-08 12:16:37,922 INFO L263 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2020-07-08 12:16:37,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {860#true} assume true; {860#true} is VALID [2020-07-08 12:16:37,922 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} #26#return; {860#true} is VALID [2020-07-08 12:16:37,922 INFO L263 TraceCheckUtils]: 3: Hoare triple {860#true} call #t~ret2 := main(); {860#true} is VALID [2020-07-08 12:16:37,923 INFO L280 TraceCheckUtils]: 4: Hoare triple {860#true} ~input~0 := 5; {864#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:37,924 INFO L263 TraceCheckUtils]: 5: Hoare triple {864#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {860#true} is VALID [2020-07-08 12:16:37,925 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,926 INFO L280 TraceCheckUtils]: 7: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,926 INFO L263 TraceCheckUtils]: 8: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,927 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,927 INFO L280 TraceCheckUtils]: 10: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,927 INFO L263 TraceCheckUtils]: 11: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,928 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,929 INFO L280 TraceCheckUtils]: 13: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,929 INFO L263 TraceCheckUtils]: 14: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,930 INFO L280 TraceCheckUtils]: 15: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,930 INFO L280 TraceCheckUtils]: 16: Hoare triple {893#(= |id_#in~x| id_~x)} assume !(0 == ~x); {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,931 INFO L263 TraceCheckUtils]: 17: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:37,931 INFO L280 TraceCheckUtils]: 18: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:37,932 INFO L280 TraceCheckUtils]: 19: Hoare triple {893#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,933 INFO L280 TraceCheckUtils]: 20: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:37,935 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {950#(= 0 |id_#in~x|)} {893#(= |id_#in~x| id_~x)} #32#return; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,936 INFO L280 TraceCheckUtils]: 22: Hoare triple {949#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:37,938 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {949#(<= |id_#in~x| 1)} {893#(= |id_#in~x| id_~x)} #32#return; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,939 INFO L280 TraceCheckUtils]: 25: Hoare triple {944#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,940 INFO L280 TraceCheckUtils]: 26: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:37,942 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {944#(<= |id_#in~x| 2)} {893#(= |id_#in~x| id_~x)} #32#return; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,943 INFO L280 TraceCheckUtils]: 28: Hoare triple {933#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,943 INFO L280 TraceCheckUtils]: 29: Hoare triple {933#(<= |id_#in~x| 3)} assume true; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:37,945 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {933#(<= |id_#in~x| 3)} {893#(= |id_#in~x| id_~x)} #32#return; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:37,946 INFO L280 TraceCheckUtils]: 31: Hoare triple {916#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:37,946 INFO L280 TraceCheckUtils]: 32: Hoare triple {916#(<= |id_#in~x| 4)} assume true; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:37,948 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {916#(<= |id_#in~x| 4)} {864#(<= 5 main_~input~0)} #30#return; {861#false} is VALID [2020-07-08 12:16:37,948 INFO L280 TraceCheckUtils]: 34: Hoare triple {861#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {861#false} is VALID [2020-07-08 12:16:37,948 INFO L280 TraceCheckUtils]: 35: Hoare triple {861#false} assume 5 == ~result~0; {861#false} is VALID [2020-07-08 12:16:37,949 INFO L280 TraceCheckUtils]: 36: Hoare triple {861#false} assume !false; {861#false} is VALID [2020-07-08 12:16:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-08 12:16:37,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290632424] [2020-07-08 12:16:37,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590652756] [2020-07-08 12:16:37,953 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:37,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:16:37,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:16:37,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-08 12:16:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:38,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:38,164 INFO L263 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2020-07-08 12:16:38,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {860#true} assume true; {860#true} is VALID [2020-07-08 12:16:38,165 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} #26#return; {860#true} is VALID [2020-07-08 12:16:38,165 INFO L263 TraceCheckUtils]: 3: Hoare triple {860#true} call #t~ret2 := main(); {860#true} is VALID [2020-07-08 12:16:38,166 INFO L280 TraceCheckUtils]: 4: Hoare triple {860#true} ~input~0 := 5; {864#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:38,166 INFO L263 TraceCheckUtils]: 5: Hoare triple {864#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {860#true} is VALID [2020-07-08 12:16:38,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {972#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,168 INFO L263 TraceCheckUtils]: 8: Hoare triple {972#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:38,168 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {972#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,169 INFO L263 TraceCheckUtils]: 11: Hoare triple {972#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:38,170 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,170 INFO L280 TraceCheckUtils]: 13: Hoare triple {972#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,171 INFO L263 TraceCheckUtils]: 14: Hoare triple {972#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:38,171 INFO L280 TraceCheckUtils]: 15: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,172 INFO L280 TraceCheckUtils]: 16: Hoare triple {972#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,172 INFO L263 TraceCheckUtils]: 17: Hoare triple {972#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-08 12:16:38,173 INFO L280 TraceCheckUtils]: 18: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,173 INFO L280 TraceCheckUtils]: 19: Hoare triple {972#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1012#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:38,174 INFO L280 TraceCheckUtils]: 20: Hoare triple {1012#(<= |id_#in~x| 0)} assume true; {1012#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:38,175 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1012#(<= |id_#in~x| 0)} {972#(<= |id_#in~x| id_~x)} #32#return; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:38,176 INFO L280 TraceCheckUtils]: 22: Hoare triple {949#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:38,176 INFO L280 TraceCheckUtils]: 23: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:38,178 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {949#(<= |id_#in~x| 1)} {972#(<= |id_#in~x| id_~x)} #32#return; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:38,179 INFO L280 TraceCheckUtils]: 25: Hoare triple {944#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:38,179 INFO L280 TraceCheckUtils]: 26: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:38,180 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {944#(<= |id_#in~x| 2)} {972#(<= |id_#in~x| id_~x)} #32#return; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:38,181 INFO L280 TraceCheckUtils]: 28: Hoare triple {933#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:38,181 INFO L280 TraceCheckUtils]: 29: Hoare triple {933#(<= |id_#in~x| 3)} assume true; {933#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:38,182 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {933#(<= |id_#in~x| 3)} {972#(<= |id_#in~x| id_~x)} #32#return; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:38,183 INFO L280 TraceCheckUtils]: 31: Hoare triple {916#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:38,190 INFO L280 TraceCheckUtils]: 32: Hoare triple {916#(<= |id_#in~x| 4)} assume true; {916#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:38,191 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {916#(<= |id_#in~x| 4)} {864#(<= 5 main_~input~0)} #30#return; {861#false} is VALID [2020-07-08 12:16:38,191 INFO L280 TraceCheckUtils]: 34: Hoare triple {861#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {861#false} is VALID [2020-07-08 12:16:38,191 INFO L280 TraceCheckUtils]: 35: Hoare triple {861#false} assume 5 == ~result~0; {861#false} is VALID [2020-07-08 12:16:38,192 INFO L280 TraceCheckUtils]: 36: Hoare triple {861#false} assume !false; {861#false} is VALID [2020-07-08 12:16:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-08 12:16:38,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:38,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-07-08 12:16:38,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935730057] [2020-07-08 12:16:38,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 12:16:38,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:38,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:16:38,249 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-08 12:16:38,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:16:38,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:16:38,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:16:38,251 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 11 states. [2020-07-08 12:16:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:38,475 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 12:16:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:16:38,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 12:16:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:16:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-08 12:16:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:16:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-08 12:16:38,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-08 12:16:38,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:38,530 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:16:38,530 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:16:38,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:16:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:16:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 12:16:38,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:38,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:38,546 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:38,546 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:38,548 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 12:16:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 12:16:38,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:38,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:38,550 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:38,550 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:38,552 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 12:16:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 12:16:38,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:38,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:38,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:38,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:16:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-08 12:16:38,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-07-08 12:16:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:38,556 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-08 12:16:38,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:16:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 12:16:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 12:16:38,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:38,558 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:38,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:38,762 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:38,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-07-08 12:16:38,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:38,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069764058] [2020-07-08 12:16:38,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:16:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:16:38,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:16:38,809 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:16:38,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:16:38,837 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:16:38,838 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:16:38,838 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:16:38,838 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:16:38,838 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-08 12:16:38,838 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:16:38,838 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:16:38,838 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-08 12:16:38,839 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-08 12:16:38,840 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:16:38,841 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:16:38,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:16:38 BoogieIcfgContainer [2020-07-08 12:16:38,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:16:38,846 INFO L168 Benchmark]: Toolchain (without parser) took 6071.35 ms. Allocated memory was 138.9 MB in the beginning and 272.6 MB in the end (delta: 133.7 MB). Free memory was 104.6 MB in the beginning and 132.5 MB in the end (delta: -27.9 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:38,847 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:16:38,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.34 ms. Allocated memory is still 138.9 MB. Free memory was 104.2 MB in the beginning and 95.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:38,848 INFO L168 Benchmark]: Boogie Preprocessor took 24.25 ms. Allocated memory is still 138.9 MB. Free memory was 95.1 MB in the beginning and 93.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:38,849 INFO L168 Benchmark]: RCFGBuilder took 353.36 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.4 MB in the beginning and 168.2 MB in the end (delta: -74.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:38,850 INFO L168 Benchmark]: TraceAbstraction took 5454.35 ms. Allocated memory was 202.9 MB in the beginning and 272.6 MB in the end (delta: 69.7 MB). Free memory was 168.2 MB in the beginning and 132.5 MB in the end (delta: 35.8 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:38,852 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 234.34 ms. Allocated memory is still 138.9 MB. Free memory was 104.2 MB in the beginning and 95.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.25 ms. Allocated memory is still 138.9 MB. Free memory was 95.1 MB in the beginning and 93.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 353.36 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.4 MB in the beginning and 168.2 MB in the end (delta: -74.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5454.35 ms. Allocated memory was 202.9 MB in the beginning and 272.6 MB in the end (delta: 69.7 MB). Free memory was 168.2 MB in the beginning and 132.5 MB in the end (delta: 35.8 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 5; VAL [input=5] [L11] CALL, EXPR id(input) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=5, input=5] [L11] int result = id(input); [L12] COND TRUE result == 5 VAL [input=5, result=5] [L13] __VERIFIER_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.3s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 68 SDtfs, 73 SDslu, 274 SDs, 0 SdLazy, 167 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 280 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 13800 SizeOfPredicates, 14 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 100/200 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 incorrect! Received shutdown request...