/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-267fbe0 [2020-07-17 22:21:59,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:21:59,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:21:59,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:21:59,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:21:59,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:21:59,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:21:59,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:21:59,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:21:59,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:21:59,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:21:59,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:21:59,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:21:59,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:21:59,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:21:59,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:21:59,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:21:59,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:21:59,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:21:59,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:21:59,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:22:00,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:22:00,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:22:00,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:22:00,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:22:00,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:22:00,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:22:00,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:22:00,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:22:00,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:22:00,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:22:00,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:22:00,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:22:00,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:22:00,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:22:00,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:22:00,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:22:00,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:22:00,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:22:00,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:22:00,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:22:00,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:22:00,030 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:22:00,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:22:00,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:22:00,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:22:00,032 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:22:00,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:22:00,033 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:22:00,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:22:00,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:22:00,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:22:00,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:22:00,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:22:00,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:22:00,034 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:22:00,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:22:00,035 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:22:00,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:22:00,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:22:00,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:22:00,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:22:00,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:22:00,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:22:00,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:22:00,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:22:00,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:22:00,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:22:00,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:22:00,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:22:00,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:22:00,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:22:00,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:22:00,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:22:00,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:22:00,372 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:22:00,372 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:22:00,373 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-17 22:22:00,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dde68db/f769956d13f14a95b99b8706d453ac6a/FLAG8cb5723a6 [2020-07-17 22:22:00,941 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:22:00,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c [2020-07-17 22:22:00,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dde68db/f769956d13f14a95b99b8706d453ac6a/FLAG8cb5723a6 [2020-07-17 22:22:01,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dde68db/f769956d13f14a95b99b8706d453ac6a [2020-07-17 22:22:01,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:22:01,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:22:01,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:22:01,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:22:01,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:22:01,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38edf0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01, skipping insertion in model container [2020-07-17 22:22:01,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:22:01,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:22:01,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:22:01,594 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:22:01,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:22:01,624 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:22:01,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01 WrapperNode [2020-07-17 22:22:01,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:22:01,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:22:01,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:22:01,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:22:01,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (1/1) ... [2020-07-17 22:22:01,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:22:01,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:22:01,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:22:01,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:22:01,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:22:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:22:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:22:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-17 22:22:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:22:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:22:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:22:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-17 22:22:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:22:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:22:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:22:02,015 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:22:02,015 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:22:02,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:22:02 BoogieIcfgContainer [2020-07-17 22:22:02,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:22:02,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:22:02,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:22:02,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:22:02,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:22:01" (1/3) ... [2020-07-17 22:22:02,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a736d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:22:02, skipping insertion in model container [2020-07-17 22:22:02,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:01" (2/3) ... [2020-07-17 22:22:02,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a736d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:22:02, skipping insertion in model container [2020-07-17 22:22:02,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:22:02" (3/3) ... [2020-07-17 22:22:02,032 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-1.c [2020-07-17 22:22:02,049 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:22:02,057 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:22:02,075 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:22:02,107 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:22:02,107 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:22:02,107 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:22:02,107 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:22:02,108 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:22:02,108 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:22:02,108 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:22:02,108 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:22:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-17 22:22:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:22:02,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:02,139 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:02,139 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:02,147 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-07-17 22:22:02,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:02,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385230969] [2020-07-17 22:22:02,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:02,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:22:02,365 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-17 22:22:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:02,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:02,426 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-17 22:22:02,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:02,430 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-17 22:22:02,430 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-17 22:22:02,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:22:02,431 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-17 22:22:02,432 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-17 22:22:02,433 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} ~input~0 := 5; {27#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:02,434 INFO L263 TraceCheckUtils]: 5: Hoare triple {27#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {23#true} is VALID [2020-07-17 22:22:02,435 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:02,436 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-17 22:22:02,437 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:02,439 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-17 22:22:02,440 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-17 22:22:02,440 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume 5 == ~result~0; {24#false} is VALID [2020-07-17 22:22:02,441 INFO L280 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-17 22:22:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:22:02,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385230969] [2020-07-17 22:22:02,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:22:02,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:22:02,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034184266] [2020-07-17 22:22:02,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:22:02,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:02,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:22:02,514 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-17 22:22:02,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:22:02,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:22:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:22:02,533 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-07-17 22:22:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:02,769 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:22:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:22:02,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:22:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:22:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:22:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:22:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:22:02,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-17 22:22:02,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:02,888 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:22:02,888 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:22:02,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:22:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:22:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-17 22:22:02,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:02,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:02,973 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:02,973 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:02,982 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-17 22:22:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:22:02,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:02,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:02,984 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:02,985 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:02,994 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-17 22:22:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:22:02,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:02,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:02,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:02,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:22:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-17 22:22:03,003 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-17 22:22:03,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:03,004 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-17 22:22:03,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:22:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:22:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:22:03,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:03,008 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:03,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:22:03,010 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:03,010 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-07-17 22:22:03,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:03,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454763589] [2020-07-17 22:22:03,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:03,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:22:03,127 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:22:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:03,243 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:03,245 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-17 22:22:03,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:03,248 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-17 22:22:03,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:03,251 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-17 22:22:03,251 INFO L263 TraceCheckUtils]: 2: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-17 22:22:03,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:03,253 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-17 22:22:03,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:03,257 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-17 22:22:03,258 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-17 22:22:03,260 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:03,263 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-17 22:22:03,264 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-17 22:22:03,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:22:03,265 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:22:03,265 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-17 22:22:03,267 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:03,267 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-17 22:22:03,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:03,271 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-17 22:22:03,271 INFO L263 TraceCheckUtils]: 8: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-17 22:22:03,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:03,275 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-17 22:22:03,277 INFO L280 TraceCheckUtils]: 11: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:03,279 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-17 22:22:03,280 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-17 22:22:03,281 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:03,283 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-17 22:22:03,283 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-17 22:22:03,283 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 == ~result~0; {137#false} is VALID [2020-07-17 22:22:03,284 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:22:03,286 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-17 22:22:03,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454763589] [2020-07-17 22:22:03,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015729633] [2020-07-17 22:22:03,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:03,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:22:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:03,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:03,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-17 22:22:03,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:22:03,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:22:03,499 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-17 22:22:03,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:03,500 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-17 22:22:03,501 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:03,502 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-17 22:22:03,502 INFO L263 TraceCheckUtils]: 8: Hoare triple {179#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-17 22:22:03,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:03,504 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-17 22:22:03,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(<= |id_#in~x| 0)} assume true; {192#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:03,506 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-17 22:22:03,507 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-17 22:22:03,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:03,510 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-17 22:22:03,510 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-17 22:22:03,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 == ~result~0; {137#false} is VALID [2020-07-17 22:22:03,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:22:03,512 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-17 22:22:03,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:03,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-17 22:22:03,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676066186] [2020-07-17 22:22:03,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-17 22:22:03,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:03,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:22:03,549 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-17 22:22:03,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:22:03,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:03,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:22:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:22:03,551 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2020-07-17 22:22:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:03,706 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-17 22:22:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:22:03,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-17 22:22:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:22:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:22:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:22:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:22:03,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-17 22:22:03,751 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-17 22:22:03,753 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:22:03,753 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:22:03,754 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-17 22:22:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:22:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-17 22:22:03,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:03,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:03,764 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:03,764 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:03,767 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-17 22:22:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:22:03,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:03,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:03,769 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:03,769 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:03,772 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-17 22:22:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:22:03,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:03,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:03,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:03,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:22:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-17 22:22:03,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-17 22:22:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:03,776 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-17 22:22:03,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:22:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:22:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:22:03,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:03,778 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:03,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:22:03,992 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:03,992 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-07-17 22:22:03,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:03,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219216411] [2020-07-17 22:22:03,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:22:04,035 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-17 22:22:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,125 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-17 22:22:04,126 INFO L280 TraceCheckUtils]: 2: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:04,128 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-17 22:22:04,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,131 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-17 22:22:04,131 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:04,132 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,133 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-17 22:22:04,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:04,135 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-17 22:22:04,136 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-17 22:22:04,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:04,138 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-17 22:22:04,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,140 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-17 22:22:04,140 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:04,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,142 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-17 22:22:04,142 INFO L263 TraceCheckUtils]: 5: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:04,143 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,143 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-17 22:22:04,144 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:04,146 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-17 22:22:04,146 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-17 22:22:04,147 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:04,148 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-17 22:22:04,149 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-17 22:22:04,150 INFO L280 TraceCheckUtils]: 14: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:04,151 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-17 22:22:04,152 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-17 22:22:04,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:22:04,152 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-17 22:22:04,153 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-17 22:22:04,153 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:04,154 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-17 22:22:04,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,155 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-17 22:22:04,155 INFO L263 TraceCheckUtils]: 8: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:04,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,157 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-17 22:22:04,157 INFO L263 TraceCheckUtils]: 11: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:04,158 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,158 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-17 22:22:04,159 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:04,160 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-17 22:22:04,161 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-17 22:22:04,162 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:04,163 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-17 22:22:04,164 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-17 22:22:04,164 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:04,166 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-17 22:22:04,166 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-17 22:22:04,167 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 == ~result~0; {323#false} is VALID [2020-07-17 22:22:04,167 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-17 22:22:04,168 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-17 22:22:04,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219216411] [2020-07-17 22:22:04,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629886955] [2020-07-17 22:22:04,169 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-17 22:22:04,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:22:04,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:22:04,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:22:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:04,321 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-17 22:22:04,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:22:04,321 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-17 22:22:04,322 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-17 22:22:04,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:04,324 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-17 22:22:04,325 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,326 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-17 22:22:04,327 INFO L263 TraceCheckUtils]: 8: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:04,328 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,329 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-17 22:22:04,329 INFO L263 TraceCheckUtils]: 11: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:04,330 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:04,331 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-17 22:22:04,331 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#(<= |id_#in~x| 0)} assume true; {404#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:04,334 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-17 22:22:04,335 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-17 22:22:04,337 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:04,339 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-17 22:22:04,340 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-17 22:22:04,341 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:04,343 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-17 22:22:04,343 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-17 22:22:04,343 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 == ~result~0; {323#false} is VALID [2020-07-17 22:22:04,344 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-17 22:22:04,346 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-17 22:22:04,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:04,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-17 22:22:04,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025013785] [2020-07-17 22:22:04,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-17 22:22:04,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:04,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:22:04,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:04,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:22:04,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:04,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:22:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:22:04,388 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2020-07-17 22:22:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:04,552 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:22:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:22:04,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-17 22:22:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:22:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-17 22:22:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:22:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-17 22:22:04,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-17 22:22:04,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:04,600 INFO L225 Difference]: With dead ends: 28 [2020-07-17 22:22:04,600 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:22:04,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:22:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:22:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-17 22:22:04,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:04,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:04,610 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:04,610 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:04,613 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-17 22:22:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:22:04,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:04,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:04,614 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:04,614 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:04,617 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-17 22:22:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:22:04,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:04,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:04,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:04,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:22:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-17 22:22:04,621 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-07-17 22:22:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:04,622 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-17 22:22:04,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:22:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:22:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:22:04,624 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:04,624 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:04,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:04,838 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-07-17 22:22:04,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:04,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231049442] [2020-07-17 22:22:04,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-17 22:22:04,932 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-17 22:22:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:05,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,115 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-17 22:22:05,115 INFO L280 TraceCheckUtils]: 2: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:05,117 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-17 22:22:05,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,119 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-17 22:22:05,120 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,121 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,122 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-17 22:22:05,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:05,125 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-17 22:22:05,126 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-17 22:22:05,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:05,129 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-17 22:22:05,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,132 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-17 22:22:05,133 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,133 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,134 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-17 22:22:05,134 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,135 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,136 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-17 22:22:05,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:05,138 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-17 22:22:05,138 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-17 22:22:05,139 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:05,140 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-17 22:22:05,141 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-17 22:22:05,142 INFO L280 TraceCheckUtils]: 14: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:05,143 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-17 22:22:05,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,145 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-17 22:22:05,145 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,147 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-17 22:22:05,147 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,148 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,149 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-17 22:22:05,149 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,150 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,150 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-17 22:22:05,151 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:05,152 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-17 22:22:05,153 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-17 22:22:05,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:05,155 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-17 22:22:05,156 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-17 22:22:05,157 INFO L280 TraceCheckUtils]: 17: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:05,158 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-17 22:22:05,159 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-17 22:22:05,159 INFO L280 TraceCheckUtils]: 20: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:05,160 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-17 22:22:05,161 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-17 22:22:05,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-17 22:22:05,162 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-17 22:22:05,162 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-17 22:22:05,163 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {561#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:05,163 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-17 22:22:05,164 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,165 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-17 22:22:05,165 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,165 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,166 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-17 22:22:05,166 INFO L263 TraceCheckUtils]: 11: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,167 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,168 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-17 22:22:05,168 INFO L263 TraceCheckUtils]: 14: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:05,169 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-17 22:22:05,170 INFO L280 TraceCheckUtils]: 17: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:05,171 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-17 22:22:05,172 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-17 22:22:05,173 INFO L280 TraceCheckUtils]: 20: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:05,174 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-17 22:22:05,175 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-17 22:22:05,176 INFO L280 TraceCheckUtils]: 23: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:05,177 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-17 22:22:05,178 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-17 22:22:05,178 INFO L280 TraceCheckUtils]: 26: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:05,180 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-17 22:22:05,180 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-17 22:22:05,180 INFO L280 TraceCheckUtils]: 29: Hoare triple {558#false} assume 5 == ~result~0; {558#false} is VALID [2020-07-17 22:22:05,180 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-17 22:22:05,182 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-17 22:22:05,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231049442] [2020-07-17 22:22:05,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158372632] [2020-07-17 22:22:05,182 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) [2020-07-17 22:22:05,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:22:05,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:05,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:22:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:05,221 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:05,457 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-17 22:22:05,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-17 22:22:05,457 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-17 22:22:05,458 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-17 22:22:05,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {557#true} is VALID [2020-07-17 22:22:05,458 INFO L263 TraceCheckUtils]: 5: Hoare triple {557#true} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-17 22:22:05,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {557#true} is VALID [2020-07-17 22:22:05,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {557#true} assume !(0 == ~x); {557#true} is VALID [2020-07-17 22:22:05,460 INFO L263 TraceCheckUtils]: 8: Hoare triple {557#true} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {557#true} is VALID [2020-07-17 22:22:05,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {557#true} assume !(0 == ~x); {557#true} is VALID [2020-07-17 22:22:05,461 INFO L263 TraceCheckUtils]: 11: Hoare triple {557#true} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,461 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {557#true} is VALID [2020-07-17 22:22:05,461 INFO L280 TraceCheckUtils]: 13: Hoare triple {557#true} assume !(0 == ~x); {557#true} is VALID [2020-07-17 22:22:05,462 INFO L263 TraceCheckUtils]: 14: Hoare triple {557#true} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:05,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {557#true} is VALID [2020-07-17 22:22:05,465 INFO L280 TraceCheckUtils]: 16: Hoare triple {557#true} assume 0 == ~x;#res := 0; {670#(<= |id_#res| 0)} is VALID [2020-07-17 22:22:05,465 INFO L280 TraceCheckUtils]: 17: Hoare triple {670#(<= |id_#res| 0)} assume true; {670#(<= |id_#res| 0)} is VALID [2020-07-17 22:22:05,467 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {670#(<= |id_#res| 0)} {557#true} #32#return; {677#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:22:05,468 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-17 22:22:05,468 INFO L280 TraceCheckUtils]: 20: Hoare triple {681#(<= |id_#res| 1)} assume true; {681#(<= |id_#res| 1)} is VALID [2020-07-17 22:22:05,470 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {681#(<= |id_#res| 1)} {557#true} #32#return; {688#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:22:05,474 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-17 22:22:05,477 INFO L280 TraceCheckUtils]: 23: Hoare triple {692#(<= |id_#res| 2)} assume true; {692#(<= |id_#res| 2)} is VALID [2020-07-17 22:22:05,478 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {692#(<= |id_#res| 2)} {557#true} #32#return; {699#(<= |id_#t~ret0| 2)} is VALID [2020-07-17 22:22:05,479 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-17 22:22:05,480 INFO L280 TraceCheckUtils]: 26: Hoare triple {703#(<= |id_#res| 3)} assume true; {703#(<= |id_#res| 3)} is VALID [2020-07-17 22:22:05,481 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {703#(<= |id_#res| 3)} {557#true} #30#return; {710#(<= |main_#t~ret1| 3)} is VALID [2020-07-17 22:22:05,482 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-17 22:22:05,482 INFO L280 TraceCheckUtils]: 29: Hoare triple {714#(<= main_~result~0 3)} assume 5 == ~result~0; {558#false} is VALID [2020-07-17 22:22:05,482 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-17 22:22:05,484 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-17 22:22:05,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:05,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2020-07-17 22:22:05,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136416255] [2020-07-17 22:22:05,485 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-17 22:22:05,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:05,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-17 22:22:05,539 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-17 22:22:05,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 22:22:05,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:05,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 22:22:05,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:22:05,540 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 17 states. [2020-07-17 22:22:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:06,034 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-17 22:22:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:22:06,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-17 22:22:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:22:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2020-07-17 22:22:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:22:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2020-07-17 22:22:06,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 32 transitions. [2020-07-17 22:22:06,092 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-17 22:22:06,094 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:22:06,094 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:22:06,095 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-17 22:22:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:22:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:22:06,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:06,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:06,104 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:06,104 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:06,107 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-17 22:22:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-17 22:22:06,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:06,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:06,108 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:06,108 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:06,111 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-17 22:22:06,111 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-17 22:22:06,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:06,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:06,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:06,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:22:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-17 22:22:06,114 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-07-17 22:22:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:06,115 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-17 22:22:06,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 22:22:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-17 22:22:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:22:06,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:06,116 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:06,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:06,331 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-07-17 22:22:06,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:06,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287857150] [2020-07-17 22:22:06,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:06,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} assume true; {860#true} is VALID [2020-07-17 22:22:06,380 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {860#true} {860#true} #26#return; {860#true} is VALID [2020-07-17 22:22:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:06,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,540 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-17 22:22:06,540 INFO L280 TraceCheckUtils]: 2: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:06,542 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-17 22:22:06,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,543 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-17 22:22:06,544 INFO L263 TraceCheckUtils]: 2: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,544 INFO L280 TraceCheckUtils]: 3: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,545 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-17 22:22:06,546 INFO L280 TraceCheckUtils]: 5: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:06,547 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-17 22:22:06,548 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-17 22:22:06,549 INFO L280 TraceCheckUtils]: 8: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:06,550 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-17 22:22:06,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,552 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-17 22:22:06,552 INFO L263 TraceCheckUtils]: 2: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,553 INFO L280 TraceCheckUtils]: 3: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,553 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-17 22:22:06,553 INFO L263 TraceCheckUtils]: 5: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,554 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,555 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-17 22:22:06,555 INFO L280 TraceCheckUtils]: 8: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:06,557 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-17 22:22:06,557 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-17 22:22:06,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:06,559 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-17 22:22:06,560 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-17 22:22:06,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:06,562 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-17 22:22:06,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,564 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-17 22:22:06,564 INFO L263 TraceCheckUtils]: 2: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,565 INFO L280 TraceCheckUtils]: 3: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,566 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-17 22:22:06,566 INFO L263 TraceCheckUtils]: 5: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,566 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,567 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-17 22:22:06,567 INFO L263 TraceCheckUtils]: 8: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,569 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-17 22:22:06,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:06,570 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-17 22:22:06,571 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-17 22:22:06,572 INFO L280 TraceCheckUtils]: 14: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:06,573 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-17 22:22:06,574 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-17 22:22:06,575 INFO L280 TraceCheckUtils]: 17: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:06,576 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-17 22:22:06,577 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-17 22:22:06,578 INFO L280 TraceCheckUtils]: 20: Hoare triple {933#(<= |id_#in~x| 3)} assume true; {933#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:06,579 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-17 22:22:06,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,581 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-17 22:22:06,581 INFO L263 TraceCheckUtils]: 2: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,582 INFO L280 TraceCheckUtils]: 3: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,582 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-17 22:22:06,583 INFO L263 TraceCheckUtils]: 5: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,583 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,584 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-17 22:22:06,584 INFO L263 TraceCheckUtils]: 8: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,585 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-17 22:22:06,586 INFO L263 TraceCheckUtils]: 11: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,586 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,587 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-17 22:22:06,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:06,589 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-17 22:22:06,590 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-17 22:22:06,590 INFO L280 TraceCheckUtils]: 17: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:06,592 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-17 22:22:06,593 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-17 22:22:06,593 INFO L280 TraceCheckUtils]: 20: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:06,595 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-17 22:22:06,596 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-17 22:22:06,596 INFO L280 TraceCheckUtils]: 23: Hoare triple {933#(<= |id_#in~x| 3)} assume true; {933#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:06,598 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-17 22:22:06,598 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-17 22:22:06,599 INFO L280 TraceCheckUtils]: 26: Hoare triple {916#(<= |id_#in~x| 4)} assume true; {916#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:06,600 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {916#(<= |id_#in~x| 4)} {864#(<= 5 main_~input~0)} #30#return; {861#false} is VALID [2020-07-17 22:22:06,602 INFO L263 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2020-07-17 22:22:06,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {860#true} assume true; {860#true} is VALID [2020-07-17 22:22:06,602 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} #26#return; {860#true} is VALID [2020-07-17 22:22:06,602 INFO L263 TraceCheckUtils]: 3: Hoare triple {860#true} call #t~ret2 := main(); {860#true} is VALID [2020-07-17 22:22:06,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {860#true} ~input~0 := 5; {864#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:06,604 INFO L263 TraceCheckUtils]: 5: Hoare triple {864#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {860#true} is VALID [2020-07-17 22:22:06,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,605 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-17 22:22:06,605 INFO L263 TraceCheckUtils]: 8: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,606 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,606 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-17 22:22:06,607 INFO L263 TraceCheckUtils]: 11: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,607 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,608 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-17 22:22:06,608 INFO L263 TraceCheckUtils]: 14: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,609 INFO L280 TraceCheckUtils]: 15: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,609 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-17 22:22:06,610 INFO L263 TraceCheckUtils]: 17: Hoare triple {893#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {860#true} ~x := #in~x; {893#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,611 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-17 22:22:06,612 INFO L280 TraceCheckUtils]: 20: Hoare triple {950#(= 0 |id_#in~x|)} assume true; {950#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:06,613 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-17 22:22:06,613 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-17 22:22:06,614 INFO L280 TraceCheckUtils]: 23: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:06,616 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-17 22:22:06,616 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-17 22:22:06,617 INFO L280 TraceCheckUtils]: 26: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:06,619 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-17 22:22:06,619 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-17 22:22:06,620 INFO L280 TraceCheckUtils]: 29: Hoare triple {933#(<= |id_#in~x| 3)} assume true; {933#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:06,621 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-17 22:22:06,622 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-17 22:22:06,623 INFO L280 TraceCheckUtils]: 32: Hoare triple {916#(<= |id_#in~x| 4)} assume true; {916#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:06,624 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {916#(<= |id_#in~x| 4)} {864#(<= 5 main_~input~0)} #30#return; {861#false} is VALID [2020-07-17 22:22:06,624 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-17 22:22:06,624 INFO L280 TraceCheckUtils]: 35: Hoare triple {861#false} assume 5 == ~result~0; {861#false} is VALID [2020-07-17 22:22:06,625 INFO L280 TraceCheckUtils]: 36: Hoare triple {861#false} assume !false; {861#false} is VALID [2020-07-17 22:22:06,626 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-17 22:22:06,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287857150] [2020-07-17 22:22:06,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037045585] [2020-07-17 22:22:06,627 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) [2020-07-17 22:22:06,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:22:06,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:22:06,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:06,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:06,828 INFO L263 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2020-07-17 22:22:06,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {860#true} assume true; {860#true} is VALID [2020-07-17 22:22:06,829 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} #26#return; {860#true} is VALID [2020-07-17 22:22:06,829 INFO L263 TraceCheckUtils]: 3: Hoare triple {860#true} call #t~ret2 := main(); {860#true} is VALID [2020-07-17 22:22:06,830 INFO L280 TraceCheckUtils]: 4: Hoare triple {860#true} ~input~0 := 5; {864#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:06,830 INFO L263 TraceCheckUtils]: 5: Hoare triple {864#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {860#true} is VALID [2020-07-17 22:22:06,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,833 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-17 22:22:06,833 INFO L263 TraceCheckUtils]: 8: Hoare triple {972#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,834 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,834 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-17 22:22:06,834 INFO L263 TraceCheckUtils]: 11: Hoare triple {972#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,835 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,836 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-17 22:22:06,836 INFO L263 TraceCheckUtils]: 14: Hoare triple {972#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,837 INFO L280 TraceCheckUtils]: 15: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,837 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-17 22:22:06,837 INFO L263 TraceCheckUtils]: 17: Hoare triple {972#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {860#true} is VALID [2020-07-17 22:22:06,838 INFO L280 TraceCheckUtils]: 18: Hoare triple {860#true} ~x := #in~x; {972#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:06,839 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-17 22:22:06,839 INFO L280 TraceCheckUtils]: 20: Hoare triple {1012#(<= |id_#in~x| 0)} assume true; {1012#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:06,841 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-17 22:22:06,842 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-17 22:22:06,843 INFO L280 TraceCheckUtils]: 23: Hoare triple {949#(<= |id_#in~x| 1)} assume true; {949#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:06,844 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-17 22:22:06,845 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-17 22:22:06,846 INFO L280 TraceCheckUtils]: 26: Hoare triple {944#(<= |id_#in~x| 2)} assume true; {944#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:06,847 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-17 22:22:06,848 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-17 22:22:06,849 INFO L280 TraceCheckUtils]: 29: Hoare triple {933#(<= |id_#in~x| 3)} assume true; {933#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:06,850 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-17 22:22:06,851 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-17 22:22:06,852 INFO L280 TraceCheckUtils]: 32: Hoare triple {916#(<= |id_#in~x| 4)} assume true; {916#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:06,853 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {916#(<= |id_#in~x| 4)} {864#(<= 5 main_~input~0)} #30#return; {861#false} is VALID [2020-07-17 22:22:06,853 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-17 22:22:06,854 INFO L280 TraceCheckUtils]: 35: Hoare triple {861#false} assume 5 == ~result~0; {861#false} is VALID [2020-07-17 22:22:06,854 INFO L280 TraceCheckUtils]: 36: Hoare triple {861#false} assume !false; {861#false} is VALID [2020-07-17 22:22:06,856 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-17 22:22:06,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:06,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-07-17 22:22:06,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289323337] [2020-07-17 22:22:06,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-17 22:22:06,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:06,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:22:06,933 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-17 22:22:06,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:22:06,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:06,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:22:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:22:06,935 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 11 states. [2020-07-17 22:22:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:07,157 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-17 22:22:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:22:07,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-17 22:22:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:22:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-17 22:22:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:22:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-17 22:22:07,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-17 22:22:07,209 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-17 22:22:07,212 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:22:07,212 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:22:07,213 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-17 22:22:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:22:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:22:07,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:07,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:07,227 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:07,227 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:07,229 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-17 22:22:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 22:22:07,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:07,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:07,230 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:07,230 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:07,233 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-17 22:22:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 22:22:07,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:07,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:07,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:07,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:22:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-17 22:22:07,239 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-07-17 22:22:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:07,240 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-17 22:22:07,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:22:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 22:22:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-17 22:22:07,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:07,241 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:07,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:07,453 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-07-17 22:22:07,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:07,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548220231] [2020-07-17 22:22:07,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:22:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:22:07,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:22:07,500 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:22:07,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:22:07,533 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:22:07,534 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:22:07,535 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-17 22:22:07,535 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:22:07,535 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-17 22:22:07,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:22:07 BoogieIcfgContainer [2020-07-17 22:22:07,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:22:07,539 INFO L168 Benchmark]: Toolchain (without parser) took 6170.81 ms. Allocated memory was 137.4 MB in the beginning and 283.6 MB in the end (delta: 146.3 MB). Free memory was 102.2 MB in the beginning and 171.2 MB in the end (delta: -69.1 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:07,539 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 137.4 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:22:07,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.00 ms. Allocated memory is still 137.4 MB. Free memory was 101.8 MB in the beginning and 92.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:07,542 INFO L168 Benchmark]: Boogie Preprocessor took 25.26 ms. Allocated memory is still 137.4 MB. Free memory was 92.4 MB in the beginning and 91.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:07,543 INFO L168 Benchmark]: RCFGBuilder took 368.62 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 90.7 MB in the beginning and 164.8 MB in the end (delta: -74.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:07,543 INFO L168 Benchmark]: TraceAbstraction took 5515.12 ms. Allocated memory was 200.3 MB in the beginning and 283.6 MB in the end (delta: 83.4 MB). Free memory was 164.8 MB in the beginning and 171.2 MB in the end (delta: -6.4 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:07,552 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.51 ms. Allocated memory is still 137.4 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 255.00 ms. Allocated memory is still 137.4 MB. Free memory was 101.8 MB in the beginning and 92.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.26 ms. Allocated memory is still 137.4 MB. Free memory was 92.4 MB in the beginning and 91.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.62 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 90.7 MB in the beginning and 164.8 MB in the end (delta: -74.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5515.12 ms. Allocated memory was 200.3 MB in the beginning and 283.6 MB in the end (delta: 83.4 MB). Free memory was 164.8 MB in the beginning and 171.2 MB in the end (delta: -6.4 MB). Peak memory consumption was 77.0 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.6s, 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.6s 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, 1.9s 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...