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/Problem01_label47_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:20:17,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:20:17,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:20:17,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:20:17,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:20:17,430 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:20:17,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:20:17,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:20:17,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:20:17,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:20:17,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:20:17,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:20:17,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:20:17,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:20:17,440 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:20:17,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:20:17,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:20:17,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:20:17,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:20:17,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:20:17,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:20:17,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:20:17,452 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:20:17,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:20:17,453 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:20:17,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:20:17,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:20:17,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:20:17,457 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:20:17,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:20:17,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:20:17,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:20:17,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:20:17,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:20:17,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:20:17,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:20:17,465 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-27 04:20:17,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:20:17,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:20:17,499 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:20:17,499 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:20:17,500 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:20:17,500 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:20:17,500 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 04:20:17,502 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:20:17,502 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 04:20:17,502 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:20:17,502 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 04:20:17,502 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:20:17,503 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:20:17,503 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:20:17,504 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:20:17,504 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:20:17,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:20:17,504 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 04:20:17,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:20:17,505 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 04:20:17,505 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 04:20:17,505 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 04:20:17,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:20:17,506 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:20:17,506 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:20:17,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:20:17,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:20:17,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:20:17,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:20:17,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 04:20:17,507 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:20:17,507 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:20:17,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:20:17,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 04:20:17,510 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 04:20:17,510 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 04:20:17,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:20:17,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:20:17,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:20:17,606 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:20:17,607 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:20:17,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-10-27 04:20:17,670 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e6ec3dc61/34c2d9dbf67b4fefa5ebfec1d5bcc7c2/FLAG01916fa56 [2018-10-27 04:20:18,321 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:20:18,322 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-10-27 04:20:18,346 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e6ec3dc61/34c2d9dbf67b4fefa5ebfec1d5bcc7c2/FLAG01916fa56 [2018-10-27 04:20:18,364 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e6ec3dc61/34c2d9dbf67b4fefa5ebfec1d5bcc7c2 [2018-10-27 04:20:18,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:20:18,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:20:18,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:20:18,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:20:18,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:20:18,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:20:18" (1/1) ... [2018-10-27 04:20:18,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7947ed0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:18, skipping insertion in model container [2018-10-27 04:20:18,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:20:18" (1/1) ... [2018-10-27 04:20:18,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:20:18,469 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:20:18,994 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:20:19,002 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:20:19,118 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:20:19,139 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:20:19,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19 WrapperNode [2018-10-27 04:20:19,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:20:19,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:20:19,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:20:19,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:20:19,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:20:19,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:20:19,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:20:19,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:20:19,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (1/1) ... [2018-10-27 04:20:19,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:20:19,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:20:19,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:20:19,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:20:19,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (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-27 04:20:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:20:19,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:20:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 04:20:19,533 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 04:20:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:20:19,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:20:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:20:19,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:20:22,647 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:20:22,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:20:22 BoogieIcfgContainer [2018-10-27 04:20:22,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:20:22,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:20:22,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:20:22,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:20:22,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:20:18" (1/3) ... [2018-10-27 04:20:22,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b545b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:20:22, skipping insertion in model container [2018-10-27 04:20:22,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:20:19" (2/3) ... [2018-10-27 04:20:22,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b545b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:20:22, skipping insertion in model container [2018-10-27 04:20:22,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:20:22" (3/3) ... [2018-10-27 04:20:22,655 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label47_false-unreach-call_false-termination.c [2018-10-27 04:20:22,663 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:20:22,671 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 04:20:22,689 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 04:20:22,729 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:20:22,729 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 04:20:22,729 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:20:22,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:20:22,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:20:22,730 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:20:22,730 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:20:22,730 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:20:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 04:20:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 04:20:22,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:22,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 04:20:22,775 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:22,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1092811080, now seen corresponding path program 1 times [2018-10-27 04:20:22,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:22,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:23,398 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 04:20:23,515 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-27 04:20:23,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:20:23,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:20:23,518 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:20:23,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:20:23,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:20:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:20:23,548 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 04:20:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:24,906 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 04:20:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:20:24,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-10-27 04:20:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:24,928 INFO L225 Difference]: With dead ends: 550 [2018-10-27 04:20:24,928 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 04:20:24,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:20:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 04:20:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 04:20:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 04:20:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-27 04:20:25,020 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 80 [2018-10-27 04:20:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:25,021 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-27 04:20:25,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:20:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-27 04:20:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 04:20:25,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:25,027 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 04:20:25,028 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:25,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 480701735, now seen corresponding path program 1 times [2018-10-27 04:20:25,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:25,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:25,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:25,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:20:25,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:20:25,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:20:25,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:20:25,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:20:25,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:20:25,228 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-27 04:20:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:27,031 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-27 04:20:27,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:20:27,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-10-27 04:20:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:27,040 INFO L225 Difference]: With dead ends: 888 [2018-10-27 04:20:27,041 INFO L226 Difference]: Without dead ends: 554 [2018-10-27 04:20:27,047 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-27 04:20:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-27 04:20:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-27 04:20:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-27 04:20:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-27 04:20:27,087 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 91 [2018-10-27 04:20:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:27,088 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-27 04:20:27,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:20:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-27 04:20:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-27 04:20:27,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:27,092 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 04:20:27,092 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:27,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash -900509829, now seen corresponding path program 1 times [2018-10-27 04:20:27,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:27,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:27,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:27,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:20:27,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:20:27,338 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:20:27,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:20:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:20:27,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:20:27,341 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-10-27 04:20:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:28,672 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-10-27 04:20:28,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:20:28,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-10-27 04:20:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:28,683 INFO L225 Difference]: With dead ends: 1530 [2018-10-27 04:20:28,683 INFO L226 Difference]: Without dead ends: 997 [2018-10-27 04:20:28,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:20:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-10-27 04:20:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 994. [2018-10-27 04:20:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2018-10-27 04:20:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1454 transitions. [2018-10-27 04:20:28,734 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1454 transitions. Word has length 92 [2018-10-27 04:20:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:28,735 INFO L481 AbstractCegarLoop]: Abstraction has 994 states and 1454 transitions. [2018-10-27 04:20:28,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:20:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1454 transitions. [2018-10-27 04:20:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 04:20:28,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:28,741 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 04:20:28,742 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:28,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 909671971, now seen corresponding path program 1 times [2018-10-27 04:20:28,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:28,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:28,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:28,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:28,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:29,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:20:29,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:20:29,014 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:20:29,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:20:29,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:20:29,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:20:29,016 INFO L87 Difference]: Start difference. First operand 994 states and 1454 transitions. Second operand 4 states. [2018-10-27 04:20:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:32,120 INFO L93 Difference]: Finished difference Result 3376 states and 5191 transitions. [2018-10-27 04:20:32,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:20:32,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-10-27 04:20:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:32,140 INFO L225 Difference]: With dead ends: 3376 [2018-10-27 04:20:32,140 INFO L226 Difference]: Without dead ends: 2388 [2018-10-27 04:20:32,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:20:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-10-27 04:20:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2018-10-27 04:20:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2018-10-27 04:20:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3423 transitions. [2018-10-27 04:20:32,248 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3423 transitions. Word has length 93 [2018-10-27 04:20:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:32,249 INFO L481 AbstractCegarLoop]: Abstraction has 2388 states and 3423 transitions. [2018-10-27 04:20:32,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:20:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3423 transitions. [2018-10-27 04:20:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-27 04:20:32,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:32,258 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 04:20:32,258 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:32,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:32,260 INFO L82 PathProgramCache]: Analyzing trace with hash 433238511, now seen corresponding path program 1 times [2018-10-27 04:20:32,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:32,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:32,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:32,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:32,262 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:32,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:20:32,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:20:32,507 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:20:32,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:20:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:20:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:20:32,508 INFO L87 Difference]: Start difference. First operand 2388 states and 3423 transitions. Second operand 3 states. [2018-10-27 04:20:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:33,371 INFO L93 Difference]: Finished difference Result 7070 states and 10548 transitions. [2018-10-27 04:20:33,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:20:33,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-27 04:20:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:33,405 INFO L225 Difference]: With dead ends: 7070 [2018-10-27 04:20:33,405 INFO L226 Difference]: Without dead ends: 4688 [2018-10-27 04:20:33,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:20:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4688 states. [2018-10-27 04:20:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4688 to 4688. [2018-10-27 04:20:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4688 states. [2018-10-27 04:20:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 6621 transitions. [2018-10-27 04:20:33,600 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 6621 transitions. Word has length 98 [2018-10-27 04:20:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:33,600 INFO L481 AbstractCegarLoop]: Abstraction has 4688 states and 6621 transitions. [2018-10-27 04:20:33,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:20:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 6621 transitions. [2018-10-27 04:20:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-27 04:20:33,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:33,609 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 04:20:33,609 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:33,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1885605347, now seen corresponding path program 1 times [2018-10-27 04:20:33,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:33,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:33,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:33,858 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 04:20:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:34,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:20:34,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:20:34,158 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:20:34,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:20:34,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:20:34,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:20:34,159 INFO L87 Difference]: Start difference. First operand 4688 states and 6621 transitions. Second operand 6 states. [2018-10-27 04:20:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:35,570 INFO L93 Difference]: Finished difference Result 8749 states and 12593 transitions. [2018-10-27 04:20:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:20:35,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-27 04:20:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:35,592 INFO L225 Difference]: With dead ends: 8749 [2018-10-27 04:20:35,592 INFO L226 Difference]: Without dead ends: 4067 [2018-10-27 04:20:35,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:20:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2018-10-27 04:20:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 4001. [2018-10-27 04:20:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4001 states. [2018-10-27 04:20:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 5002 transitions. [2018-10-27 04:20:35,731 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 5002 transitions. Word has length 125 [2018-10-27 04:20:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:35,731 INFO L481 AbstractCegarLoop]: Abstraction has 4001 states and 5002 transitions. [2018-10-27 04:20:35,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:20:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 5002 transitions. [2018-10-27 04:20:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 04:20:35,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:35,741 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 04:20:35,741 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:35,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash 832089744, now seen corresponding path program 1 times [2018-10-27 04:20:35,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:35,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:35,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:35,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:35,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:35,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:20:35,986 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:20:35,987 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2018-10-27 04:20:35,989 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:20:36,040 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:20:36,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:20:36,879 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:20:36,880 INFO L272 AbstractInterpreter]: Visited 85 different actions 162 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 04:20:36,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:36,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:20:36,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:20:36,927 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-27 04:20:36,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:36,942 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:20:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:37,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:20:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:37,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:20:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:37,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:20:37,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-10-27 04:20:37,880 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:20:37,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:20:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:20:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:20:37,881 INFO L87 Difference]: Start difference. First operand 4001 states and 5002 transitions. Second operand 6 states. [2018-10-27 04:20:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:40,633 INFO L93 Difference]: Finished difference Result 8660 states and 11106 transitions. [2018-10-27 04:20:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:20:40,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-10-27 04:20:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:40,659 INFO L225 Difference]: With dead ends: 8660 [2018-10-27 04:20:40,659 INFO L226 Difference]: Without dead ends: 4665 [2018-10-27 04:20:40,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:20:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2018-10-27 04:20:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4502. [2018-10-27 04:20:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4502 states. [2018-10-27 04:20:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 5463 transitions. [2018-10-27 04:20:40,798 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 5463 transitions. Word has length 137 [2018-10-27 04:20:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:40,799 INFO L481 AbstractCegarLoop]: Abstraction has 4502 states and 5463 transitions. [2018-10-27 04:20:40,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:20:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 5463 transitions. [2018-10-27 04:20:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 04:20:40,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:40,808 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 04:20:40,808 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:40,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1457997160, now seen corresponding path program 1 times [2018-10-27 04:20:40,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:40,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:40,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:40,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:40,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:41,286 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 04:20:41,536 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 04:20:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:20:42,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:20:42,209 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:20:42,209 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-10-27 04:20:42,210 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:20:42,215 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:20:42,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:20:42,363 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:20:42,364 INFO L272 AbstractInterpreter]: Visited 81 different actions 81 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 04:20:42,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:42,401 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:20:42,787 INFO L227 lantSequenceWeakener]: Weakened 132 states. On average, predicates are now at 79.8% of their original sizes. [2018-10-27 04:20:42,788 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:20:43,040 INFO L415 sIntCurrentIteration]: We unified 140 AI predicates to 140 [2018-10-27 04:20:43,040 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:20:43,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:20:43,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2018-10-27 04:20:43,044 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:20:43,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:20:43,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:20:43,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:20:43,045 INFO L87 Difference]: Start difference. First operand 4502 states and 5463 transitions. Second operand 6 states. [2018-10-27 04:20:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:50,930 INFO L93 Difference]: Finished difference Result 9136 states and 11110 transitions. [2018-10-27 04:20:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:20:50,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-10-27 04:20:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:50,949 INFO L225 Difference]: With dead ends: 9136 [2018-10-27 04:20:50,949 INFO L226 Difference]: Without dead ends: 4640 [2018-10-27 04:20:50,961 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 141 GetRequests, 136 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-27 04:20:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2018-10-27 04:20:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4638. [2018-10-27 04:20:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4638 states. [2018-10-27 04:20:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 5609 transitions. [2018-10-27 04:20:51,077 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 5609 transitions. Word has length 141 [2018-10-27 04:20:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:51,078 INFO L481 AbstractCegarLoop]: Abstraction has 4638 states and 5609 transitions. [2018-10-27 04:20:51,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:20:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 5609 transitions. [2018-10-27 04:20:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 04:20:51,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:51,088 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 04:20:51,088 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:51,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:51,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1069858155, now seen corresponding path program 1 times [2018-10-27 04:20:51,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:51,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:51,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:51,595 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:20:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:20:51,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:20:51,758 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:20:51,758 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-10-27 04:20:51,758 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:20:51,762 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:20:51,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:20:51,920 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:20:51,920 INFO L272 AbstractInterpreter]: Visited 85 different actions 164 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 04:20:51,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:51,948 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:20:52,165 INFO L227 lantSequenceWeakener]: Weakened 147 states. On average, predicates are now at 81.21% of their original sizes. [2018-10-27 04:20:52,165 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:20:52,402 INFO L415 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2018-10-27 04:20:52,402 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:20:52,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:20:52,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 04:20:52,403 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:20:52,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:20:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:20:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:20:52,404 INFO L87 Difference]: Start difference. First operand 4638 states and 5609 transitions. Second operand 10 states. [2018-10-27 04:20:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:20:57,098 INFO L93 Difference]: Finished difference Result 9275 states and 11259 transitions. [2018-10-27 04:20:57,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:20:57,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 150 [2018-10-27 04:20:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:20:57,116 INFO L225 Difference]: With dead ends: 9275 [2018-10-27 04:20:57,116 INFO L226 Difference]: Without dead ends: 4779 [2018-10-27 04:20:57,128 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 157 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:20:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2018-10-27 04:20:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4776. [2018-10-27 04:20:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4776 states. [2018-10-27 04:20:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 5763 transitions. [2018-10-27 04:20:57,237 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 5763 transitions. Word has length 150 [2018-10-27 04:20:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:20:57,237 INFO L481 AbstractCegarLoop]: Abstraction has 4776 states and 5763 transitions. [2018-10-27 04:20:57,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:20:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 5763 transitions. [2018-10-27 04:20:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-27 04:20:57,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:20:57,246 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 04:20:57,246 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:20:57,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:57,247 INFO L82 PathProgramCache]: Analyzing trace with hash 802709829, now seen corresponding path program 1 times [2018-10-27 04:20:57,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:20:57,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:57,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:57,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:20:57,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:20:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:57,753 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:20:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 79 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:20:57,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:20:57,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:20:57,923 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-10-27 04:20:57,924 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:20:57,928 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:20:57,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:20:58,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:20:58,111 INFO L272 AbstractInterpreter]: Visited 86 different actions 164 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 04:20:58,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:20:58,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:20:58,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:20:58,149 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:20:58,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:20:58,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:20:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:20:58,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:20:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 04:20:58,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:20:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 04:20:59,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:20:59,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 15 [2018-10-27 04:20:59,181 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:20:59,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:20:59,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:20:59,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:20:59,182 INFO L87 Difference]: Start difference. First operand 4776 states and 5763 transitions. Second operand 11 states. [2018-10-27 04:21:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:21:04,683 INFO L93 Difference]: Finished difference Result 11322 states and 13791 transitions. [2018-10-27 04:21:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 04:21:04,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 153 [2018-10-27 04:21:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:21:04,716 INFO L225 Difference]: With dead ends: 11322 [2018-10-27 04:21:04,716 INFO L226 Difference]: Without dead ends: 4885 [2018-10-27 04:21:04,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=409, Invalid=1313, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 04:21:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2018-10-27 04:21:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4190. [2018-10-27 04:21:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2018-10-27 04:21:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 4893 transitions. [2018-10-27 04:21:04,827 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 4893 transitions. Word has length 153 [2018-10-27 04:21:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:21:04,828 INFO L481 AbstractCegarLoop]: Abstraction has 4190 states and 4893 transitions. [2018-10-27 04:21:04,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:21:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 4893 transitions. [2018-10-27 04:21:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 04:21:04,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:21:04,841 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 04:21:04,841 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:21:04,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2039889454, now seen corresponding path program 1 times [2018-10-27 04:21:04,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:21:04,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:04,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:04,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:04,843 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:21:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:05,383 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:21:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 145 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-27 04:21:05,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:05,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:21:05,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-10-27 04:21:05,569 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:21:05,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:21:05,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:21:05,720 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:21:05,720 INFO L272 AbstractInterpreter]: Visited 86 different actions 166 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 04:21:05,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:05,724 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:21:06,001 INFO L227 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 81.31% of their original sizes. [2018-10-27 04:21:06,001 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:21:06,131 INFO L415 sIntCurrentIteration]: We unified 212 AI predicates to 212 [2018-10-27 04:21:06,131 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:21:06,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:21:06,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 04:21:06,131 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:21:06,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:21:06,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:21:06,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:21:06,132 INFO L87 Difference]: Start difference. First operand 4190 states and 4893 transitions. Second operand 10 states. [2018-10-27 04:21:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:21:10,212 INFO L93 Difference]: Finished difference Result 8519 states and 10002 transitions. [2018-10-27 04:21:10,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:21:10,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-10-27 04:21:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:21:10,224 INFO L225 Difference]: With dead ends: 8519 [2018-10-27 04:21:10,224 INFO L226 Difference]: Without dead ends: 4609 [2018-10-27 04:21:10,230 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:21:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2018-10-27 04:21:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4468. [2018-10-27 04:21:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4468 states. [2018-10-27 04:21:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 5184 transitions. [2018-10-27 04:21:10,332 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 5184 transitions. Word has length 213 [2018-10-27 04:21:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:21:10,333 INFO L481 AbstractCegarLoop]: Abstraction has 4468 states and 5184 transitions. [2018-10-27 04:21:10,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:21:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 5184 transitions. [2018-10-27 04:21:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-27 04:21:10,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:21:10,346 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 04:21:10,347 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:21:10,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1226872015, now seen corresponding path program 1 times [2018-10-27 04:21:10,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:21:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:10,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:10,348 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:21:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 143 proven. 91 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-27 04:21:10,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:10,930 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:21:10,930 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-10-27 04:21:10,930 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:21:10,933 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:21:10,933 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:21:11,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:21:11,286 INFO L272 AbstractInterpreter]: Visited 88 different actions 354 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-27 04:21:11,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:11,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:21:11,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:11,292 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:21:11,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:11,300 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:21:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:11,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:21:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-10-27 04:21:11,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:21:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 149 proven. 81 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-27 04:21:11,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:21:11,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 04:21:11,739 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:21:11,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:21:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:21:11,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:21:11,740 INFO L87 Difference]: Start difference. First operand 4468 states and 5184 transitions. Second operand 11 states. [2018-10-27 04:21:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:21:14,542 INFO L93 Difference]: Finished difference Result 13717 states and 16162 transitions. [2018-10-27 04:21:14,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:21:14,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 222 [2018-10-27 04:21:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:21:14,569 INFO L225 Difference]: With dead ends: 13717 [2018-10-27 04:21:14,570 INFO L226 Difference]: Without dead ends: 9669 [2018-10-27 04:21:14,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 447 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:21:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9669 states. [2018-10-27 04:21:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 9463. [2018-10-27 04:21:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9463 states. [2018-10-27 04:21:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9463 states to 9463 states and 10744 transitions. [2018-10-27 04:21:14,819 INFO L78 Accepts]: Start accepts. Automaton has 9463 states and 10744 transitions. Word has length 222 [2018-10-27 04:21:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:21:14,819 INFO L481 AbstractCegarLoop]: Abstraction has 9463 states and 10744 transitions. [2018-10-27 04:21:14,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:21:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 9463 states and 10744 transitions. [2018-10-27 04:21:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-27 04:21:14,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:21:14,843 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 04:21:14,843 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:21:14,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:14,843 INFO L82 PathProgramCache]: Analyzing trace with hash 908379997, now seen corresponding path program 1 times [2018-10-27 04:21:14,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:21:14,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:14,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:14,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:21:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 170 proven. 104 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-27 04:21:15,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:15,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:21:15,205 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-10-27 04:21:15,205 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:21:15,208 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:21:15,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:21:15,393 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:21:15,394 INFO L272 AbstractInterpreter]: Visited 87 different actions 253 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-27 04:21:15,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:15,400 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:21:15,660 INFO L227 lantSequenceWeakener]: Weakened 228 states. On average, predicates are now at 82.95% of their original sizes. [2018-10-27 04:21:15,660 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:21:15,741 INFO L415 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2018-10-27 04:21:15,741 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:21:15,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:21:15,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 04:21:15,742 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:21:15,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:21:15,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:21:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:21:15,743 INFO L87 Difference]: Start difference. First operand 9463 states and 10744 transitions. Second operand 10 states. [2018-10-27 04:21:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:21:19,844 INFO L93 Difference]: Finished difference Result 17577 states and 19894 transitions. [2018-10-27 04:21:19,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:21:19,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 231 [2018-10-27 04:21:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:21:19,887 INFO L225 Difference]: With dead ends: 17577 [2018-10-27 04:21:19,887 INFO L226 Difference]: Without dead ends: 10164 [2018-10-27 04:21:19,899 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:21:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10164 states. [2018-10-27 04:21:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10164 to 9881. [2018-10-27 04:21:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9881 states. [2018-10-27 04:21:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9881 states to 9881 states and 11192 transitions. [2018-10-27 04:21:20,107 INFO L78 Accepts]: Start accepts. Automaton has 9881 states and 11192 transitions. Word has length 231 [2018-10-27 04:21:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:21:20,108 INFO L481 AbstractCegarLoop]: Abstraction has 9881 states and 11192 transitions. [2018-10-27 04:21:20,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:21:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 9881 states and 11192 transitions. [2018-10-27 04:21:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-27 04:21:20,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:21:20,135 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 04:21:20,135 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:21:20,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash -908820821, now seen corresponding path program 1 times [2018-10-27 04:21:20,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:21:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:20,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:20,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:20,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:21:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 225 proven. 93 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-27 04:21:20,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:20,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:21:20,737 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-10-27 04:21:20,737 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:21:20,740 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:21:20,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:21:21,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:21:21,174 INFO L272 AbstractInterpreter]: Visited 88 different actions 352 times. Merged at 9 different actions 36 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-27 04:21:21,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:21,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:21:21,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:21,179 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:21:21,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:21,188 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:21:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:21,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:21:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 282 proven. 2 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-27 04:21:21,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:21:21,744 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-10-27 04:21:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 205 proven. 28 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-27 04:21:22,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:21:22,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-27 04:21:22,358 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:21:22,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:21:22,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:21:22,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:21:22,360 INFO L87 Difference]: Start difference. First operand 9881 states and 11192 transitions. Second operand 12 states. [2018-10-27 04:21:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:21:25,586 INFO L93 Difference]: Finished difference Result 18311 states and 21592 transitions. [2018-10-27 04:21:25,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:21:25,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 247 [2018-10-27 04:21:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:21:25,607 INFO L225 Difference]: With dead ends: 18311 [2018-10-27 04:21:25,608 INFO L226 Difference]: Without dead ends: 8156 [2018-10-27 04:21:25,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2018-10-27 04:21:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8156 states. [2018-10-27 04:21:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8156 to 7449. [2018-10-27 04:21:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7449 states. [2018-10-27 04:21:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7449 states to 7449 states and 8107 transitions. [2018-10-27 04:21:25,819 INFO L78 Accepts]: Start accepts. Automaton has 7449 states and 8107 transitions. Word has length 247 [2018-10-27 04:21:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:21:25,820 INFO L481 AbstractCegarLoop]: Abstraction has 7449 states and 8107 transitions. [2018-10-27 04:21:25,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:21:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7449 states and 8107 transitions. [2018-10-27 04:21:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-27 04:21:25,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:21:25,837 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 04:21:25,837 INFO L424 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:21:25,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:25,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1204577446, now seen corresponding path program 1 times [2018-10-27 04:21:25,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:21:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:25,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:25,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:21:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 220 proven. 145 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-27 04:21:26,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:26,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:21:26,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-10-27 04:21:26,396 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:21:26,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:21:26,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:21:26,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:21:26,822 INFO L272 AbstractInterpreter]: Visited 89 different actions 443 times. Merged at 11 different actions 46 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-27 04:21:26,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:26,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:21:26,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:26,832 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:21:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:26,841 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:21:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:26,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:21:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 292 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-27 04:21:27,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:21:27,406 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-10-27 04:21:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 228 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-10-27 04:21:27,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:21:27,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-27 04:21:27,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:21:27,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:21:27,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:21:27,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:21:27,650 INFO L87 Difference]: Start difference. First operand 7449 states and 8107 transitions. Second operand 12 states. [2018-10-27 04:21:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:21:29,904 INFO L93 Difference]: Finished difference Result 12598 states and 13776 transitions. [2018-10-27 04:21:29,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:21:29,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 251 [2018-10-27 04:21:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:21:29,921 INFO L225 Difference]: With dead ends: 12598 [2018-10-27 04:21:29,921 INFO L226 Difference]: Without dead ends: 5590 [2018-10-27 04:21:29,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2018-10-27 04:21:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5590 states. [2018-10-27 04:21:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5590 to 4223. [2018-10-27 04:21:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4223 states. [2018-10-27 04:21:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 4548 transitions. [2018-10-27 04:21:30,020 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 4548 transitions. Word has length 251 [2018-10-27 04:21:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:21:30,021 INFO L481 AbstractCegarLoop]: Abstraction has 4223 states and 4548 transitions. [2018-10-27 04:21:30,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:21:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 4548 transitions. [2018-10-27 04:21:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-27 04:21:30,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:21:30,033 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 04:21:30,034 INFO L424 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:21:30,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2045594437, now seen corresponding path program 1 times [2018-10-27 04:21:30,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:21:30,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:30,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:30,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:30,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:21:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 283 proven. 104 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-27 04:21:30,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:30,638 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:21:30,639 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-10-27 04:21:30,639 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [149], [150], [154], [158], [162], [166], [170], [174], [177], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [277], [279], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 04:21:30,641 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 04:21:30,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:21:30,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:21:30,919 INFO L272 AbstractInterpreter]: Visited 88 different actions 347 times. Merged at 10 different actions 31 times. Never widened. Found 8 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-27 04:21:30,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:30,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:21:30,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:21:30,924 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:21:30,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:30,934 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:21:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:21:31,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:21:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 336 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-10-27 04:21:31,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:21:31,385 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-10-27 04:21:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 245 proven. 28 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-10-27 04:21:31,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:21:31,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-27 04:21:31,569 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:21:31,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:21:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:21:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:21:31,570 INFO L87 Difference]: Start difference. First operand 4223 states and 4548 transitions. Second operand 12 states. [2018-10-27 04:21:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:21:33,583 INFO L93 Difference]: Finished difference Result 7945 states and 8663 transitions. [2018-10-27 04:21:33,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:21:33,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 287 [2018-10-27 04:21:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:21:33,591 INFO L225 Difference]: With dead ends: 7945 [2018-10-27 04:21:33,591 INFO L226 Difference]: Without dead ends: 4409 [2018-10-27 04:21:33,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2018-10-27 04:21:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2018-10-27 04:21:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4231. [2018-10-27 04:21:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4231 states. [2018-10-27 04:21:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4231 states to 4231 states and 4540 transitions. [2018-10-27 04:21:33,684 INFO L78 Accepts]: Start accepts. Automaton has 4231 states and 4540 transitions. Word has length 287 [2018-10-27 04:21:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:21:33,684 INFO L481 AbstractCegarLoop]: Abstraction has 4231 states and 4540 transitions. [2018-10-27 04:21:33,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:21:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 4231 states and 4540 transitions. [2018-10-27 04:21:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-27 04:21:33,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:21:33,694 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-27 04:21:33,695 INFO L424 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:21:33,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:21:33,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1894539732, now seen corresponding path program 1 times [2018-10-27 04:21:33,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:21:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:33,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:21:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:21:33,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:21:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:21:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:21:33,895 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 04:21:34,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:21:34 BoogieIcfgContainer [2018-10-27 04:21:34,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:21:34,099 INFO L168 Benchmark]: Toolchain (without parser) took 75723.84 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -351.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-27 04:21:34,100 INFO L168 Benchmark]: CDTParser took 0.22 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-27 04:21:34,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.49 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-27 04:21:34,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 217.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.5 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2018-10-27 04:21:34,105 INFO L168 Benchmark]: Boogie Preprocessor took 94.79 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-27 04:21:34,105 INFO L168 Benchmark]: RCFGBuilder took 3193.85 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: 102.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. [2018-10-27 04:21:34,106 INFO L168 Benchmark]: TraceAbstraction took 71449.26 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 948.4 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 342.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-27 04:21:34,111 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.22 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 763.49 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 217.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.5 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.79 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 3193.85 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: 102.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71449.26 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 948.4 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 342.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 395]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; VAL [\old(a)=31, \old(a12)=27, \old(a16)=24, \old(a17)=18, \old(a20)=19, \old(a21)=23, \old(a7)=26, \old(a8)=34, \old(b)=20, \old(c)=21, \old(d)=29, \old(e)=17, \old(f)=28, \old(u)=32, \old(v)=16, \old(w)=30, \old(x)=22, \old(y)=33, \old(z)=25, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L580] int output = -1; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] RET return 25; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, calculate_output(input)=25, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))) [L232] a8 = 14 [L233] a7 = 0 [L234] a17 = 1 [L235] a21 = 1 [L236] a16 = 4 [L237] RET return -1; VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=3, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL calculate_output(input) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L395] __VERIFIER_error() VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=14, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. UNSAFE Result, 71.3s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 49.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1812 SDtfs, 15161 SDslu, 2002 SDs, 0 SdLazy, 16681 SolverSat, 2738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.8s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 3597 GetRequests, 3361 SyntacticMatches, 11 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9881occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.4s AbstIntTime, 10 AbstIntIterations, 4 AbstIntStrong, 0.9966001659122997 AbsIntWeakeningRatio, 0.24076607387140903 AbsIntAvgWeakeningVarsNumRemoved, 27.517099863201093 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 3829 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 4209 NumberOfCodeBlocks, 4209 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5177 ConstructedInterpolants, 0 QuantifiedInterpolants, 2977994 SizeOfPredicates, 26 NumberOfNonLiveVariables, 3758 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 5499/6279 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...