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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:41:23,427 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:41:23,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:41:23,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:41:23,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:41:23,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:41:23,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:41:23,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:41:23,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:41:23,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:41:23,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:41:23,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:41:23,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:41:23,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:41:23,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:41:23,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:41:23,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:41:23,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:41:23,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:41:23,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:41:23,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:41:23,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:41:23,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:41:23,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:41:23,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:41:23,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:41:23,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:41:23,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:41:23,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:41:23,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:41:23,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:41:23,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:41:23,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:41:23,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:41:23,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:41:23,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:41:23,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:41:23,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:41:23,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:41:23,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:41:23,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:41:23,519 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-13 21:41:23,538 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 21:41:23,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:41:23,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:41:23,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 21:41:23,541 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 21:41:23,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:41:23,541 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 21:41:23,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 21:41:23,542 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 21:41:23,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 21:41:23,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:41:23,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:41:23,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:41:23,544 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 21:41:23,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 21:41:23,544 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 21:41:23,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:41:23,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:41:23,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 21:41:23,545 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 21:41:23,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 21:41:23,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:41:23,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:41:23,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:41:23,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:41:23,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 21:41:23,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:41:23,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:41:23,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK
[2019-10-13 21:41:23,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:41:23,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:41:23,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:41:23,854 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 21:41:23,855 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 21:41:23,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c
[2019-10-13 21:41:23,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/716f0f4a7/72f476c5ecac4c23806b2a14a97fbdc8/FLAG6ed61b5e4
[2019-10-13 21:41:24,465 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 21:41:24,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label43.c
[2019-10-13 21:41:24,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/716f0f4a7/72f476c5ecac4c23806b2a14a97fbdc8/FLAG6ed61b5e4
[2019-10-13 21:41:24,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/716f0f4a7/72f476c5ecac4c23806b2a14a97fbdc8
[2019-10-13 21:41:24,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:41:24,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:41:24,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:41:24,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:41:24,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:41:24,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:24" (1/1) ...
[2019-10-13 21:41:24,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7e0ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:24, skipping insertion in model container
[2019-10-13 21:41:24,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:24" (1/1) ...
[2019-10-13 21:41:24,766 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 21:41:24,817 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:41:25,377 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:41:25,384 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 21:41:25,518 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:41:25,536 INFO L192 MainTranslator]: Completed translation
[2019-10-13 21:41:25,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25 WrapperNode
[2019-10-13 21:41:25,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:41:25,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:41:25,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:41:25,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:41:25,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (1/1) ...
[2019-10-13 21:41:25,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (1/1) ...
[2019-10-13 21:41:25,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (1/1) ...
[2019-10-13 21:41:25,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (1/1) ...
[2019-10-13 21:41:25,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (1/1) ...
[2019-10-13 21:41:25,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (1/1) ...
[2019-10-13 21:41:25,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (1/1) ...
[2019-10-13 21:41:25,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:41:25,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:41:25,700 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:41:25,700 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:41:25,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:41:25,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:41:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:41:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output
[2019-10-13 21:41:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:41:25,793 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output
[2019-10-13 21:41:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:41:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 21:41:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure exit
[2019-10-13 21:41:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:41:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:41:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:41:27,857 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:41:27,858 INFO L284 CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-13 21:41:27,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:27 BoogieIcfgContainer
[2019-10-13 21:41:27,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:41:27,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:41:27,861 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:41:27,864 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:41:27,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:41:24" (1/3) ...
[2019-10-13 21:41:27,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdeebad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:27, skipping insertion in model container
[2019-10-13 21:41:27,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:25" (2/3) ...
[2019-10-13 21:41:27,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdeebad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:27, skipping insertion in model container
[2019-10-13 21:41:27,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:27" (3/3) ...
[2019-10-13 21:41:27,869 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label43.c
[2019-10-13 21:41:27,879 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:41:27,889 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 21:41:27,901 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 21:41:27,933 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:41:27,933 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 21:41:27,934 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:41:27,935 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:41:27,935 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:41:27,935 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 21:41:27,935 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:41:27,935 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:41:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states.
[2019-10-13 21:41:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2019-10-13 21:41:27,984 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:41:27,985 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]
[2019-10-13 21:41:27,987 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:41:27,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:41:27,996 INFO L82 PathProgramCache]: Analyzing trace with hash -219456868, now seen corresponding path program 1 times
[2019-10-13 21:41:28,006 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:41:28,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662016240]
[2019-10-13 21:41:28,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:28,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:28,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:41:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:41:28,613 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-13 21:41:28,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662016240]
[2019-10-13 21:41:28,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:41:28,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:41:28,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206470702]
[2019-10-13 21:41:28,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:41:28,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:41:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:41:28,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:41:28,643 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states.
[2019-10-13 21:41:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:41:29,243 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions.
[2019-10-13 21:41:29,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:41:29,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86
[2019-10-13 21:41:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:41:29,277 INFO L225 Difference]: With dead ends: 273
[2019-10-13 21:41:29,277 INFO L226 Difference]: Without dead ends: 175
[2019-10-13 21:41:29,284 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-13 21:41:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2019-10-13 21:41:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175.
[2019-10-13 21:41:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states.
[2019-10-13 21:41:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 312 transitions.
[2019-10-13 21:41:29,404 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 312 transitions. Word has length 86
[2019-10-13 21:41:29,406 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:41:29,406 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 312 transitions.
[2019-10-13 21:41:29,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:41:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 312 transitions.
[2019-10-13 21:41:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2019-10-13 21:41:29,419 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:41:29,420 INFO L380 BasicCegarLoop]: trace histogram [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-13 21:41:29,420 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:41:29,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:41:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash -701991647, now seen corresponding path program 1 times
[2019-10-13 21:41:29,423 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:41:29,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265124168]
[2019-10-13 21:41:29,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:29,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:29,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:41:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:41:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:41:29,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265124168]
[2019-10-13 21:41:29,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:41:29,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:41:29,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015060332]
[2019-10-13 21:41:29,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:41:29,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:41:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:41:29,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:41:29,639 INFO L87 Difference]: Start difference. First operand 175 states and 312 transitions. Second operand 5 states.
[2019-10-13 21:41:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:41:30,329 INFO L93 Difference]: Finished difference Result 541 states and 993 transitions.
[2019-10-13 21:41:30,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2019-10-13 21:41:30,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94
[2019-10-13 21:41:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:41:30,335 INFO L225 Difference]: With dead ends: 541
[2019-10-13 21:41:30,335 INFO L226 Difference]: Without dead ends: 371
[2019-10-13 21:41:30,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2019-10-13 21:41:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2019-10-13 21:41:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 355.
[2019-10-13 21:41:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states.
[2019-10-13 21:41:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 586 transitions.
[2019-10-13 21:41:30,395 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 586 transitions. Word has length 94
[2019-10-13 21:41:30,395 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:41:30,395 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 586 transitions.
[2019-10-13 21:41:30,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:41:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 586 transitions.
[2019-10-13 21:41:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2019-10-13 21:41:30,402 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:41:30,403 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]
[2019-10-13 21:41:30,403 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:41:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:41:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash -852483956, now seen corresponding path program 1 times
[2019-10-13 21:41:30,404 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:41:30,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627910246]
[2019-10-13 21:41:30,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:30,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:30,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:41:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:41:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:41:30,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627910246]
[2019-10-13 21:41:30,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388073725]
[2019-10-13 21:41:30,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:41:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:41:30,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjunts are in the unsatisfiable core
[2019-10-13 21:41:30,753 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:41:30,840 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-13 21:41:30,840 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:41:30,906 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-13 21:41:30,907 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences.
[2019-10-13 21:41:30,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8
[2019-10-13 21:41:30,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013839795]
[2019-10-13 21:41:30,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:41:30,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:41:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:41:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2019-10-13 21:41:30,910 INFO L87 Difference]: Start difference. First operand 355 states and 586 transitions. Second operand 3 states.
[2019-10-13 21:41:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:41:31,398 INFO L93 Difference]: Finished difference Result 1047 states and 1764 transitions.
[2019-10-13 21:41:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:41:31,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112
[2019-10-13 21:41:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:41:31,406 INFO L225 Difference]: With dead ends: 1047
[2019-10-13 21:41:31,407 INFO L226 Difference]: Without dead ends: 355
[2019-10-13 21:41:31,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2019-10-13 21:41:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states.
[2019-10-13 21:41:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355.
[2019-10-13 21:41:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states.
[2019-10-13 21:41:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions.
[2019-10-13 21:41:31,440 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 112
[2019-10-13 21:41:31,440 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:41:31,440 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions.
[2019-10-13 21:41:31,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:41:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions.
[2019-10-13 21:41:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2019-10-13 21:41:31,443 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:41:31,443 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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]
[2019-10-13 21:41:31,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:41:31,678 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:41:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:41:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1701711027, now seen corresponding path program 1 times
[2019-10-13 21:41:31,679 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:41:31,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409744184]
[2019-10-13 21:41:31,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:31,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:31,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:41:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:41:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:41:31,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409744184]
[2019-10-13 21:41:31,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468570538]
[2019-10-13 21:41:31,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:41:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:41:31,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 11 conjunts are in the unsatisfiable core
[2019-10-13 21:41:31,838 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:41:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2019-10-13 21:41:31,881 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:41:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2019-10-13 21:41:31,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences.
[2019-10-13 21:41:31,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9
[2019-10-13 21:41:31,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250535118]
[2019-10-13 21:41:31,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:41:31,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:41:31,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:41:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2019-10-13 21:41:31,949 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 5 states.
[2019-10-13 21:41:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:41:32,526 INFO L93 Difference]: Finished difference Result 1091 states and 1791 transitions.
[2019-10-13 21:41:32,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 21:41:32,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113
[2019-10-13 21:41:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:41:32,534 INFO L225 Difference]: With dead ends: 1091
[2019-10-13 21:41:32,534 INFO L226 Difference]: Without dead ends: 741
[2019-10-13 21:41:32,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2019-10-13 21:41:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states.
[2019-10-13 21:41:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 725.
[2019-10-13 21:41:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states.
[2019-10-13 21:41:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1099 transitions.
[2019-10-13 21:41:32,596 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1099 transitions. Word has length 113
[2019-10-13 21:41:32,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:41:32,596 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 1099 transitions.
[2019-10-13 21:41:32,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:41:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1099 transitions.
[2019-10-13 21:41:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2019-10-13 21:41:32,603 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:41:32,603 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, 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]
[2019-10-13 21:41:32,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:41:32,808 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:41:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:41:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash -958608322, now seen corresponding path program 1 times
[2019-10-13 21:41:32,809 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:41:32,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592842304]
[2019-10-13 21:41:32,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:32,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:32,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:41:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:41:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:41:32,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592842304]
[2019-10-13 21:41:32,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:41:32,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-10-13 21:41:32,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5689012]
[2019-10-13 21:41:32,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-10-13 21:41:32,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:41:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-10-13 21:41:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:41:32,965 INFO L87 Difference]: Start difference. First operand 725 states and 1099 transitions. Second operand 6 states.
[2019-10-13 21:41:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:41:33,591 INFO L93 Difference]: Finished difference Result 1729 states and 2773 transitions.
[2019-10-13 21:41:33,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2019-10-13 21:41:33,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119
[2019-10-13 21:41:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:41:33,601 INFO L225 Difference]: With dead ends: 1729
[2019-10-13 21:41:33,602 INFO L226 Difference]: Without dead ends: 1009
[2019-10-13 21:41:33,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-10-13 21:41:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states.
[2019-10-13 21:41:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 997.
[2019-10-13 21:41:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states.
[2019-10-13 21:41:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1577 transitions.
[2019-10-13 21:41:33,656 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1577 transitions. Word has length 119
[2019-10-13 21:41:33,656 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:41:33,656 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1577 transitions.
[2019-10-13 21:41:33,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-10-13 21:41:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1577 transitions.
[2019-10-13 21:41:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2019-10-13 21:41:33,661 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:41:33,661 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, 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]
[2019-10-13 21:41:33,661 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:41:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:41:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1298754460, now seen corresponding path program 1 times
[2019-10-13 21:41:33,662 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:41:33,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647487085]
[2019-10-13 21:41:33,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:33,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:33,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:41:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:41:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:41:33,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647487085]
[2019-10-13 21:41:33,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:41:33,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:41:33,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935703927]
[2019-10-13 21:41:33,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:41:33,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:41:33,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:41:33,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:41:33,758 INFO L87 Difference]: Start difference. First operand 997 states and 1577 transitions. Second operand 3 states.
[2019-10-13 21:41:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:41:34,240 INFO L93 Difference]: Finished difference Result 2507 states and 4019 transitions.
[2019-10-13 21:41:34,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:41:34,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120
[2019-10-13 21:41:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:41:34,262 INFO L225 Difference]: With dead ends: 2507
[2019-10-13 21:41:34,262 INFO L226 Difference]: Without dead ends: 1515
[2019-10-13 21:41:34,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-13 21:41:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states.
[2019-10-13 21:41:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515.
[2019-10-13 21:41:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states.
[2019-10-13 21:41:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2318 transitions.
[2019-10-13 21:41:34,340 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2318 transitions. Word has length 120
[2019-10-13 21:41:34,340 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:41:34,340 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2318 transitions.
[2019-10-13 21:41:34,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:41:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2318 transitions.
[2019-10-13 21:41:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2019-10-13 21:41:34,347 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:41:34,348 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:41:34,348 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:41:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:41:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1577420321, now seen corresponding path program 1 times
[2019-10-13 21:41:34,349 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:41:34,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606707386]
[2019-10-13 21:41:34,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:34,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:41:34,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:41:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-10-13 21:41:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-10-13 21:41:34,490 INFO L168 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2019-10-13 21:41:34,491 INFO L445 BasicCegarLoop]: Counterexample might be feasible
[2019-10-13 21:41:34,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:41:34 BoogieIcfgContainer
[2019-10-13 21:41:34,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:41:34,611 INFO L168 Benchmark]: Toolchain (without parser) took 9856.76 ms. Allocated memory was 138.4 MB in the beginning and 330.3 MB in the end (delta: 191.9 MB). Free memory was 100.9 MB in the beginning and 205.1 MB in the end (delta: -104.2 MB). Peak memory consumption was 87.7 MB. Max. memory is 7.1 GB.
[2019-10-13 21:41:34,612 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 21:41:34,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.53 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 100.7 MB in the beginning and 172.3 MB in the end (delta: -71.7 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB.
[2019-10-13 21:41:34,618 INFO L168 Benchmark]: Boogie Preprocessor took 161.92 ms. Allocated memory is still 205.0 MB. Free memory was 172.3 MB in the beginning and 167.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB.
[2019-10-13 21:41:34,619 INFO L168 Benchmark]: RCFGBuilder took 2159.98 ms. Allocated memory was 205.0 MB in the beginning and 251.1 MB in the end (delta: 46.1 MB). Free memory was 166.7 MB in the beginning and 201.3 MB in the end (delta: -34.6 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB.
[2019-10-13 21:41:34,622 INFO L168 Benchmark]: TraceAbstraction took 6743.08 ms. Allocated memory was 251.1 MB in the beginning and 330.3 MB in the end (delta: 79.2 MB). Free memory was 201.3 MB in the beginning and 205.1 MB in the end (delta: -3.8 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB.
[2019-10-13 21:41:34,633 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 786.53 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 100.7 MB in the beginning and 172.3 MB in the end (delta: -71.7 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 161.92 ms. Allocated memory is still 205.0 MB. Free memory was 172.3 MB in the beginning and 167.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 2159.98 ms. Allocated memory was 205.0 MB in the beginning and 251.1 MB in the end (delta: 46.1 MB). Free memory was 166.7 MB in the beginning and 201.3 MB in the end (delta: -34.6 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 6743.08 ms. Allocated memory was 251.1 MB in the beginning and 330.3 MB in the end (delta: 79.2 MB). Free memory was 201.3 MB in the beginning and 205.1 MB in the end (delta: -3.8 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 427]: 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;
[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=3, 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)=3, 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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[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)=3, a=1, a11=0, a17=8, a19=1, 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]
[L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))
[L166] a25 = 1
[L167] a28 = 9
[L168] return 26;
VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, 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=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=3, 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=9, c=3, d=4, e=5, f=6, input=4, 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)=9, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L30] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))
[L31] a28 = 9
[L32] a11 = 1
[L33] a25 = 1
[L34] return -1;
VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=4, 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=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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 FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)))
VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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)))))
[L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)))
[L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)))
[L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)))
[L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7)))
VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L426] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))
VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L427] __VERIFIER_error()
VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 95 locations, 1 error locations. Result: UNSAFE, OverallTime: 6.6s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 329 SDtfs, 939 SDslu, 140 SDs, 0 SdLazy, 2002 SolverSat, 543 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 459 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1515occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 44 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 997 NumberOfCodeBlocks, 997 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1084 ConstructedInterpolants, 0 QuantifiedInterpolants, 302293 SizeOfPredicates, 3 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 211/222 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...