java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:25:31,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:25:31,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:25:31,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:25:31,145 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:25:31,146 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:25:31,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:25:31,150 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:25:31,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:25:31,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:25:31,154 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:25:31,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:25:31,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:25:31,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:25:31,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:25:31,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:25:31,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:25:31,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:25:31,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:25:31,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:25:31,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:25:31,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:25:31,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:25:31,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:25:31,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:25:31,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:25:31,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:25:31,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:25:31,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:25:31,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:25:31,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:25:31,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:25:31,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:25:31,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:25:31,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:25:31,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:25:31,211 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:25:31,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:25:31,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:25:31,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:25:31,242 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:25:31,242 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:25:31,242 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:25:31,243 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:25:31,243 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:25:31,243 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:25:31,243 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:25:31,243 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:25:31,244 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:25:31,244 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:25:31,244 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:25:31,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:25:31,245 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:25:31,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:25:31,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:25:31,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:25:31,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:25:31,246 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:25:31,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:25:31,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:25:31,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:25:31,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:25:31,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:25:31,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:25:31,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:25:31,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:25:31,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:25:31,250 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:25:31,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:25:31,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:25:31,251 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:25:31,251 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:25:31,251 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:25:31,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:25:31,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:25:31,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:25:31,359 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:25:31,359 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:25:31,360 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42_false-unreach-call.c [2018-10-24 23:25:31,434 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4d81e21a0/49c6dde1491d4f88b6667167cffd50a3/FLAGacdd3d441 [2018-10-24 23:25:32,015 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:25:32,016 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label42_false-unreach-call.c [2018-10-24 23:25:32,044 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4d81e21a0/49c6dde1491d4f88b6667167cffd50a3/FLAGacdd3d441 [2018-10-24 23:25:32,071 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4d81e21a0/49c6dde1491d4f88b6667167cffd50a3 [2018-10-24 23:25:32,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:25:32,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:25:32,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:25:32,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:25:32,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:25:32,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:32,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61eb61d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32, skipping insertion in model container [2018-10-24 23:25:32,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:32,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:25:32,200 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:25:32,686 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:25:32,692 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:25:32,798 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:25:32,815 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:25:32,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32 WrapperNode [2018-10-24 23:25:32,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:25:32,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:25:32,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:25:32,817 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:25:32,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:32,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:33,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:25:33,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:25:33,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:25:33,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:25:33,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:33,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:33,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:33,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:33,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:33,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:33,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... [2018-10-24 23:25:33,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:25:33,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:25:33,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:25:33,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:25:33,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 23:25:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:25:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:25:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:25:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:25:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:25:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:25:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:25:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:25:36,547 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:25:36,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:25:36 BoogieIcfgContainer [2018-10-24 23:25:36,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:25:36,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:25:36,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:25:36,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:25:36,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:25:32" (1/3) ... [2018-10-24 23:25:36,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1223363b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:25:36, skipping insertion in model container [2018-10-24 23:25:36,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:32" (2/3) ... [2018-10-24 23:25:36,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1223363b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:25:36, skipping insertion in model container [2018-10-24 23:25:36,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:25:36" (3/3) ... [2018-10-24 23:25:36,559 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label42_false-unreach-call.c [2018-10-24 23:25:36,570 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:25:36,581 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:25:36,600 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:25:36,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:25:36,640 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:25:36,641 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:25:36,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:25:36,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:25:36,641 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:25:36,641 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:25:36,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:25:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-24 23:25:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 23:25:36,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:25:36,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:25:36,683 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:25:36,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:25:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1002972724, now seen corresponding path program 1 times [2018-10-24 23:25:36,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:25:36,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:36,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:25:36,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:36,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:25:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:25:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:25:37,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:25:37,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:25:37,117 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:25:37,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:25:37,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:25:37,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:25:37,146 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-10-24 23:25:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:25:41,309 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-10-24 23:25:41,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:25:41,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-24 23:25:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:25:41,333 INFO L225 Difference]: With dead ends: 737 [2018-10-24 23:25:41,334 INFO L226 Difference]: Without dead ends: 515 [2018-10-24 23:25:41,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:25:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-24 23:25:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-10-24 23:25:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-24 23:25:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 848 transitions. [2018-10-24 23:25:41,438 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 848 transitions. Word has length 24 [2018-10-24 23:25:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:25:41,439 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 848 transitions. [2018-10-24 23:25:41,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:25:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 848 transitions. [2018-10-24 23:25:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 23:25:41,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:25:41,446 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:25:41,446 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:25:41,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:25:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1186733907, now seen corresponding path program 1 times [2018-10-24 23:25:41,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:25:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:41,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:25:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:41,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:25:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:25:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:25:41,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:25:41,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:25:41,826 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:25:41,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:25:41,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:25:41,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:25:41,829 INFO L87 Difference]: Start difference. First operand 515 states and 848 transitions. Second operand 6 states. [2018-10-24 23:25:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:25:44,857 INFO L93 Difference]: Finished difference Result 1863 states and 3251 transitions. [2018-10-24 23:25:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:25:44,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-10-24 23:25:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:25:44,877 INFO L225 Difference]: With dead ends: 1863 [2018-10-24 23:25:44,877 INFO L226 Difference]: Without dead ends: 1354 [2018-10-24 23:25:44,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:25:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-10-24 23:25:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1331. [2018-10-24 23:25:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 23:25:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2051 transitions. [2018-10-24 23:25:44,994 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2051 transitions. Word has length 99 [2018-10-24 23:25:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:25:44,995 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2051 transitions. [2018-10-24 23:25:44,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:25:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2051 transitions. [2018-10-24 23:25:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-24 23:25:45,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:25:45,000 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:25:45,001 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:25:45,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:25:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1340062609, now seen corresponding path program 1 times [2018-10-24 23:25:45,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:25:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:45,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:25:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:45,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:25:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:25:45,269 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:25:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:25:45,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:25:45,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:25:45,488 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:25:45,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:25:45,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:25:45,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:25:45,490 INFO L87 Difference]: Start difference. First operand 1331 states and 2051 transitions. Second operand 6 states. [2018-10-24 23:25:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:25:50,155 INFO L93 Difference]: Finished difference Result 3512 states and 5693 transitions. [2018-10-24 23:25:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:25:50,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-10-24 23:25:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:25:50,176 INFO L225 Difference]: With dead ends: 3512 [2018-10-24 23:25:50,176 INFO L226 Difference]: Without dead ends: 2187 [2018-10-24 23:25:50,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:25:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-10-24 23:25:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2165. [2018-10-24 23:25:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-10-24 23:25:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3178 transitions. [2018-10-24 23:25:50,267 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3178 transitions. Word has length 101 [2018-10-24 23:25:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:25:50,268 INFO L481 AbstractCegarLoop]: Abstraction has 2165 states and 3178 transitions. [2018-10-24 23:25:50,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:25:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3178 transitions. [2018-10-24 23:25:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-24 23:25:50,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:25:50,271 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:25:50,271 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:25:50,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:25:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash 457598944, now seen corresponding path program 1 times [2018-10-24 23:25:50,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:25:50,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:50,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:25:50,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:50,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:25:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:25:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:25:50,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:25:50,509 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:25:50,510 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2018-10-24 23:25:50,512 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-24 23:25:50,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:25:50,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:25:51,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:25:51,371 INFO L272 AbstractInterpreter]: Visited 88 different actions 168 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-24 23:25:51,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:25:51,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:25:51,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:25:51,420 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 23:25:51,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:25:51,437 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:25:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:25:51,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:25:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:25:51,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:25:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:25:52,157 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:25:52,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-10-24 23:25:52,158 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:25:52,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:25:52,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:25:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:25:52,160 INFO L87 Difference]: Start difference. First operand 2165 states and 3178 transitions. Second operand 3 states. [2018-10-24 23:25:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:25:54,402 INFO L93 Difference]: Finished difference Result 4762 states and 7150 transitions. [2018-10-24 23:25:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:25:54,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-10-24 23:25:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:25:54,425 INFO L225 Difference]: With dead ends: 4762 [2018-10-24 23:25:54,425 INFO L226 Difference]: Without dead ends: 2603 [2018-10-24 23:25:54,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:25:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2018-10-24 23:25:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2603. [2018-10-24 23:25:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2018-10-24 23:25:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3690 transitions. [2018-10-24 23:25:54,543 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3690 transitions. Word has length 104 [2018-10-24 23:25:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:25:54,544 INFO L481 AbstractCegarLoop]: Abstraction has 2603 states and 3690 transitions. [2018-10-24 23:25:54,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:25:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3690 transitions. [2018-10-24 23:25:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-24 23:25:54,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:25:54,549 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:25:54,549 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:25:54,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:25:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2140674393, now seen corresponding path program 1 times [2018-10-24 23:25:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:25:54,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:54,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:25:54,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:25:54,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:25:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:25:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 23:25:54,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:25:54,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:25:54,831 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-10-24 23:25:54,831 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-24 23:25:54,839 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:25:54,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:25:54,969 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:25:54,970 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:25:55,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:25:55,006 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:25:55,327 INFO L232 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 72.8% of their original sizes. [2018-10-24 23:25:55,327 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:25:55,576 INFO L413 sIntCurrentIteration]: We have 104 unified AI predicates [2018-10-24 23:25:55,576 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:25:55,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:25:55,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-24 23:25:55,579 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:25:55,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:25:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:25:55,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:25:55,581 INFO L87 Difference]: Start difference. First operand 2603 states and 3690 transitions. Second operand 6 states. [2018-10-24 23:26:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:26:29,604 INFO L93 Difference]: Finished difference Result 5346 states and 7595 transitions. [2018-10-24 23:26:29,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:26:29,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-10-24 23:26:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:26:29,622 INFO L225 Difference]: With dead ends: 5346 [2018-10-24 23:26:29,622 INFO L226 Difference]: Without dead ends: 2749 [2018-10-24 23:26:29,633 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 23:26:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2018-10-24 23:26:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2747. [2018-10-24 23:26:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-10-24 23:26:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 3843 transitions. [2018-10-24 23:26:29,714 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 3843 transitions. Word has length 105 [2018-10-24 23:26:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:26:29,714 INFO L481 AbstractCegarLoop]: Abstraction has 2747 states and 3843 transitions. [2018-10-24 23:26:29,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:26:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3843 transitions. [2018-10-24 23:26:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-24 23:26:29,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:26:29,718 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:26:29,718 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:26:29,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:26:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1947422875, now seen corresponding path program 1 times [2018-10-24 23:26:29,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:26:29,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:26:29,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:26:29,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:26:29,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:26:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:26:29,990 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:26:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 23:26:30,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:26:30,198 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:26:30,199 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-10-24 23:26:30,199 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-24 23:26:30,208 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:26:30,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:26:30,530 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:26:30,531 INFO L272 AbstractInterpreter]: Visited 142 different actions 281 times. Merged at 5 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-24 23:26:30,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:26:30,556 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:26:30,962 INFO L232 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 76.53% of their original sizes. [2018-10-24 23:26:30,963 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:26:31,960 INFO L413 sIntCurrentIteration]: We have 158 unified AI predicates [2018-10-24 23:26:31,960 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:26:31,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:26:31,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-24 23:26:31,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:26:31,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 23:26:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 23:26:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-24 23:26:31,961 INFO L87 Difference]: Start difference. First operand 2747 states and 3843 transitions. Second operand 13 states. [2018-10-24 23:27:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:27:47,337 INFO L93 Difference]: Finished difference Result 5953 states and 8545 transitions. [2018-10-24 23:27:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 23:27:47,337 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2018-10-24 23:27:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:27:47,356 INFO L225 Difference]: With dead ends: 5953 [2018-10-24 23:27:47,357 INFO L226 Difference]: Without dead ends: 3356 [2018-10-24 23:27:47,369 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 133 SyntacticMatches, 14 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-10-24 23:27:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2018-10-24 23:27:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3125. [2018-10-24 23:27:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2018-10-24 23:27:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4285 transitions. [2018-10-24 23:27:47,453 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4285 transitions. Word has length 159 [2018-10-24 23:27:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:27:47,453 INFO L481 AbstractCegarLoop]: Abstraction has 3125 states and 4285 transitions. [2018-10-24 23:27:47,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 23:27:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4285 transitions. [2018-10-24 23:27:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-24 23:27:47,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:27:47,458 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:27:47,458 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:27:47,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:27:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1898638900, now seen corresponding path program 1 times [2018-10-24 23:27:47,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:27:47,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:47,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:27:47,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:47,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:27:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:27:47,718 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:27:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 23:27:48,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:27:48,022 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:27:48,022 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-10-24 23:27:48,023 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-24 23:27:48,026 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:27:48,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:27:48,312 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:27:48,312 INFO L272 AbstractInterpreter]: Visited 95 different actions 285 times. Merged at 7 different actions 22 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-24 23:27:48,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:27:48,350 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:27:48,811 INFO L232 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 77.26% of their original sizes. [2018-10-24 23:27:48,811 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:27:49,869 INFO L413 sIntCurrentIteration]: We have 181 unified AI predicates [2018-10-24 23:27:49,870 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:27:49,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:27:49,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-24 23:27:49,870 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:27:49,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 23:27:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 23:27:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-24 23:27:49,871 INFO L87 Difference]: Start difference. First operand 3125 states and 4285 transitions. Second operand 14 states. [2018-10-24 23:28:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:28:53,027 INFO L93 Difference]: Finished difference Result 7022 states and 9866 transitions. [2018-10-24 23:28:53,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 23:28:53,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 182 [2018-10-24 23:28:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:28:53,046 INFO L225 Difference]: With dead ends: 7022 [2018-10-24 23:28:53,047 INFO L226 Difference]: Without dead ends: 4198 [2018-10-24 23:28:53,061 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 14 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-10-24 23:28:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2018-10-24 23:28:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 3878. [2018-10-24 23:28:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3878 states. [2018-10-24 23:28:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 5274 transitions. [2018-10-24 23:28:53,166 INFO L78 Accepts]: Start accepts. Automaton has 3878 states and 5274 transitions. Word has length 182 [2018-10-24 23:28:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:28:53,166 INFO L481 AbstractCegarLoop]: Abstraction has 3878 states and 5274 transitions. [2018-10-24 23:28:53,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 23:28:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 5274 transitions. [2018-10-24 23:28:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-24 23:28:53,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:28:53,175 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:28:53,175 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:28:53,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:28:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1826210040, now seen corresponding path program 1 times [2018-10-24 23:28:53,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:28:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:53,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:28:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:53,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:28:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 23:28:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 23:28:53,318 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 23:28:53,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:28:53 BoogieIcfgContainer [2018-10-24 23:28:53,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 23:28:53,477 INFO L168 Benchmark]: Toolchain (without parser) took 201391.29 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -593.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-24 23:28:53,479 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:28:53,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:28:53,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 205.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.7 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:28:53,483 INFO L168 Benchmark]: Boogie Preprocessor took 114.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:28:53,483 INFO L168 Benchmark]: RCFGBuilder took 3413.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:28:53,484 INFO L168 Benchmark]: TraceAbstraction took 196924.34 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 74.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-24 23:28:53,492 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 205.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.7 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3413.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196924.34 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 74.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [\old(a1)=254629, \old(a10)=254633, \old(a12)=254637, \old(a19)=254630, \old(a4)=254634, \old(inputB)=254636, \old(inputC)=254635, \old(inputD)=254631, \old(inputE)=254628, \old(inputF)=254632, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, calculate_output(input)=22, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=22] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] RET return -1; VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=254627, a10=0, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=22] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] __VERIFIER_error() VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 196.8s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 186.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1188 SDtfs, 4715 SDslu, 1151 SDs, 0 SdLazy, 8687 SolverSat, 1238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 155.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 698 GetRequests, 603 SyntacticMatches, 34 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3878occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9964300478531511 AbsIntWeakeningRatio, 0.1489841986455982 AbsIntAvgWeakeningVarsNumRemoved, 3.860045146726862 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 598 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1086 NumberOfCodeBlocks, 1086 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 429555 SizeOfPredicates, 2 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 164/224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...