/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 22:56:56,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 22:56:56,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 22:56:56,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 22:56:56,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 22:56:56,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 22:56:56,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 22:56:56,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 22:56:56,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 22:56:56,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 22:56:56,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 22:56:56,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 22:56:56,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 22:56:56,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 22:56:56,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 22:56:56,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 22:56:56,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 22:56:56,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 22:56:56,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 22:56:56,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 22:56:56,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 22:56:56,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 22:56:56,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 22:56:56,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 22:56:56,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 22:56:56,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 22:56:56,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 22:56:56,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 22:56:56,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 22:56:56,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 22:56:56,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 22:56:56,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 22:56:56,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 22:56:56,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 22:56:56,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 22:56:56,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 22:56:56,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 22:56:56,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 22:56:56,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 22:56:56,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 22:56:56,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 22:56:56,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 22:56:56,746 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 22:56:56,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 22:56:56,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 22:56:56,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 22:56:56,748 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 22:56:56,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 22:56:56,748 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 22:56:56,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 22:56:56,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 22:56:56,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 22:56:56,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 22:56:56,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 22:56:56,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 22:56:56,750 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 22:56:56,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 22:56:56,750 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 22:56:56,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 22:56:56,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 22:56:56,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 22:56:56,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 22:56:56,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 22:56:56,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 22:56:56,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 22:56:56,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 22:56:56,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 22:56:56,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 22:56:56,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:56:56,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 22:56:56,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 22:56:56,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 22:56:57,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 22:56:57,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 22:56:57,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 22:56:57,054 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 22:56:57,054 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 22:56:57,055 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2020-07-21 22:56:57,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e0c6ffa/45f863378075400bb5a862e5d20a9120/FLAG9ce0267df [2020-07-21 22:56:57,714 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 22:56:57,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2020-07-21 22:56:57,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e0c6ffa/45f863378075400bb5a862e5d20a9120/FLAG9ce0267df [2020-07-21 22:56:58,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e0c6ffa/45f863378075400bb5a862e5d20a9120 [2020-07-21 22:56:58,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 22:56:58,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 22:56:58,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 22:56:58,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 22:56:58,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 22:56:58,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c9b653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58, skipping insertion in model container [2020-07-21 22:56:58,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 22:56:58,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 22:56:58,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 22:56:58,669 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 22:56:58,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 22:56:58,796 INFO L208 MainTranslator]: Completed translation [2020-07-21 22:56:58,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58 WrapperNode [2020-07-21 22:56:58,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 22:56:58,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 22:56:58,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 22:56:58,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 22:56:58,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (1/1) ... [2020-07-21 22:56:58,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 22:56:58,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 22:56:58,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 22:56:58,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 22:56:58,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 22:56:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 22:56:59,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 22:56:59,002 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-07-21 22:56:59,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 22:56:59,002 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-07-21 22:56:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 22:56:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 22:56:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-21 22:56:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 22:56:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 22:56:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 22:57:00,214 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 22:57:00,215 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 22:57:00,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:57:00 BoogieIcfgContainer [2020-07-21 22:57:00,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 22:57:00,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 22:57:00,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 22:57:00,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 22:57:00,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:56:58" (1/3) ... [2020-07-21 22:57:00,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5a84d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:57:00, skipping insertion in model container [2020-07-21 22:57:00,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:56:58" (2/3) ... [2020-07-21 22:57:00,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5a84d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:57:00, skipping insertion in model container [2020-07-21 22:57:00,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:57:00" (3/3) ... [2020-07-21 22:57:00,232 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c [2020-07-21 22:57:00,243 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 22:57:00,252 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 22:57:00,267 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 22:57:00,295 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 22:57:00,295 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 22:57:00,295 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 22:57:00,296 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 22:57:00,296 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 22:57:00,296 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 22:57:00,296 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 22:57:00,296 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 22:57:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2020-07-21 22:57:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-21 22:57:00,331 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:00,333 INFO L422 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:00,333 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1330544841, now seen corresponding path program 1 times [2020-07-21 22:57:00,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:00,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1442238051] [2020-07-21 22:57:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:00,522 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 22:57:00,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:00,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 52 conjunts are in the unsatisfiable core [2020-07-21 22:57:00,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:01,071 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 22:57:01,077 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 22:57:01,078 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 2 disjuncts [2020-07-21 22:57:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 22:57:01,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:57:01,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1442238051] [2020-07-21 22:57:01,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:57:01,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-21 22:57:01,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013956816] [2020-07-21 22:57:01,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-21 22:57:01,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:01,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-21 22:57:01,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-21 22:57:01,193 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 10 states. [2020-07-21 22:57:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:02,495 INFO L93 Difference]: Finished difference Result 527 states and 878 transitions. [2020-07-21 22:57:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 22:57:02,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2020-07-21 22:57:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:02,523 INFO L225 Difference]: With dead ends: 527 [2020-07-21 22:57:02,523 INFO L226 Difference]: Without dead ends: 229 [2020-07-21 22:57:02,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2020-07-21 22:57:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-07-21 22:57:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2020-07-21 22:57:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-21 22:57:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions. [2020-07-21 22:57:02,606 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 87 [2020-07-21 22:57:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:02,607 INFO L479 AbstractCegarLoop]: Abstraction has 229 states and 319 transitions. [2020-07-21 22:57:02,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-21 22:57:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions. [2020-07-21 22:57:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 22:57:02,613 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:02,613 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:02,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:02,827 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:02,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:02,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1686420664, now seen corresponding path program 1 times [2020-07-21 22:57:02,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:02,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608526389] [2020-07-21 22:57:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:02,922 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 22:57:02,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:02,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 22:57:02,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 22:57:02,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:57:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 22:57:03,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608526389] [2020-07-21 22:57:03,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 22:57:03,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-07-21 22:57:03,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960141833] [2020-07-21 22:57:03,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-21 22:57:03,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:03,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-21 22:57:03,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-21 22:57:03,101 INFO L87 Difference]: Start difference. First operand 229 states and 319 transitions. Second operand 4 states. [2020-07-21 22:57:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:03,750 INFO L93 Difference]: Finished difference Result 614 states and 880 transitions. [2020-07-21 22:57:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-21 22:57:03,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-07-21 22:57:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:03,756 INFO L225 Difference]: With dead ends: 614 [2020-07-21 22:57:03,756 INFO L226 Difference]: Without dead ends: 391 [2020-07-21 22:57:03,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 184 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-21 22:57:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-07-21 22:57:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2020-07-21 22:57:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-07-21 22:57:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 547 transitions. [2020-07-21 22:57:03,805 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 547 transitions. Word has length 96 [2020-07-21 22:57:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:03,806 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 547 transitions. [2020-07-21 22:57:03,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-21 22:57:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 547 transitions. [2020-07-21 22:57:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-21 22:57:03,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:03,814 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:04,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:04,028 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash -351131075, now seen corresponding path program 1 times [2020-07-21 22:57:04,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:04,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487528988] [2020-07-21 22:57:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:04,123 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:57:04,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:04,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 22:57:04,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:04,163 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-07-21 22:57:04,164 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 22:57:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 22:57:04,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:57:04,294 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:57:04,296 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 1] term [2020-07-21 22:57:04,296 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:57:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 22:57:04,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487528988] [2020-07-21 22:57:04,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:57:04,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 22:57:04,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679539433] [2020-07-21 22:57:04,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 22:57:04,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 22:57:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 22:57:04,398 INFO L87 Difference]: Start difference. First operand 391 states and 547 transitions. Second operand 6 states. [2020-07-21 22:57:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:05,412 INFO L93 Difference]: Finished difference Result 1114 states and 1624 transitions. [2020-07-21 22:57:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 22:57:05,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2020-07-21 22:57:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:05,419 INFO L225 Difference]: With dead ends: 1114 [2020-07-21 22:57:05,420 INFO L226 Difference]: Without dead ends: 729 [2020-07-21 22:57:05,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-21 22:57:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2020-07-21 22:57:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 702. [2020-07-21 22:57:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2020-07-21 22:57:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 922 transitions. [2020-07-21 22:57:05,466 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 922 transitions. Word has length 104 [2020-07-21 22:57:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:05,466 INFO L479 AbstractCegarLoop]: Abstraction has 702 states and 922 transitions. [2020-07-21 22:57:05,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 22:57:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 922 transitions. [2020-07-21 22:57:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-07-21 22:57:05,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:05,472 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:05,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:05,684 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:05,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash 409285400, now seen corresponding path program 1 times [2020-07-21 22:57:05,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:05,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945714953] [2020-07-21 22:57:05,687 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:05,784 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:57:05,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:05,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 22:57:05,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-21 22:57:05,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:57:05,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945714953] [2020-07-21 22:57:05,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:57:05,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 22:57:05,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051876442] [2020-07-21 22:57:05,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 22:57:05,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:05,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 22:57:05,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-21 22:57:05,845 INFO L87 Difference]: Start difference. First operand 702 states and 922 transitions. Second operand 5 states. [2020-07-21 22:57:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:06,739 INFO L93 Difference]: Finished difference Result 2088 states and 2936 transitions. [2020-07-21 22:57:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 22:57:06,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2020-07-21 22:57:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:06,756 INFO L225 Difference]: With dead ends: 2088 [2020-07-21 22:57:06,756 INFO L226 Difference]: Without dead ends: 1392 [2020-07-21 22:57:06,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 22:57:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-07-21 22:57:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1341. [2020-07-21 22:57:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2020-07-21 22:57:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1781 transitions. [2020-07-21 22:57:06,844 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1781 transitions. Word has length 124 [2020-07-21 22:57:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:06,845 INFO L479 AbstractCegarLoop]: Abstraction has 1341 states and 1781 transitions. [2020-07-21 22:57:06,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 22:57:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1781 transitions. [2020-07-21 22:57:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-07-21 22:57:06,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:06,853 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:07,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:07,068 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1305999380, now seen corresponding path program 1 times [2020-07-21 22:57:07,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:07,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509729335] [2020-07-21 22:57:07,070 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:07,188 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:57:07,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:07,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 22:57:07,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 22:57:07,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:57:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 22:57:07,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1509729335] [2020-07-21 22:57:07,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:57:07,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-21 22:57:07,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526190678] [2020-07-21 22:57:07,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 22:57:07,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 22:57:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-21 22:57:07,290 INFO L87 Difference]: Start difference. First operand 1341 states and 1781 transitions. Second operand 7 states. [2020-07-21 22:57:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:08,481 INFO L93 Difference]: Finished difference Result 3324 states and 4390 transitions. [2020-07-21 22:57:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 22:57:08,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-07-21 22:57:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:08,496 INFO L225 Difference]: With dead ends: 3324 [2020-07-21 22:57:08,496 INFO L226 Difference]: Without dead ends: 1989 [2020-07-21 22:57:08,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-21 22:57:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2020-07-21 22:57:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1960. [2020-07-21 22:57:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2020-07-21 22:57:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2460 transitions. [2020-07-21 22:57:08,572 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2460 transitions. Word has length 124 [2020-07-21 22:57:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:08,573 INFO L479 AbstractCegarLoop]: Abstraction has 1960 states and 2460 transitions. [2020-07-21 22:57:08,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 22:57:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2460 transitions. [2020-07-21 22:57:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-07-21 22:57:08,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:08,580 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:08,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:08,793 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1518746016, now seen corresponding path program 1 times [2020-07-21 22:57:08,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:08,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641002617] [2020-07-21 22:57:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:08,881 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:57:08,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:08,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 22:57:08,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-21 22:57:08,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:57:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-21 22:57:08,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641002617] [2020-07-21 22:57:08,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:57:08,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 22:57:08,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809208341] [2020-07-21 22:57:08,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 22:57:08,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 22:57:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 22:57:08,980 INFO L87 Difference]: Start difference. First operand 1960 states and 2460 transitions. Second operand 6 states. [2020-07-21 22:57:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:10,048 INFO L93 Difference]: Finished difference Result 3983 states and 5152 transitions. [2020-07-21 22:57:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 22:57:10,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2020-07-21 22:57:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:10,071 INFO L225 Difference]: With dead ends: 3983 [2020-07-21 22:57:10,071 INFO L226 Difference]: Without dead ends: 2029 [2020-07-21 22:57:10,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-21 22:57:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2020-07-21 22:57:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1970. [2020-07-21 22:57:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2020-07-21 22:57:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2427 transitions. [2020-07-21 22:57:10,141 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2427 transitions. Word has length 128 [2020-07-21 22:57:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:10,141 INFO L479 AbstractCegarLoop]: Abstraction has 1970 states and 2427 transitions. [2020-07-21 22:57:10,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 22:57:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2427 transitions. [2020-07-21 22:57:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-07-21 22:57:10,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:10,146 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:10,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:10,361 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash -196538764, now seen corresponding path program 1 times [2020-07-21 22:57:10,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:10,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [775195748] [2020-07-21 22:57:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:10,445 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:57:10,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:10,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 22:57:10,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 22:57:10,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:57:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 22:57:10,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [775195748] [2020-07-21 22:57:10,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:57:10,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-21 22:57:10,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305466437] [2020-07-21 22:57:10,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 22:57:10,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 22:57:10,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-21 22:57:10,532 INFO L87 Difference]: Start difference. First operand 1970 states and 2427 transitions. Second operand 7 states. [2020-07-21 22:57:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:11,680 INFO L93 Difference]: Finished difference Result 4301 states and 5291 transitions. [2020-07-21 22:57:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 22:57:11,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-07-21 22:57:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:11,696 INFO L225 Difference]: With dead ends: 4301 [2020-07-21 22:57:11,697 INFO L226 Difference]: Without dead ends: 2337 [2020-07-21 22:57:11,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-21 22:57:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2020-07-21 22:57:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2306. [2020-07-21 22:57:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2020-07-21 22:57:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 2747 transitions. [2020-07-21 22:57:11,761 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 2747 transitions. Word has length 128 [2020-07-21 22:57:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:11,761 INFO L479 AbstractCegarLoop]: Abstraction has 2306 states and 2747 transitions. [2020-07-21 22:57:11,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 22:57:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2747 transitions. [2020-07-21 22:57:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-07-21 22:57:11,767 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:11,767 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:11,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:11,983 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1970778982, now seen corresponding path program 1 times [2020-07-21 22:57:11,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:11,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [818268830] [2020-07-21 22:57:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:12,065 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:57:12,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:12,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 22:57:12,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-21 22:57:12,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:57:12,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [818268830] [2020-07-21 22:57:12,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:57:12,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 22:57:12,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930712035] [2020-07-21 22:57:12,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 22:57:12,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 22:57:12,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-21 22:57:12,109 INFO L87 Difference]: Start difference. First operand 2306 states and 2747 transitions. Second operand 5 states. [2020-07-21 22:57:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:12,983 INFO L93 Difference]: Finished difference Result 6020 states and 7585 transitions. [2020-07-21 22:57:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 22:57:12,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-07-21 22:57:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:13,035 INFO L225 Difference]: With dead ends: 6020 [2020-07-21 22:57:13,036 INFO L226 Difference]: Without dead ends: 2920 [2020-07-21 22:57:13,044 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 22:57:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-07-21 22:57:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2718. [2020-07-21 22:57:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2020-07-21 22:57:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3123 transitions. [2020-07-21 22:57:13,111 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3123 transitions. Word has length 135 [2020-07-21 22:57:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:13,111 INFO L479 AbstractCegarLoop]: Abstraction has 2718 states and 3123 transitions. [2020-07-21 22:57:13,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 22:57:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3123 transitions. [2020-07-21 22:57:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 22:57:13,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:13,118 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:13,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:13,333 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:13,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1211355354, now seen corresponding path program 1 times [2020-07-21 22:57:13,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:13,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1135992569] [2020-07-21 22:57:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:13,452 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 22:57:13,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:13,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 22:57:13,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-21 22:57:13,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:57:13,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1135992569] [2020-07-21 22:57:13,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:57:13,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 22:57:13,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141320997] [2020-07-21 22:57:13,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 22:57:13,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 22:57:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 22:57:13,484 INFO L87 Difference]: Start difference. First operand 2718 states and 3123 transitions. Second operand 3 states. [2020-07-21 22:57:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:14,057 INFO L93 Difference]: Finished difference Result 5828 states and 6803 transitions. [2020-07-21 22:57:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 22:57:14,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 22:57:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:14,072 INFO L225 Difference]: With dead ends: 5828 [2020-07-21 22:57:14,072 INFO L226 Difference]: Without dead ends: 3434 [2020-07-21 22:57:14,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 22:57:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2020-07-21 22:57:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3290. [2020-07-21 22:57:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3290 states. [2020-07-21 22:57:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 3809 transitions. [2020-07-21 22:57:14,148 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 3809 transitions. Word has length 175 [2020-07-21 22:57:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:14,149 INFO L479 AbstractCegarLoop]: Abstraction has 3290 states and 3809 transitions. [2020-07-21 22:57:14,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 22:57:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 3809 transitions. [2020-07-21 22:57:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-07-21 22:57:14,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:14,157 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:14,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:14,372 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash 790235018, now seen corresponding path program 1 times [2020-07-21 22:57:14,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:14,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706086903] [2020-07-21 22:57:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:14,466 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:57:14,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:14,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 22:57:14,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 146 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-21 22:57:14,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:57:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 121 proven. 23 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-21 22:57:14,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706086903] [2020-07-21 22:57:14,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:57:14,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 22:57:14,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56415071] [2020-07-21 22:57:14,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 22:57:14,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 22:57:14,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 22:57:14,634 INFO L87 Difference]: Start difference. First operand 3290 states and 3809 transitions. Second operand 6 states. [2020-07-21 22:57:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:15,050 INFO L93 Difference]: Finished difference Result 5777 states and 6738 transitions. [2020-07-21 22:57:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 22:57:15,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2020-07-21 22:57:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:15,063 INFO L225 Difference]: With dead ends: 5777 [2020-07-21 22:57:15,063 INFO L226 Difference]: Without dead ends: 2811 [2020-07-21 22:57:15,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 354 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-21 22:57:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-07-21 22:57:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2667. [2020-07-21 22:57:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2020-07-21 22:57:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3040 transitions. [2020-07-21 22:57:15,127 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3040 transitions. Word has length 180 [2020-07-21 22:57:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:15,128 INFO L479 AbstractCegarLoop]: Abstraction has 2667 states and 3040 transitions. [2020-07-21 22:57:15,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 22:57:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3040 transitions. [2020-07-21 22:57:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-21 22:57:15,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:15,135 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:15,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:15,348 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1418413958, now seen corresponding path program 1 times [2020-07-21 22:57:15,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:15,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1271433534] [2020-07-21 22:57:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:15,436 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:57:15,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:57:15,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 22:57:15,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:57:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-21 22:57:15,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:57:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 133 proven. 14 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-21 22:57:15,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1271433534] [2020-07-21 22:57:15,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:57:15,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-21 22:57:15,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721434234] [2020-07-21 22:57:15,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 22:57:15,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:57:15,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 22:57:15,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-21 22:57:15,602 INFO L87 Difference]: Start difference. First operand 2667 states and 3040 transitions. Second operand 7 states. [2020-07-21 22:57:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:57:16,610 INFO L93 Difference]: Finished difference Result 5247 states and 5986 transitions. [2020-07-21 22:57:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 22:57:16,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2020-07-21 22:57:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:57:16,622 INFO L225 Difference]: With dead ends: 5247 [2020-07-21 22:57:16,622 INFO L226 Difference]: Without dead ends: 2495 [2020-07-21 22:57:16,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-07-21 22:57:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2020-07-21 22:57:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2493. [2020-07-21 22:57:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2020-07-21 22:57:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2786 transitions. [2020-07-21 22:57:16,679 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2786 transitions. Word has length 190 [2020-07-21 22:57:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:57:16,680 INFO L479 AbstractCegarLoop]: Abstraction has 2493 states and 2786 transitions. [2020-07-21 22:57:16,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 22:57:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2786 transitions. [2020-07-21 22:57:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-07-21 22:57:16,687 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:57:16,688 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:57:16,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:16,903 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:57:16,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:57:16,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1694040566, now seen corresponding path program 1 times [2020-07-21 22:57:16,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:57:16,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220563533] [2020-07-21 22:57:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:17,029 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 22:57:17,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 22:57:17,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 22:57:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 22:57:17,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 22:57:17,381 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 22:57:17,381 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 22:57:17,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:57:17,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 10:57:17 BoogieIcfgContainer [2020-07-21 22:57:17,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 22:57:17,791 INFO L168 Benchmark]: Toolchain (without parser) took 19753.17 ms. Allocated memory was 145.8 MB in the beginning and 474.0 MB in the end (delta: 328.2 MB). Free memory was 101.6 MB in the beginning and 186.7 MB in the end (delta: -85.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2020-07-21 22:57:17,792 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-21 22:57:17,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.97 ms. Allocated memory was 145.8 MB in the beginning and 205.5 MB in the end (delta: 59.8 MB). Free memory was 101.2 MB in the beginning and 172.2 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2020-07-21 22:57:17,793 INFO L168 Benchmark]: Boogie Preprocessor took 136.00 ms. Allocated memory is still 205.5 MB. Free memory was 172.2 MB in the beginning and 167.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-07-21 22:57:17,794 INFO L168 Benchmark]: RCFGBuilder took 1287.65 ms. Allocated memory was 205.5 MB in the beginning and 239.1 MB in the end (delta: 33.6 MB). Free memory was 167.4 MB in the beginning and 183.3 MB in the end (delta: -15.9 MB). Peak memory consumption was 82.7 MB. Max. memory is 7.1 GB. [2020-07-21 22:57:17,794 INFO L168 Benchmark]: TraceAbstraction took 17564.94 ms. Allocated memory was 239.1 MB in the beginning and 474.0 MB in the end (delta: 234.9 MB). Free memory was 181.8 MB in the beginning and 186.7 MB in the end (delta: -4.9 MB). Peak memory consumption was 230.0 MB. Max. memory is 7.1 GB. [2020-07-21 22:57:17,798 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.47 ms. Allocated memory is still 145.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.97 ms. Allocated memory was 145.8 MB in the beginning and 205.5 MB in the end (delta: 59.8 MB). Free memory was 101.2 MB in the beginning and 172.2 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.00 ms. Allocated memory is still 205.5 MB. Free memory was 172.2 MB in the beginning and 167.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1287.65 ms. Allocated memory was 205.5 MB in the beginning and 239.1 MB in the end (delta: 33.6 MB). Free memory was 167.4 MB in the beginning and 183.3 MB in the end (delta: -15.9 MB). Peak memory consumption was 82.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17564.94 ms. Allocated memory was 239.1 MB in the beginning and 474.0 MB in the end (delta: 234.9 MB). Free memory was 181.8 MB in the beginning and 186.7 MB in the end (delta: -4.9 MB). Peak memory consumption was 230.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; VAL [\old(a)=29, \old(a11)=31, \old(a17)=33, \old(a19)=15, \old(a21)=16, \old(a25)=17, \old(a28)=13, \old(c)=20, \old(d)=32, \old(e)=28, \old(f)=27, \old(u)=30, \old(v)=14, \old(w)=2, \old(x)=19, \old(y)=18, \old(z)=12, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L603] int output = -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, \result=23, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, calculate_output(input)=23, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, \result=25, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, calculate_output(input)=25, d=4, e=5, f=6, input=3, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=1, \result=-1, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=1, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL calculate_output(input) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L415] __VERIFIER_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=6, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.3s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 828 SDtfs, 5125 SDslu, 707 SDs, 0 SdLazy, 7931 SolverSat, 1110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2446 GetRequests, 2367 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3290occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 689 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2403 ConstructedInterpolants, 0 QuantifiedInterpolants, 725957 SizeOfPredicates, 27 NumberOfNonLiveVariables, 3449 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 1226/1292 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...