/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_b3_o2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:21:23,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:21:23,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:21:23,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:21:23,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:21:23,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:21:23,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:21:23,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:21:23,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:21:23,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:21:23,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:21:23,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:21:23,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:21:23,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:21:23,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:21:23,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:21:23,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:21:23,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:21:23,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:21:23,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:21:23,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:21:23,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:21:23,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:21:23,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:21:23,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:21:23,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:21:23,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:21:23,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:21:23,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:21:23,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:21:23,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:21:23,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:21:23,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:21:23,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:21:23,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:21:23,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:21:23,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:21:23,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:21:23,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:21:23,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:21:23,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:21:23,781 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:21:23,814 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:21:23,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:21:23,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:21:23,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:21:23,816 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:21:23,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:21:23,817 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:21:23,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:21:23,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:21:23,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:21:23,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:21:23,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:21:23,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:21:23,818 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:21:23,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:21:23,818 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:21:23,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:21:23,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:21:23,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:21:23,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:21:23,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:21:23,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:21:23,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:21:23,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:21:23,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:21:23,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:21:23,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:21:23,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:21:23,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:21:23,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:21:24,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:21:24,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:21:24,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:21:24,136 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:21:24,136 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:21:24,137 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c [2020-07-17 22:21:24,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e094f93/c6fe310a821a482687f2d2acac9c4a44/FLAGdd1852103 [2020-07-17 22:21:24,754 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:21:24,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c [2020-07-17 22:21:24,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e094f93/c6fe310a821a482687f2d2acac9c4a44/FLAGdd1852103 [2020-07-17 22:21:25,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e094f93/c6fe310a821a482687f2d2acac9c4a44 [2020-07-17 22:21:25,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:21:25,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:21:25,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:25,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:21:25,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:21:25,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33cdd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25, skipping insertion in model container [2020-07-17 22:21:25,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:21:25,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:21:25,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:25,391 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:21:25,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:25,424 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:21:25,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25 WrapperNode [2020-07-17 22:21:25,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:25,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:21:25,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:21:25,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:21:25,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (1/1) ... [2020-07-17 22:21:25,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:21:25,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:21:25,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:21:25,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:21:25,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (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:21:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:21:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:21:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-17 22:21:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:21:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:21:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:21:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-17 22:21:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:21:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:21:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:21:25,917 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:21:25,918 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:21:25,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:25 BoogieIcfgContainer [2020-07-17 22:21:25,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:21:25,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:21:25,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:21:25,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:21:25,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:21:25" (1/3) ... [2020-07-17 22:21:25,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c189452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:25, skipping insertion in model container [2020-07-17 22:21:25,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:25" (2/3) ... [2020-07-17 22:21:25,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c189452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:25, skipping insertion in model container [2020-07-17 22:21:25,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:25" (3/3) ... [2020-07-17 22:21:25,944 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o2-2.c [2020-07-17 22:21:25,956 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:21:25,964 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:21:25,977 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:21:26,001 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:21:26,001 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:21:26,001 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:21:26,001 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:21:26,002 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:21:26,002 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:21:26,002 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:21:26,002 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:21:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-17 22:21:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:21:26,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:26,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:26,027 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:26,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1250208381, now seen corresponding path program 1 times [2020-07-17 22:21:26,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:26,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177650977] [2020-07-17 22:21:26,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:21:26,246 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-17 22:21:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-17 22:21:26,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:26,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:26,281 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-17 22:21:26,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-17 22:21:26,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:21:26,283 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-17 22:21:26,283 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-17 22:21:26,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2020-07-17 22:21:26,284 INFO L263 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~ret2 := id(~input~0); {24#true} is VALID [2020-07-17 22:21:26,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-17 22:21:26,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:26,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:26,289 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-17 22:21:26,290 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {33#(<= main_~result~0 0)} is VALID [2020-07-17 22:21:26,294 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#(<= main_~result~0 0)} assume 2 == ~result~0; {25#false} is VALID [2020-07-17 22:21:26,295 INFO L280 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-17 22:21:26,296 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:21:26,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177650977] [2020-07-17 22:21:26,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:26,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:21:26,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272143989] [2020-07-17 22:21:26,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:26,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:26,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:21:26,351 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:21:26,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:21:26,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:26,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:21:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:26,365 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-17 22:21:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,567 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-17 22:21:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:26,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-17 22:21:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-17 22:21:26,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-17 22:21:26,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:26,678 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:21:26,679 INFO L226 Difference]: Without dead ends: 19 [2020-07-17 22:21:26,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-17 22:21:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-17 22:21:26,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:26,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:26,733 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:26,734 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,739 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-17 22:21:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:26,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:26,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:26,740 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:26,741 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,745 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-17 22:21:26,745 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:26,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:26,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:26,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:26,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:21:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-17 22:21:26,751 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2020-07-17 22:21:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:26,752 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-17 22:21:26,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:21:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:21:26,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:26,754 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:26,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:21:26,754 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1951994857, now seen corresponding path program 1 times [2020-07-17 22:21:26,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:26,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681688274] [2020-07-17 22:21:26,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-17 22:21:26,858 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-17 22:21:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:27,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,038 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:27,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:27,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-17 22:21:27,040 INFO L263 TraceCheckUtils]: 2: Hoare triple {141#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {141#true} is VALID [2020-07-17 22:21:27,040 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:27,042 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,047 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:27,048 INFO L280 TraceCheckUtils]: 7: Hoare triple {162#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {163#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:27,050 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {142#false} is VALID [2020-07-17 22:21:27,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-17 22:21:27,051 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= 3 |main_#t~ret2|)} is VALID [2020-07-17 22:21:27,052 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-17 22:21:27,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-17 22:21:27,053 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-17 22:21:27,053 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-17 22:21:27,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {141#true} is VALID [2020-07-17 22:21:27,054 INFO L263 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~ret2 := id(~input~0); {141#true} is VALID [2020-07-17 22:21:27,055 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:27,055 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-17 22:21:27,055 INFO L263 TraceCheckUtils]: 8: Hoare triple {141#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {141#true} is VALID [2020-07-17 22:21:27,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:27,057 INFO L280 TraceCheckUtils]: 10: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,060 INFO L280 TraceCheckUtils]: 11: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,062 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:27,064 INFO L280 TraceCheckUtils]: 13: Hoare triple {162#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {163#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:27,065 INFO L280 TraceCheckUtils]: 14: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {142#false} is VALID [2020-07-17 22:21:27,065 INFO L280 TraceCheckUtils]: 15: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-17 22:21:27,066 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= 3 |main_#t~ret2|)} is VALID [2020-07-17 22:21:27,067 INFO L280 TraceCheckUtils]: 17: Hoare triple {156#(<= 3 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {157#(<= 3 main_~result~0)} is VALID [2020-07-17 22:21:27,068 INFO L280 TraceCheckUtils]: 18: Hoare triple {157#(<= 3 main_~result~0)} assume 2 == ~result~0; {142#false} is VALID [2020-07-17 22:21:27,068 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-17 22:21:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:21:27,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681688274] [2020-07-17 22:21:27,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:27,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:21:27,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626878460] [2020-07-17 22:21:27,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:21:27,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:27,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:21:27,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:27,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:21:27,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:21:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:21:27,118 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2020-07-17 22:21:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,252 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-17 22:21:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:27,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:21:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-17 22:21:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-17 22:21:27,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-17 22:21:27,315 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:21:27,319 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:21:27,320 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:21:27,321 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:21:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:21:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-17 22:21:27,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:27,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:27,336 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:27,336 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,340 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-17 22:21:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:21:27,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:27,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:27,341 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-17 22:21:27,342 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-17 22:21:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,345 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-17 22:21:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:21:27,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:27,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:27,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:27,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:21:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-17 22:21:27,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2020-07-17 22:21:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:27,349 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-17 22:21:27,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:21:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-17 22:21:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:21:27,350 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:27,350 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:27,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:21:27,351 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1923365706, now seen corresponding path program 1 times [2020-07-17 22:21:27,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:27,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542558212] [2020-07-17 22:21:27,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:27,408 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,546 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:27,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,550 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:27,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:27,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:27,554 INFO L263 TraceCheckUtils]: 2: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-17 22:21:27,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:27,556 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,560 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:27,561 INFO L280 TraceCheckUtils]: 7: Hoare triple {300#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:27,562 INFO L280 TraceCheckUtils]: 8: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:27,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:27,564 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:27,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:21:27,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:27,566 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:27,566 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-17 22:21:27,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {279#true} is VALID [2020-07-17 22:21:27,567 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-17 22:21:27,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:27,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:27,568 INFO L263 TraceCheckUtils]: 8: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-17 22:21:27,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:27,573 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,574 INFO L280 TraceCheckUtils]: 11: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:27,576 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:27,586 INFO L280 TraceCheckUtils]: 13: Hoare triple {300#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:27,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:27,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:27,590 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:27,591 INFO L280 TraceCheckUtils]: 17: Hoare triple {294#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {295#(<= main_~result~0 1)} is VALID [2020-07-17 22:21:27,592 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 2 == ~result~0; {280#false} is VALID [2020-07-17 22:21:27,592 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:21:27,593 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:21:27,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542558212] [2020-07-17 22:21:27,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160483307] [2020-07-17 22:21:27,594 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:21:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:21:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:27,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:21:27,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:27,808 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:27,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-17 22:21:27,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {279#true} is VALID [2020-07-17 22:21:27,809 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-17 22:21:27,809 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:27,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:27,810 INFO L263 TraceCheckUtils]: 8: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-17 22:21:27,810 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:27,811 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {337#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:27,812 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#(<= |id_#res| 0)} assume true; {337#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:27,814 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {337#(<= |id_#res| 0)} {279#true} #36#return; {344#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:21:27,815 INFO L280 TraceCheckUtils]: 13: Hoare triple {344#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:27,816 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:27,817 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:27,818 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:27,819 INFO L280 TraceCheckUtils]: 17: Hoare triple {294#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {295#(<= main_~result~0 1)} is VALID [2020-07-17 22:21:27,820 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 2 == ~result~0; {280#false} is VALID [2020-07-17 22:21:27,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:21:27,822 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:21:27,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:27,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-17 22:21:27,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998693967] [2020-07-17 22:21:27,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-17 22:21:27,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:27,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:21:27,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:27,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:21:27,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:27,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:21:27,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:21:27,859 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2020-07-17 22:21:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,070 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:21:28,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-17 22:21:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-17 22:21:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-17 22:21:28,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-17 22:21:28,117 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:21:28,119 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:21:28,119 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:21:28,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:21:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:21:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 22:21:28,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:28,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:28,128 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:28,128 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,132 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:21:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:28,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:28,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:28,133 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:28,133 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,136 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:21:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:28,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:28,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:28,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:28,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:21:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-17 22:21:28,140 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2020-07-17 22:21:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:28,141 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-17 22:21:28,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:21:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:21:28,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:28,143 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:28,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:21:28,358 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash 376843494, now seen corresponding path program 1 times [2020-07-17 22:21:28,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:28,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617690169] [2020-07-17 22:21:28,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:28,410 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:28,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:28,548 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:28,549 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:28,549 INFO L263 TraceCheckUtils]: 2: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:28,550 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:28,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:28,554 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:28,555 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:28,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:28,556 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:28,558 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:28,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:28,559 INFO L263 TraceCheckUtils]: 2: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:28,559 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:28,560 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:28,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,561 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:28,562 INFO L280 TraceCheckUtils]: 8: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:28,564 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:28,565 INFO L280 TraceCheckUtils]: 10: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:28,566 INFO L280 TraceCheckUtils]: 11: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:28,566 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:28,568 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:28,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:28,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-17 22:21:28,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:28,571 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:28,571 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-17 22:21:28,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:28,572 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:28,572 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-17 22:21:28,573 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {477#true} is VALID [2020-07-17 22:21:28,573 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-17 22:21:28,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,573 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:28,574 INFO L263 TraceCheckUtils]: 8: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:28,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,574 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:28,574 INFO L263 TraceCheckUtils]: 11: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:28,575 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:28,577 INFO L280 TraceCheckUtils]: 14: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:28,579 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:28,580 INFO L280 TraceCheckUtils]: 16: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:28,581 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:28,581 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:28,583 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:28,584 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:28,585 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-17 22:21:28,585 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:28,585 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:28,586 INFO L280 TraceCheckUtils]: 24: Hoare triple {478#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {478#false} is VALID [2020-07-17 22:21:28,586 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 2 == ~result~0; {478#false} is VALID [2020-07-17 22:21:28,586 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-17 22:21:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:21:28,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617690169] [2020-07-17 22:21:28,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320894960] [2020-07-17 22:21:28,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:21:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:28,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:21:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:28,721 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-17 22:21:28,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:28,722 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:28,722 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-17 22:21:28,722 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {477#true} is VALID [2020-07-17 22:21:28,722 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-17 22:21:28,723 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:28,723 INFO L263 TraceCheckUtils]: 8: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:28,723 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:28,724 INFO L263 TraceCheckUtils]: 11: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:28,724 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:28,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {562#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:28,726 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#(<= |id_#res| 0)} assume true; {562#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:28,727 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {562#(<= |id_#res| 0)} {477#true} #36#return; {569#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:21:28,728 INFO L280 TraceCheckUtils]: 16: Hoare triple {569#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:28,729 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:28,730 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:28,731 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:28,733 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:28,733 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-17 22:21:28,734 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:28,734 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:28,734 INFO L280 TraceCheckUtils]: 24: Hoare triple {478#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {478#false} is VALID [2020-07-17 22:21:28,735 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 2 == ~result~0; {478#false} is VALID [2020-07-17 22:21:28,735 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-17 22:21:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:21:28,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:28,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-17 22:21:28,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902780608] [2020-07-17 22:21:28,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-17 22:21:28,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:28,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:21:28,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:28,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:21:28,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:21:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:21:28,776 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2020-07-17 22:21:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,953 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-17 22:21:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:21:28,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-17 22:21:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:21:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:21:28,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-17 22:21:29,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:29,019 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:21:29,019 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:21:29,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:21:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:21:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-17 22:21:29,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:29,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:29,028 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:29,028 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,031 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-17 22:21:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-17 22:21:29,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:29,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:29,032 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-17 22:21:29,033 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-17 22:21:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,036 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-17 22:21:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-17 22:21:29,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:29,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:29,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:29,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:21:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-17 22:21:29,039 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2020-07-17 22:21:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:29,040 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-17 22:21:29,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:21:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:21:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:21:29,041 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:29,041 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:29,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:29,256 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:29,256 INFO L82 PathProgramCache]: Analyzing trace with hash 405472645, now seen corresponding path program 2 times [2020-07-17 22:21:29,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:29,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264805211] [2020-07-17 22:21:29,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:29,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:21:29,336 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-17 22:21:29,345 INFO L168 Benchmark]: Toolchain (without parser) took 4201.07 ms. Allocated memory was 137.9 MB in the beginning and 247.5 MB in the end (delta: 109.6 MB). Free memory was 102.5 MB in the beginning and 117.4 MB in the end (delta: -14.9 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:29,347 INFO L168 Benchmark]: CDTParser took 1.53 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:21:29,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.86 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 92.7 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:21:29,350 INFO L168 Benchmark]: Boogie Preprocessor took 31.93 ms. Allocated memory is still 137.9 MB. Free memory was 92.7 MB in the beginning and 91.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:29,353 INFO L168 Benchmark]: RCFGBuilder took 474.71 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 91.3 MB in the beginning and 164.7 MB in the end (delta: -73.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:29,353 INFO L168 Benchmark]: TraceAbstraction took 3406.63 ms. Allocated memory was 200.8 MB in the beginning and 247.5 MB in the end (delta: 46.7 MB). Free memory was 164.7 MB in the beginning and 117.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:29,361 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 1.53 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.86 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 92.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.93 ms. Allocated memory is still 137.9 MB. Free memory was 92.7 MB in the beginning and 91.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 474.71 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 91.3 MB in the beginning and 164.7 MB in the end (delta: -73.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3406.63 ms. Allocated memory was 200.8 MB in the beginning and 247.5 MB in the end (delta: 46.7 MB). Free memory was 164.7 MB in the beginning and 117.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...