java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label16.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:56:10,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:56:10,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:56:10,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:56:10,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:56:10,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:56:10,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:56:10,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:56:10,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:56:10,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:56:10,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:56:10,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:56:10,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:56:10,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:56:10,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:56:10,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:56:10,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:56:10,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:56:10,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:56:10,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:56:10,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:56:10,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:56:10,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:56:10,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:56:10,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:56:10,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:56:10,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:56:10,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:56:10,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:56:10,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:56:10,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:56:10,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:56:10,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:56:10,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:56:10,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:56:10,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:56:10,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:56:10,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:56:10,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:56:10,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:56:10,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:56:10,533 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 [2019-10-14 23:56:10,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:56:10,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:56:10,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:56:10,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:56:10,555 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:56:10,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:56:10,555 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:56:10,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:56:10,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:56:10,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:56:10,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:56:10,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:56:10,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:56:10,557 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:56:10,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:56:10,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:56:10,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:56:10,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:56:10,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:56:10,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:56:10,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:56:10,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:56:10,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:56:10,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:56:10,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:56:10,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:56:10,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:56:10,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:56:10,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-14 23:56:10,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:56:10,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:56:10,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:56:10,881 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:56:10,881 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:56:10,882 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label16.c [2019-10-14 23:56:10,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0f822cb/309da1869f994da18881c89ad14270ee/FLAGaf0dcfe5a [2019-10-14 23:56:11,582 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:56:11,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label16.c [2019-10-14 23:56:11,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0f822cb/309da1869f994da18881c89ad14270ee/FLAGaf0dcfe5a [2019-10-14 23:56:11,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0f822cb/309da1869f994da18881c89ad14270ee [2019-10-14 23:56:11,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:56:11,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:56:11,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:56:11,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:56:11,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:56:11,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:56:11" (1/1) ... [2019-10-14 23:56:11,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:11, skipping insertion in model container [2019-10-14 23:56:11,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:56:11" (1/1) ... [2019-10-14 23:56:11,841 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:56:11,901 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:56:12,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:56:12,560 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:56:12,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:56:12,678 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:56:12,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12 WrapperNode [2019-10-14 23:56:12,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:56:12,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:56:12,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:56:12,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:56:12,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (1/1) ... [2019-10-14 23:56:12,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (1/1) ... [2019-10-14 23:56:12,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (1/1) ... [2019-10-14 23:56:12,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (1/1) ... [2019-10-14 23:56:12,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (1/1) ... [2019-10-14 23:56:12,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (1/1) ... [2019-10-14 23:56:12,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (1/1) ... [2019-10-14 23:56:12,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:56:12,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:56:12,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:56:12,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:56:12,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (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 [2019-10-14 23:56:12,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:56:12,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:56:12,865 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 23:56:12,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:56:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 23:56:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:56:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:56:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:56:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:56:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:56:12,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:56:14,167 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:56:14,169 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:56:14,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:14 BoogieIcfgContainer [2019-10-14 23:56:14,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:56:14,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:56:14,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:56:14,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:56:14,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:56:11" (1/3) ... [2019-10-14 23:56:14,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10afa6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:56:14, skipping insertion in model container [2019-10-14 23:56:14,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:12" (2/3) ... [2019-10-14 23:56:14,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10afa6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:56:14, skipping insertion in model container [2019-10-14 23:56:14,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:14" (3/3) ... [2019-10-14 23:56:14,185 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label16.c [2019-10-14 23:56:14,195 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:56:14,204 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:56:14,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:56:14,256 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:56:14,256 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:56:14,256 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:56:14,256 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:56:14,256 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:56:14,257 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:56:14,258 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:56:14,258 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:56:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-14 23:56:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-14 23:56:14,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:14,304 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:14,306 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 749761985, now seen corresponding path program 1 times [2019-10-14 23:56:14,317 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:14,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720382930] [2019-10-14 23:56:14,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:14,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:14,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:14,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720382930] [2019-10-14 23:56:14,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:14,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:56:14,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266485376] [2019-10-14 23:56:14,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:56:14,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:56:14,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:56:14,827 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-14 23:56:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:15,764 INFO L93 Difference]: Finished difference Result 615 states and 1053 transitions. [2019-10-14 23:56:15,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:56:15,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-14 23:56:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:15,797 INFO L225 Difference]: With dead ends: 615 [2019-10-14 23:56:15,797 INFO L226 Difference]: Without dead ends: 317 [2019-10-14 23:56:15,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:56:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-10-14 23:56:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-10-14 23:56:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-10-14 23:56:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 478 transitions. [2019-10-14 23:56:15,896 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 478 transitions. Word has length 93 [2019-10-14 23:56:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:15,897 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 478 transitions. [2019-10-14 23:56:15,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:56:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 478 transitions. [2019-10-14 23:56:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:56:15,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:15,903 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:15,903 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1069026620, now seen corresponding path program 1 times [2019-10-14 23:56:15,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:15,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979300676] [2019-10-14 23:56:15,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:15,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:15,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:16,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979300676] [2019-10-14 23:56:16,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:16,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:56:16,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127484349] [2019-10-14 23:56:16,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:56:16,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:16,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:56:16,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:56:16,051 INFO L87 Difference]: Start difference. First operand 317 states and 478 transitions. Second operand 6 states. [2019-10-14 23:56:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:16,487 INFO L93 Difference]: Finished difference Result 625 states and 951 transitions. [2019-10-14 23:56:16,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:56:16,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-10-14 23:56:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:16,490 INFO L225 Difference]: With dead ends: 625 [2019-10-14 23:56:16,490 INFO L226 Difference]: Without dead ends: 314 [2019-10-14 23:56:16,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:56:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-14 23:56:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2019-10-14 23:56:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-14 23:56:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2019-10-14 23:56:16,527 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 108 [2019-10-14 23:56:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:16,529 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2019-10-14 23:56:16,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:56:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2019-10-14 23:56:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-14 23:56:16,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:16,537 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:16,538 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1643291049, now seen corresponding path program 1 times [2019-10-14 23:56:16,538 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:16,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048298336] [2019-10-14 23:56:16,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:16,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:16,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:16,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048298336] [2019-10-14 23:56:16,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:16,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:56:16,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416158296] [2019-10-14 23:56:16,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:56:16,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:16,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:56:16,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:56:16,701 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand 6 states. [2019-10-14 23:56:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:17,447 INFO L93 Difference]: Finished difference Result 782 states and 1124 transitions. [2019-10-14 23:56:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:56:17,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-14 23:56:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:17,452 INFO L225 Difference]: With dead ends: 782 [2019-10-14 23:56:17,452 INFO L226 Difference]: Without dead ends: 478 [2019-10-14 23:56:17,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:56:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-14 23:56:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 461. [2019-10-14 23:56:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-14 23:56:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 632 transitions. [2019-10-14 23:56:17,477 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 632 transitions. Word has length 115 [2019-10-14 23:56:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:17,478 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 632 transitions. [2019-10-14 23:56:17,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:56:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 632 transitions. [2019-10-14 23:56:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-14 23:56:17,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:17,481 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:17,481 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:17,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2003412431, now seen corresponding path program 1 times [2019-10-14 23:56:17,482 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:17,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322052700] [2019-10-14 23:56:17,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:17,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:17,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:17,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322052700] [2019-10-14 23:56:17,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:17,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:56:17,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365888207] [2019-10-14 23:56:17,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:56:17,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:56:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:56:17,580 INFO L87 Difference]: Start difference. First operand 461 states and 632 transitions. Second operand 3 states. [2019-10-14 23:56:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:18,027 INFO L93 Difference]: Finished difference Result 1212 states and 1675 transitions. [2019-10-14 23:56:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:56:18,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-14 23:56:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:18,033 INFO L225 Difference]: With dead ends: 1212 [2019-10-14 23:56:18,033 INFO L226 Difference]: Without dead ends: 757 [2019-10-14 23:56:18,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:56:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-10-14 23:56:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2019-10-14 23:56:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-10-14 23:56:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 964 transitions. [2019-10-14 23:56:18,065 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 964 transitions. Word has length 119 [2019-10-14 23:56:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:18,065 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 964 transitions. [2019-10-14 23:56:18,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:56:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 964 transitions. [2019-10-14 23:56:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-14 23:56:18,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:18,069 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:18,069 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1737078688, now seen corresponding path program 1 times [2019-10-14 23:56:18,070 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:18,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295580616] [2019-10-14 23:56:18,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:18,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:18,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-14 23:56:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-14 23:56:18,216 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-14 23:56:18,217 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-14 23:56:18,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:56:18 BoogieIcfgContainer [2019-10-14 23:56:18,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:56:18,367 INFO L168 Benchmark]: Toolchain (without parser) took 6541.92 ms. Allocated memory was 135.8 MB in the beginning and 314.0 MB in the end (delta: 178.3 MB). Free memory was 98.7 MB in the beginning and 115.0 MB in the end (delta: -16.3 MB). Peak memory consumption was 161.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:56:18,369 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:56:18,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.92 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 98.5 MB in the beginning and 168.2 MB in the end (delta: -69.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:56:18,371 INFO L168 Benchmark]: Boogie Preprocessor took 122.93 ms. Allocated memory is still 201.9 MB. Free memory was 168.2 MB in the beginning and 163.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:56:18,373 INFO L168 Benchmark]: RCFGBuilder took 1367.74 ms. Allocated memory was 201.9 MB in the beginning and 229.6 MB in the end (delta: 27.8 MB). Free memory was 163.7 MB in the beginning and 180.0 MB in the end (delta: -16.3 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:56:18,380 INFO L168 Benchmark]: TraceAbstraction took 4189.15 ms. Allocated memory was 229.6 MB in the beginning and 314.0 MB in the end (delta: 84.4 MB). Free memory was 178.5 MB in the beginning and 115.0 MB in the end (delta: 63.5 MB). Peak memory consumption was 147.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:56:18,390 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 856.92 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 98.5 MB in the beginning and 168.2 MB in the end (delta: -69.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.93 ms. Allocated memory is still 201.9 MB. Free memory was 168.2 MB in the beginning and 163.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1367.74 ms. Allocated memory was 201.9 MB in the beginning and 229.6 MB in the end (delta: 27.8 MB). Free memory was 163.7 MB in the beginning and 180.0 MB in the end (delta: -16.3 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4189.15 ms. Allocated memory was 229.6 MB in the beginning and 314.0 MB in the end (delta: 84.4 MB). Free memory was 178.5 MB in the beginning and 115.0 MB in the end (delta: 63.5 MB). Peak memory consumption was 147.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 433]: 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)=24, \old(a11)=27, \old(a17)=14, \old(a19)=15, \old(a21)=18, \old(a25)=20, \old(a28)=28, \old(c)=16, \old(d)=22, \old(e)=13, \old(f)=21, \old(u)=25, \old(v)=12, \old(w)=23, \old(x)=17, \old(y)=26, \old(z)=19, 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=1, 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)=1, 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)=1, a=1, a11=0, a17=8, a19=1, 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)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, 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)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, 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)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, 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)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, 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 TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] return 26; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, 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=1, a28=11, c=3, d=4, e=5, f=6, input=1, output=26, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, 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)=1, \old(a28)=11, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L100] a17 = 7 [L101] a25 = 0 [L102] a11 = 1 [L103] a28 = 10 [L104] a19 = 0 [L105] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=1, \result=-1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=7, a19=0, a21=1, a25=0, a28=10, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=1, output=26, 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=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L432] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L433] __VERIFIER_error() VAL [\old(a11)=1, \old(a17)=7, \old(a19)=0, \old(a25)=0, \old(a28)=10, \old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, 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. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 217 SDtfs, 1198 SDslu, 127 SDs, 0 SdLazy, 1759 SolverSat, 363 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=757occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 563 NumberOfCodeBlocks, 563 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 107591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 54/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...