java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label58_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 13:59:05,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 13:59:05,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 13:59:05,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 13:59:05,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 13:59:05,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 13:59:05,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 13:59:05,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 13:59:05,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 13:59:05,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 13:59:05,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 13:59:05,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 13:59:05,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 13:59:05,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 13:59:05,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 13:59:05,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 13:59:05,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 13:59:05,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 13:59:05,352 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 13:59:05,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 13:59:05,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 13:59:05,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 13:59:05,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 13:59:05,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 13:59:05,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 13:59:05,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 13:59:05,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 13:59:05,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 13:59:05,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 13:59:05,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 13:59:05,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 13:59:05,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 13:59:05,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 13:59:05,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 13:59:05,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 13:59:05,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 13:59:05,368 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 13:59:05,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 13:59:05,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 13:59:05,399 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 13:59:05,400 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 13:59:05,400 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 13:59:05,400 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 13:59:05,401 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 13:59:05,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 13:59:05,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 13:59:05,401 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 13:59:05,401 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 13:59:05,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 13:59:05,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 13:59:05,402 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 13:59:05,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 13:59:05,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 13:59:05,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 13:59:05,404 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 13:59:05,404 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 13:59:05,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:59:05,404 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 13:59:05,404 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 13:59:05,405 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 13:59:05,406 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 13:59:05,406 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 13:59:05,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 13:59:05,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 13:59:05,407 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 13:59:05,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 13:59:05,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 13:59:05,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 13:59:05,493 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 13:59:05,494 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 13:59:05,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label58_false-unreach-call.c [2018-10-24 13:59:05,572 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/337131f86/f89553f6101344728121ad6c98d5c50a/FLAGc374e909c [2018-10-24 13:59:06,183 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 13:59:06,184 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label58_false-unreach-call.c [2018-10-24 13:59:06,207 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/337131f86/f89553f6101344728121ad6c98d5c50a/FLAGc374e909c [2018-10-24 13:59:06,229 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/337131f86/f89553f6101344728121ad6c98d5c50a [2018-10-24 13:59:06,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 13:59:06,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 13:59:06,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 13:59:06,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 13:59:06,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 13:59:06,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:06,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec89115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06, skipping insertion in model container [2018-10-24 13:59:06,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:06,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 13:59:06,318 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 13:59:06,819 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:59:06,825 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 13:59:06,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:59:06,951 INFO L193 MainTranslator]: Completed translation [2018-10-24 13:59:06,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06 WrapperNode [2018-10-24 13:59:06,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 13:59:06,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 13:59:06,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 13:59:06,953 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 13:59:06,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:06,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:07,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 13:59:07,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 13:59:07,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 13:59:07,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 13:59:07,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:07,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:07,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:07,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:07,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:07,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:07,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... [2018-10-24 13:59:07,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 13:59:07,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 13:59:07,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 13:59:07,296 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 13:59:07,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:59:07,372 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 13:59:07,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 13:59:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 13:59:10,606 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 13:59:10,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:59:10 BoogieIcfgContainer [2018-10-24 13:59:10,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 13:59:10,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 13:59:10,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 13:59:10,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 13:59:10,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:59:06" (1/3) ... [2018-10-24 13:59:10,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccefdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:59:10, skipping insertion in model container [2018-10-24 13:59:10,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:59:06" (2/3) ... [2018-10-24 13:59:10,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccefdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:59:10, skipping insertion in model container [2018-10-24 13:59:10,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:59:10" (3/3) ... [2018-10-24 13:59:10,616 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label58_false-unreach-call.c [2018-10-24 13:59:10,624 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 13:59:10,634 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 13:59:10,653 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 13:59:10,690 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 13:59:10,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 13:59:10,691 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 13:59:10,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 13:59:10,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 13:59:10,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 13:59:10,692 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 13:59:10,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 13:59:10,693 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 13:59:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-10-24 13:59:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 13:59:10,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:10,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:59:10,727 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:10,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash 340357962, now seen corresponding path program 1 times [2018-10-24 13:59:10,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:10,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:10,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:10,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:59:11,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:59:11,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:59:11,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:59:11,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:59:11,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:59:11,138 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 4 states. [2018-10-24 13:59:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:14,161 INFO L93 Difference]: Finished difference Result 698 states and 1250 transitions. [2018-10-24 13:59:14,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:59:14,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-24 13:59:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:14,187 INFO L225 Difference]: With dead ends: 698 [2018-10-24 13:59:14,188 INFO L226 Difference]: Without dead ends: 484 [2018-10-24 13:59:14,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:59:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-24 13:59:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2018-10-24 13:59:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-24 13:59:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 811 transitions. [2018-10-24 13:59:14,273 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 811 transitions. Word has length 14 [2018-10-24 13:59:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:14,273 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 811 transitions. [2018-10-24 13:59:14,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:59:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 811 transitions. [2018-10-24 13:59:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-24 13:59:14,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:14,277 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 13:59:14,278 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:14,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2024230611, now seen corresponding path program 1 times [2018-10-24 13:59:14,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:14,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:59:14,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:59:14,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:59:14,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:59:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:59:14,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:59:14,562 INFO L87 Difference]: Start difference. First operand 484 states and 811 transitions. Second operand 4 states. [2018-10-24 13:59:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:16,086 INFO L93 Difference]: Finished difference Result 1106 states and 1836 transitions. [2018-10-24 13:59:16,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:59:16,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-10-24 13:59:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:16,092 INFO L225 Difference]: With dead ends: 1106 [2018-10-24 13:59:16,092 INFO L226 Difference]: Without dead ends: 624 [2018-10-24 13:59:16,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:59:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-24 13:59:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2018-10-24 13:59:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-24 13:59:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 952 transitions. [2018-10-24 13:59:16,126 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 952 transitions. Word has length 84 [2018-10-24 13:59:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:16,127 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 952 transitions. [2018-10-24 13:59:16,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:59:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 952 transitions. [2018-10-24 13:59:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-24 13:59:16,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:16,131 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:59:16,131 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:16,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:16,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1166373660, now seen corresponding path program 1 times [2018-10-24 13:59:16,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:16,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:16,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:16,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:16,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:59:16,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:59:16,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:59:16,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:59:16,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:59:16,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:59:16,293 INFO L87 Difference]: Start difference. First operand 624 states and 952 transitions. Second operand 4 states. [2018-10-24 13:59:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:20,263 INFO L93 Difference]: Finished difference Result 2086 states and 3248 transitions. [2018-10-24 13:59:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:59:20,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-24 13:59:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:20,274 INFO L225 Difference]: With dead ends: 2086 [2018-10-24 13:59:20,274 INFO L226 Difference]: Without dead ends: 1464 [2018-10-24 13:59:20,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:59:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2018-10-24 13:59:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2018-10-24 13:59:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-10-24 13:59:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2068 transitions. [2018-10-24 13:59:20,321 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2068 transitions. Word has length 90 [2018-10-24 13:59:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:20,322 INFO L481 AbstractCegarLoop]: Abstraction has 1464 states and 2068 transitions. [2018-10-24 13:59:20,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:59:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2068 transitions. [2018-10-24 13:59:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-24 13:59:20,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:20,331 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:59:20,332 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:20,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1364319465, now seen corresponding path program 1 times [2018-10-24 13:59:20,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:20,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:20,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:20,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:20,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:59:20,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:59:20,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:59:20,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:59:20,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:59:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:59:20,617 INFO L87 Difference]: Start difference. First operand 1464 states and 2068 transitions. Second operand 4 states. [2018-10-24 13:59:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:22,132 INFO L93 Difference]: Finished difference Result 3486 states and 4843 transitions. [2018-10-24 13:59:22,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:59:22,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-10-24 13:59:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:22,146 INFO L225 Difference]: With dead ends: 3486 [2018-10-24 13:59:22,146 INFO L226 Difference]: Without dead ends: 2024 [2018-10-24 13:59:22,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:59:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2018-10-24 13:59:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2024. [2018-10-24 13:59:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2018-10-24 13:59:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2602 transitions. [2018-10-24 13:59:22,184 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2602 transitions. Word has length 152 [2018-10-24 13:59:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:22,184 INFO L481 AbstractCegarLoop]: Abstraction has 2024 states and 2602 transitions. [2018-10-24 13:59:22,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:59:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2602 transitions. [2018-10-24 13:59:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-24 13:59:22,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:22,189 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:59:22,189 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:22,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2133894271, now seen corresponding path program 1 times [2018-10-24 13:59:22,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:22,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:22,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:22,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:22,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:22,623 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-10-24 13:59:22,909 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 13:59:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 13:59:22,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:59:22,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:59:22,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:59:22,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:59:22,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:59:22,969 INFO L87 Difference]: Start difference. First operand 2024 states and 2602 transitions. Second operand 5 states. [2018-10-24 13:59:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:24,952 INFO L93 Difference]: Finished difference Result 7561 states and 9822 transitions. [2018-10-24 13:59:24,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:59:24,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-10-24 13:59:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:24,979 INFO L225 Difference]: With dead ends: 7561 [2018-10-24 13:59:24,979 INFO L226 Difference]: Without dead ends: 5539 [2018-10-24 13:59:24,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:59:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5539 states. [2018-10-24 13:59:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5539 to 3984. [2018-10-24 13:59:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3984 states. [2018-10-24 13:59:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4887 transitions. [2018-10-24 13:59:25,071 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4887 transitions. Word has length 185 [2018-10-24 13:59:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:25,072 INFO L481 AbstractCegarLoop]: Abstraction has 3984 states and 4887 transitions. [2018-10-24 13:59:25,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:59:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4887 transitions. [2018-10-24 13:59:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-24 13:59:25,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:25,080 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:59:25,080 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:25,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2141167107, now seen corresponding path program 1 times [2018-10-24 13:59:25,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:25,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:25,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:59:25,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:59:25,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 13:59:25,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:59:25,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:59:25,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:59:25,568 INFO L87 Difference]: Start difference. First operand 3984 states and 4887 transitions. Second operand 5 states. [2018-10-24 13:59:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:32,132 INFO L93 Difference]: Finished difference Result 7826 states and 9627 transitions. [2018-10-24 13:59:32,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:59:32,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-10-24 13:59:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:32,142 INFO L225 Difference]: With dead ends: 7826 [2018-10-24 13:59:32,142 INFO L226 Difference]: Without dead ends: 1826 [2018-10-24 13:59:32,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:59:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-10-24 13:59:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1686. [2018-10-24 13:59:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2018-10-24 13:59:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 1866 transitions. [2018-10-24 13:59:32,175 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 1866 transitions. Word has length 228 [2018-10-24 13:59:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:32,176 INFO L481 AbstractCegarLoop]: Abstraction has 1686 states and 1866 transitions. [2018-10-24 13:59:32,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:59:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 1866 transitions. [2018-10-24 13:59:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-24 13:59:32,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:32,181 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:59:32,181 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:32,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1431787954, now seen corresponding path program 1 times [2018-10-24 13:59:32,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:32,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:32,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:32,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:32,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 175 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 13:59:32,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:59:32,820 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:59:32,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:32,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:59:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 13:59:33,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:59:33,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 13:59:33,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 13:59:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 13:59:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-24 13:59:33,128 INFO L87 Difference]: Start difference. First operand 1686 states and 1866 transitions. Second operand 11 states. [2018-10-24 13:59:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:41,219 INFO L93 Difference]: Finished difference Result 3768 states and 4175 transitions. [2018-10-24 13:59:41,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 13:59:41,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 252 [2018-10-24 13:59:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:41,234 INFO L225 Difference]: With dead ends: 3768 [2018-10-24 13:59:41,235 INFO L226 Difference]: Without dead ends: 2224 [2018-10-24 13:59:41,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-24 13:59:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2018-10-24 13:59:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1846. [2018-10-24 13:59:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2018-10-24 13:59:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2011 transitions. [2018-10-24 13:59:41,274 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2011 transitions. Word has length 252 [2018-10-24 13:59:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:41,275 INFO L481 AbstractCegarLoop]: Abstraction has 1846 states and 2011 transitions. [2018-10-24 13:59:41,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 13:59:41,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2011 transitions. [2018-10-24 13:59:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-24 13:59:41,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:41,280 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:59:41,280 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:41,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1886131945, now seen corresponding path program 1 times [2018-10-24 13:59:41,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:41,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:41,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 12 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:59:41,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:59:41,878 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:59:41,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:41,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:59:42,401 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-10-24 13:59:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 12 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:59:42,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 13:59:42,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-10-24 13:59:42,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 13:59:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 13:59:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 13:59:42,624 INFO L87 Difference]: Start difference. First operand 1846 states and 2011 transitions. Second operand 7 states. [2018-10-24 13:59:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:48,544 INFO L93 Difference]: Finished difference Result 6234 states and 6805 transitions. [2018-10-24 13:59:48,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 13:59:48,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2018-10-24 13:59:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:48,560 INFO L225 Difference]: With dead ends: 6234 [2018-10-24 13:59:48,560 INFO L226 Difference]: Without dead ends: 4248 [2018-10-24 13:59:48,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 13:59:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2018-10-24 13:59:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 2986. [2018-10-24 13:59:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2018-10-24 13:59:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3269 transitions. [2018-10-24 13:59:48,624 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3269 transitions. Word has length 264 [2018-10-24 13:59:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:48,624 INFO L481 AbstractCegarLoop]: Abstraction has 2986 states and 3269 transitions. [2018-10-24 13:59:48,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 13:59:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3269 transitions. [2018-10-24 13:59:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-24 13:59:48,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:48,632 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:59:48,632 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:48,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1573235327, now seen corresponding path program 1 times [2018-10-24 13:59:48,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:48,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:48,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:49,242 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-24 13:59:49,569 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-10-24 13:59:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 198 proven. 78 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 13:59:49,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:59:49,695 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:59:49,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:49,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:59:50,144 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-10-24 13:59:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 211 proven. 65 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 13:59:50,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 13:59:50,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-24 13:59:50,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 13:59:50,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 13:59:50,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-24 13:59:50,794 INFO L87 Difference]: Start difference. First operand 2986 states and 3269 transitions. Second operand 10 states. [2018-10-24 13:59:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:59:55,156 INFO L93 Difference]: Finished difference Result 7906 states and 8683 transitions. [2018-10-24 13:59:55,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 13:59:55,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2018-10-24 13:59:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:59:55,178 INFO L225 Difference]: With dead ends: 7906 [2018-10-24 13:59:55,179 INFO L226 Difference]: Without dead ends: 5062 [2018-10-24 13:59:55,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2018-10-24 13:59:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2018-10-24 13:59:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 4246. [2018-10-24 13:59:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4246 states. [2018-10-24 13:59:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 4586 transitions. [2018-10-24 13:59:55,266 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 4586 transitions. Word has length 297 [2018-10-24 13:59:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:59:55,267 INFO L481 AbstractCegarLoop]: Abstraction has 4246 states and 4586 transitions. [2018-10-24 13:59:55,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 13:59:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 4586 transitions. [2018-10-24 13:59:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-24 13:59:55,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:59:55,275 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:59:55,275 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:59:55,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:59:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash 714651218, now seen corresponding path program 1 times [2018-10-24 13:59:55,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:59:55,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:59:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:55,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:55,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:59:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 39 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:59:55,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:59:55,838 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:59:55,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:59:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:59:55,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:59:56,417 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-24 13:59:58,555 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_94 Int)) (let ((.cse1 (* 9 v_prenex_94))) (let ((.cse2 (div .cse1 10))) (let ((.cse0 (mod .cse2 299993))) (and (= 0 (mod (+ .cse0 2) 5)) (<= 0 .cse1) (<= 518104 v_prenex_94) (< 218 v_prenex_94) (<= 0 .cse2) (<= (+ c_~a1~0 75819) (div (+ .cse0 (- 300005)) 5)) (= 0 (mod .cse0 5))))))) (exists ((v_prenex_91 Int)) (let ((.cse4 (* 9 v_prenex_91))) (let ((.cse5 (+ (div .cse4 10) 1))) (let ((.cse3 (mod .cse5 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse3 (- 599998)) 5)) (<= 518104 v_prenex_91) (= 0 (mod .cse3 5)) (not (= 0 (mod (+ .cse3 2) 5))) (not (= (mod .cse4 10) 0)) (< 218 v_prenex_91) (< .cse5 0) (< .cse4 0) (not (= 0 .cse3)) (< .cse3 599998)))))) (exists ((v_prenex_82 Int)) (let ((.cse7 (* 9 v_prenex_82))) (let ((.cse8 (+ (div .cse7 10) 1))) (let ((.cse6 (mod .cse8 299993))) (and (= 0 (mod .cse6 5)) (< .cse7 0) (< 218 v_prenex_82) (<= (+ c_~a1~0 75819) (div (+ .cse6 (- 599998)) 5)) (not (= 0 .cse6)) (<= 518104 v_prenex_82) (< .cse8 0) (= 0 (mod (+ .cse6 2) 5)) (not (= (mod .cse7 10) 0))))))) (exists ((v_prenex_67 Int)) (let ((.cse10 (* 9 v_prenex_67))) (let ((.cse9 (mod (div .cse10 10) 299993))) (and (<= 300005 .cse9) (<= 518104 v_prenex_67) (< 218 v_prenex_67) (= 0 (mod (+ .cse9 2) 5)) (= .cse9 0) (= (mod .cse10 10) 0) (<= (+ c_~a1~0 75819) (div (+ .cse9 (- 300005)) 5)))))) (exists ((v_prenex_73 Int)) (let ((.cse12 (* 9 v_prenex_73))) (let ((.cse13 (+ (div .cse12 10) 1))) (let ((.cse11 (mod .cse13 299993))) (and (<= (+ c_~a1~0 75819) (div (+ .cse11 (- 300005)) 5)) (< 218 v_prenex_73) (not (= (mod .cse12 10) 0)) (<= 300005 .cse11) (= 0 (mod (+ .cse11 2) 5)) (< .cse12 0) (<= 518104 v_prenex_73) (<= 0 .cse13)))))) (exists ((v_prenex_61 Int)) (let ((.cse15 (* 9 v_prenex_61))) (let ((.cse14 (mod (div .cse15 10) 299993))) (and (< 218 v_prenex_61) (= 0 (mod .cse14 5)) (<= 518104 v_prenex_61) (<= 0 .cse15) (= .cse14 0) (<= 599998 .cse14) (<= (+ c_~a1~0 75819) (div (+ .cse14 (- 300005)) 5)))))) (exists ((v_prenex_25 Int)) (let ((.cse17 (* 9 v_prenex_25))) (let ((.cse18 (div .cse17 10))) (let ((.cse16 (mod .cse18 299993))) (and (not (= 0 (mod (+ .cse16 2) 5))) (< 218 v_prenex_25) (= (mod .cse17 10) 0) (<= (+ c_~a1~0 75819) (div (+ .cse16 (- 300005)) 5)) (<= 0 .cse18) (<= 300005 .cse16) (< .cse16 599998) (<= 518104 v_prenex_25)))))) (exists ((v_prenex_57 Int)) (let ((.cse20 (* 9 v_prenex_57))) (let ((.cse21 (div .cse20 10))) (let ((.cse19 (mod .cse21 299993))) (and (= 0 (mod (+ .cse19 2) 5)) (<= 0 .cse20) (= 0 (mod .cse19 5)) (<= (+ c_~a1~0 75819) (div (+ .cse19 (- 599998)) 5)) (< 218 v_prenex_57) (not (= .cse19 0)) (< .cse21 0) (<= 518104 v_prenex_57)))))) (exists ((v_prenex_72 Int)) (let ((.cse23 (* 9 v_prenex_72))) (let ((.cse22 (mod (+ (div .cse23 10) 1) 299993))) (and (<= 300005 .cse22) (< .cse23 0) (< 218 v_prenex_72) (not (= (mod .cse23 10) 0)) (<= (+ c_~a1~0 75819) (div (+ .cse22 (- 300005)) 5)) (= 0 (mod (+ .cse22 2) 5)) (<= 518104 v_prenex_72) (= 0 .cse22))))) (exists ((v_prenex_21 Int)) (let ((.cse25 (* 9 v_prenex_21))) (let ((.cse24 (mod (div .cse25 10) 299993))) (and (= 0 (mod (+ .cse24 2) 5)) (= .cse24 0) (<= (+ c_~a1~0 75819) (div (+ .cse24 (- 300005)) 5)) (= 0 (mod .cse24 5)) (<= 518104 v_prenex_21) (= (mod .cse25 10) 0) (< 218 v_prenex_21))))) (exists ((v_prenex_47 Int)) (let ((.cse28 (* 9 v_prenex_47))) (let ((.cse27 (div .cse28 10))) (let ((.cse26 (mod .cse27 299993))) (and (<= 518104 v_prenex_47) (<= (+ c_~a1~0 75818) (div (+ .cse26 (- 599998)) 5)) (< .cse26 599998) (= 0 (mod .cse26 5)) (not (= 0 (mod (+ .cse26 2) 5))) (< .cse27 0) (not (= .cse26 0)) (< 218 v_prenex_47) (= (mod .cse28 10) 0)))))) (exists ((v_prenex_64 Int)) (let ((.cse30 (* 9 v_prenex_64))) (let ((.cse31 (+ (div .cse30 10) 1))) (let ((.cse29 (mod .cse31 299993))) (and (<= 518104 v_prenex_64) (not (= 0 (mod (+ .cse29 2) 5))) (< .cse30 0) (< 218 v_prenex_64) (<= (+ c_~a1~0 75818) (div (+ .cse29 (- 599998)) 5)) (not (= 0 (mod .cse29 5))) (< .cse31 0) (not (= (mod .cse30 10) 0)) (< .cse29 300005) (< .cse29 599998) (not (= 0 .cse29))))))) (exists ((v_prenex_27 Int)) (let ((.cse33 (* 9 v_prenex_27))) (let ((.cse32 (mod (div .cse33 10) 299993))) (and (<= 518104 v_prenex_27) (= .cse32 0) (<= 0 .cse33) (<= (+ c_~a1~0 75819) (div (+ .cse32 (- 300005)) 5)) (< 218 v_prenex_27) (= 0 (mod (+ .cse32 2) 5)) (<= 300005 .cse32))))) (exists ((v_prenex_97 Int)) (let ((.cse34 (* 9 v_prenex_97))) (let ((.cse36 (div .cse34 10))) (let ((.cse35 (mod .cse36 299993))) (and (<= 518104 v_prenex_97) (= (mod .cse34 10) 0) (<= 300005 .cse35) (< 218 v_prenex_97) (<= 0 .cse36) (<= 599998 .cse35) (<= (+ c_~a1~0 75819) (div (+ .cse35 (- 300005)) 5))))))) (exists ((v_prenex_68 Int)) (let ((.cse38 (* 9 v_prenex_68))) (let ((.cse39 (+ (div .cse38 10) 1))) (let ((.cse37 (mod .cse39 299993))) (and (< .cse37 300005) (< .cse38 0) (< 218 v_prenex_68) (not (= 0 (mod .cse37 5))) (not (= (mod .cse38 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse37 (- 300005)) 5)) (<= 0 .cse39) (< .cse37 599998) (not (= 0 (mod (+ .cse37 2) 5))) (<= 518104 v_prenex_68)))))) (exists ((v_prenex_88 Int)) (let ((.cse41 (* 9 v_prenex_88))) (let ((.cse40 (mod (div .cse41 10) 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse40 (- 300005)) 5)) (= .cse40 0) (= (mod .cse41 10) 0) (< 218 v_prenex_88) (< .cse40 300005) (<= 518104 v_prenex_88) (not (= 0 (mod .cse40 5))) (<= 599998 .cse40))))) (exists ((v_prenex_36 Int)) (let ((.cse43 (* 9 v_prenex_36))) (let ((.cse42 (mod (+ (div .cse43 10) 1) 299993))) (and (<= 300005 .cse42) (= 0 .cse42) (<= (+ c_~a1~0 75819) (div (+ .cse42 (- 300005)) 5)) (< .cse43 0) (<= 599998 .cse42) (not (= (mod .cse43 10) 0)) (<= 518104 v_prenex_36) (< 218 v_prenex_36))))) (exists ((v_prenex_52 Int)) (let ((.cse45 (* 9 v_prenex_52))) (let ((.cse44 (mod (+ (div .cse45 10) 1) 299993))) (and (< .cse44 599998) (not (= (mod .cse45 10) 0)) (<= 518104 v_prenex_52) (not (= 0 (mod (+ .cse44 2) 5))) (<= 300005 .cse44) (<= (+ c_~a1~0 75819) (div (+ .cse44 (- 300005)) 5)) (< .cse45 0) (= 0 .cse44) (< 218 v_prenex_52))))) (exists ((v_~a1~0_345 Int)) (let ((.cse47 (* 9 v_~a1~0_345))) (let ((.cse48 (+ (div .cse47 10) 1))) (let ((.cse46 (mod .cse48 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse46 (- 300005)) 5)) (<= 518104 v_~a1~0_345) (<= 599998 .cse46) (not (= 0 (mod .cse46 5))) (not (= (mod .cse47 10) 0)) (< .cse46 300005) (< .cse47 0) (< 218 v_~a1~0_345) (<= 0 .cse48)))))) (exists ((v_prenex_79 Int)) (let ((.cse50 (* 9 v_prenex_79))) (let ((.cse49 (mod (div .cse50 10) 299993))) (and (<= 518104 v_prenex_79) (<= (+ c_~a1~0 75818) (div (+ .cse49 (- 300005)) 5)) (< .cse49 300005) (< 218 v_prenex_79) (<= 0 .cse50) (not (= 0 (mod .cse49 5))) (= 0 (mod (+ .cse49 2) 5)) (= .cse49 0))))) (exists ((v_prenex_84 Int)) (let ((.cse52 (* 9 v_prenex_84))) (let ((.cse53 (div .cse52 10))) (let ((.cse51 (mod .cse53 299993))) (and (< .cse51 599998) (< 218 v_prenex_84) (<= (+ c_~a1~0 75819) (div (+ .cse51 (- 300005)) 5)) (<= 518104 v_prenex_84) (= (mod .cse52 10) 0) (<= 0 .cse53) (= 0 (mod .cse51 5)) (not (= 0 (mod (+ .cse51 2) 5)))))))) (exists ((v_prenex_24 Int)) (let ((.cse56 (* 9 v_prenex_24))) (let ((.cse55 (div .cse56 10))) (let ((.cse54 (mod .cse55 299993))) (and (not (= 0 (mod (+ .cse54 2) 5))) (<= 300005 .cse54) (< .cse55 0) (< 218 v_prenex_24) (<= 518104 v_prenex_24) (not (= .cse54 0)) (<= 0 .cse56) (< .cse54 599998) (<= (+ c_~a1~0 75818) (div (+ .cse54 (- 599998)) 5))))))) (exists ((v_prenex_58 Int)) (let ((.cse57 (* 9 v_prenex_58))) (let ((.cse58 (div .cse57 10))) (let ((.cse59 (mod .cse58 299993))) (and (= (mod .cse57 10) 0) (< 218 v_prenex_58) (<= 518104 v_prenex_58) (<= 0 .cse58) (= 0 (mod (+ .cse59 2) 5)) (<= (+ c_~a1~0 75819) (div (+ .cse59 (- 300005)) 5)) (= 0 (mod .cse59 5))))))) (exists ((v_prenex_90 Int)) (let ((.cse60 (* 9 v_prenex_90))) (let ((.cse61 (mod (+ (div .cse60 10) 1) 299993))) (and (not (= (mod .cse60 10) 0)) (= 0 .cse61) (< .cse61 300005) (not (= 0 (mod .cse61 5))) (< 218 v_prenex_90) (<= (+ c_~a1~0 75818) (div (+ .cse61 (- 300005)) 5)) (<= 518104 v_prenex_90) (< .cse60 0) (<= 599998 .cse61))))) (exists ((v_prenex_43 Int)) (let ((.cse63 (* 9 v_prenex_43))) (let ((.cse62 (mod (+ (div .cse63 10) 1) 299993))) (and (<= (+ c_~a1~0 75819) (div (+ .cse62 (- 300005)) 5)) (<= 518104 v_prenex_43) (= 0 (mod .cse62 5)) (= 0 .cse62) (< .cse63 0) (< 218 v_prenex_43) (not (= 0 (mod (+ .cse62 2) 5))) (< .cse62 599998) (not (= (mod .cse63 10) 0)))))) (exists ((v_prenex_77 Int)) (let ((.cse65 (* 9 v_prenex_77))) (let ((.cse64 (mod (div .cse65 10) 299993))) (and (= .cse64 0) (<= 599998 .cse64) (< 218 v_prenex_77) (<= 518104 v_prenex_77) (<= 300005 .cse64) (<= (+ c_~a1~0 75819) (div (+ .cse64 (- 300005)) 5)) (= (mod .cse65 10) 0))))) (exists ((v_prenex_70 Int)) (let ((.cse68 (* 9 v_prenex_70))) (let ((.cse67 (div .cse68 10))) (let ((.cse66 (mod .cse67 299993))) (and (< 218 v_prenex_70) (< .cse66 300005) (not (= 0 (mod .cse66 5))) (<= 0 .cse67) (<= 599998 .cse66) (= (mod .cse68 10) 0) (<= (+ c_~a1~0 75818) (div (+ .cse66 (- 300005)) 5)) (<= 518104 v_prenex_70)))))) (exists ((v_prenex_80 Int)) (let ((.cse70 (* 9 v_prenex_80))) (let ((.cse71 (+ (div .cse70 10) 1))) (let ((.cse69 (mod .cse71 299993))) (and (< .cse69 300005) (not (= (mod .cse70 10) 0)) (< 218 v_prenex_80) (<= 0 .cse71) (<= (+ c_~a1~0 75818) (div (+ .cse69 (- 300005)) 5)) (= 0 (mod (+ .cse69 2) 5)) (not (= 0 (mod .cse69 5))) (< .cse70 0) (<= 518104 v_prenex_80)))))) (exists ((v_prenex_69 Int)) (let ((.cse73 (* 9 v_prenex_69))) (let ((.cse72 (div .cse73 10))) (let ((.cse74 (mod .cse72 299993))) (and (<= 518104 v_prenex_69) (< .cse72 0) (<= 0 .cse73) (<= 599998 .cse74) (= 0 (mod .cse74 5)) (<= (+ c_~a1~0 75819) (div (+ .cse74 (- 599998)) 5)) (< 218 v_prenex_69) (not (= .cse74 0))))))) (exists ((v_prenex_26 Int)) (let ((.cse76 (* 9 v_prenex_26))) (let ((.cse77 (+ (div .cse76 10) 1))) (let ((.cse75 (mod .cse77 299993))) (and (<= 599998 .cse75) (not (= (mod .cse76 10) 0)) (<= 0 .cse77) (<= (+ c_~a1~0 75819) (div (+ .cse75 (- 300005)) 5)) (<= 300005 .cse75) (< 218 v_prenex_26) (<= 518104 v_prenex_26) (< .cse76 0)))))) (exists ((v_prenex_51 Int)) (let ((.cse80 (* 9 v_prenex_51))) (let ((.cse79 (div .cse80 10))) (let ((.cse78 (mod .cse79 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse78 (- 300005)) 5)) (not (= 0 (mod .cse78 5))) (< .cse78 599998) (not (= 0 (mod (+ .cse78 2) 5))) (< .cse78 300005) (<= 0 .cse79) (< 218 v_prenex_51) (<= 518104 v_prenex_51) (<= 0 .cse80)))))) (exists ((v_prenex_83 Int)) (let ((.cse83 (* 9 v_prenex_83))) (let ((.cse82 (+ (div .cse83 10) 1))) (let ((.cse81 (mod .cse82 299993))) (and (< 218 v_prenex_83) (not (= 0 .cse81)) (< .cse82 0) (not (= (mod .cse83 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse81 (- 599998)) 5)) (< .cse81 599998) (< .cse83 0) (<= 518104 v_prenex_83) (not (= 0 (mod (+ .cse81 2) 5))) (<= 300005 .cse81)))))) (exists ((v_prenex_85 Int)) (let ((.cse85 (* 9 v_prenex_85))) (let ((.cse84 (mod (+ (div .cse85 10) 1) 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse84 (- 300005)) 5)) (< .cse85 0) (= 0 .cse84) (= 0 (mod (+ .cse84 2) 5)) (not (= (mod .cse85 10) 0)) (< .cse84 300005) (<= 518104 v_prenex_85) (not (= 0 (mod .cse84 5))) (< 218 v_prenex_85))))) (exists ((v_prenex_81 Int)) (let ((.cse87 (* 9 v_prenex_81))) (let ((.cse86 (mod (div .cse87 10) 299993))) (and (<= 300005 .cse86) (<= 0 .cse87) (<= 518104 v_prenex_81) (<= (+ c_~a1~0 75819) (div (+ .cse86 (- 300005)) 5)) (= .cse86 0) (<= 599998 .cse86) (< 218 v_prenex_81))))) (exists ((v_prenex_74 Int)) (let ((.cse88 (* 9 v_prenex_74))) (let ((.cse90 (div .cse88 10))) (let ((.cse89 (mod .cse90 299993))) (and (= (mod .cse88 10) 0) (< 218 v_prenex_74) (<= 599998 .cse89) (<= (+ c_~a1~0 75819) (div (+ .cse89 (- 599998)) 5)) (= 0 (mod .cse89 5)) (< .cse90 0) (not (= .cse89 0)) (<= 518104 v_prenex_74)))))) (exists ((v_prenex_48 Int)) (let ((.cse91 (* 9 v_prenex_48))) (let ((.cse93 (+ (div .cse91 10) 1))) (let ((.cse92 (mod .cse93 299993))) (and (not (= (mod .cse91 10) 0)) (<= (+ c_~a1~0 75819) (div (+ .cse92 (- 599998)) 5)) (<= 300005 .cse92) (< 218 v_prenex_48) (< .cse91 0) (not (= 0 .cse92)) (<= 518104 v_prenex_48) (<= 599998 .cse92) (< .cse93 0)))))) (exists ((v_prenex_46 Int)) (let ((.cse96 (* 9 v_prenex_46))) (let ((.cse94 (div .cse96 10))) (let ((.cse95 (mod .cse94 299993))) (and (< .cse94 0) (not (= .cse95 0)) (< 218 v_prenex_46) (<= 0 .cse96) (<= (+ c_~a1~0 75819) (div (+ .cse95 (- 599998)) 5)) (= 0 (mod (+ .cse95 2) 5)) (<= 518104 v_prenex_46) (<= 300005 .cse95)))))) (exists ((v_prenex_33 Int)) (let ((.cse98 (* 9 v_prenex_33))) (let ((.cse99 (div .cse98 10))) (let ((.cse97 (mod .cse99 299993))) (and (<= (+ c_~a1~0 75819) (div (+ .cse97 (- 300005)) 5)) (<= 599998 .cse97) (<= 518104 v_prenex_33) (= 0 (mod .cse97 5)) (<= 0 .cse98) (< 218 v_prenex_33) (<= 0 .cse99)))))) (exists ((v_prenex_71 Int)) (let ((.cse101 (* 9 v_prenex_71))) (let ((.cse100 (mod (div .cse101 10) 299993))) (and (< 218 v_prenex_71) (= .cse100 0) (<= 518104 v_prenex_71) (< .cse100 300005) (<= (+ c_~a1~0 75818) (div (+ .cse100 (- 300005)) 5)) (not (= 0 (mod (+ .cse100 2) 5))) (< .cse100 599998) (= (mod .cse101 10) 0) (not (= 0 (mod .cse100 5))))))) (exists ((v_prenex_44 Int)) (let ((.cse102 (* 9 v_prenex_44))) (let ((.cse104 (div .cse102 10))) (let ((.cse103 (mod .cse104 299993))) (and (<= 0 .cse102) (= 0 (mod (+ .cse103 2) 5)) (< .cse103 300005) (not (= .cse103 0)) (<= (+ c_~a1~0 75819) (div (+ .cse103 (- 599998)) 5)) (< .cse104 0) (< 218 v_prenex_44) (<= 518104 v_prenex_44) (not (= 0 (mod .cse103 5)))))))) (exists ((v_prenex_37 Int)) (let ((.cse105 (* 9 v_prenex_37))) (let ((.cse107 (div .cse105 10))) (let ((.cse106 (mod .cse107 299993))) (and (= (mod .cse105 10) 0) (<= (+ c_~a1~0 75819) (div (+ .cse106 (- 599998)) 5)) (< .cse107 0) (<= 300005 .cse106) (= 0 (mod (+ .cse106 2) 5)) (< 218 v_prenex_37) (not (= .cse106 0)) (<= 518104 v_prenex_37)))))) (exists ((v_prenex_49 Int)) (let ((.cse109 (* 9 v_prenex_49))) (let ((.cse110 (div .cse109 10))) (let ((.cse108 (mod .cse110 299993))) (and (< 218 v_prenex_49) (not (= 0 (mod (+ .cse108 2) 5))) (<= 0 .cse109) (< .cse108 300005) (<= 518104 v_prenex_49) (< .cse110 0) (<= (+ c_~a1~0 75818) (div (+ .cse108 (- 599998)) 5)) (not (= 0 (mod .cse108 5))) (< .cse108 599998) (not (= .cse108 0))))))) (exists ((v_prenex_28 Int)) (let ((.cse113 (* 9 v_prenex_28))) (let ((.cse111 (div .cse113 10))) (let ((.cse112 (mod .cse111 299993))) (and (<= 0 .cse111) (<= 599998 .cse112) (< 218 v_prenex_28) (<= 300005 .cse112) (<= 0 .cse113) (<= 518104 v_prenex_28) (<= (+ c_~a1~0 75819) (div (+ .cse112 (- 300005)) 5))))))) (exists ((v_prenex_55 Int)) (let ((.cse115 (* 9 v_prenex_55))) (let ((.cse114 (mod (div .cse115 10) 299993))) (and (< .cse114 599998) (< 218 v_prenex_55) (= .cse114 0) (not (= 0 (mod (+ .cse114 2) 5))) (= 0 (mod .cse114 5)) (<= (+ c_~a1~0 75819) (div (+ .cse114 (- 300005)) 5)) (= (mod .cse115 10) 0) (<= 518104 v_prenex_55))))) (exists ((v_prenex_22 Int)) (let ((.cse118 (* 9 v_prenex_22))) (let ((.cse116 (div .cse118 10))) (let ((.cse117 (mod .cse116 299993))) (and (< .cse116 0) (<= (+ c_~a1~0 75819) (div (+ .cse117 (- 599998)) 5)) (not (= 0 (mod .cse117 5))) (< 218 v_prenex_22) (<= 599998 .cse117) (< .cse117 300005) (= (mod .cse118 10) 0) (<= 518104 v_prenex_22) (not (= .cse117 0))))))) (exists ((v_prenex_23 Int)) (let ((.cse121 (* 9 v_prenex_23))) (let ((.cse120 (div .cse121 10))) (let ((.cse119 (mod .cse120 299993))) (and (< 218 v_prenex_23) (<= (+ c_~a1~0 75819) (div (+ .cse119 (- 300005)) 5)) (<= 0 .cse120) (< .cse119 599998) (<= 0 .cse121) (not (= 0 (mod (+ .cse119 2) 5))) (<= 518104 v_prenex_23) (= 0 (mod .cse119 5))))))) (exists ((v_prenex_89 Int)) (let ((.cse123 (* 9 v_prenex_89))) (let ((.cse122 (mod (+ (div .cse123 10) 1) 299993))) (and (<= 518104 v_prenex_89) (= 0 (mod .cse122 5)) (= 0 .cse122) (not (= (mod .cse123 10) 0)) (<= 599998 .cse122) (< 218 v_prenex_89) (< .cse123 0) (<= (+ c_~a1~0 75819) (div (+ .cse122 (- 300005)) 5)))))) (exists ((v_prenex_53 Int)) (let ((.cse126 (* 9 v_prenex_53))) (let ((.cse125 (div .cse126 10))) (let ((.cse124 (mod .cse125 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse124 (- 300005)) 5)) (< .cse124 300005) (<= 518104 v_prenex_53) (<= 0 .cse125) (not (= 0 (mod .cse124 5))) (<= 0 .cse126) (<= 599998 .cse124) (< 218 v_prenex_53)))))) (exists ((v_prenex_30 Int)) (let ((.cse127 (* 9 v_prenex_30))) (let ((.cse129 (div .cse127 10))) (let ((.cse128 (mod .cse129 299993))) (and (= (mod .cse127 10) 0) (<= (+ c_~a1~0 75819) (div (+ .cse128 (- 599998)) 5)) (= 0 (mod (+ .cse128 2) 5)) (< 218 v_prenex_30) (< .cse129 0) (= 0 (mod .cse128 5)) (not (= .cse128 0)) (<= 518104 v_prenex_30)))))) (exists ((v_prenex_96 Int)) (let ((.cse132 (* 9 v_prenex_96))) (let ((.cse131 (div .cse132 10))) (let ((.cse130 (mod .cse131 299993))) (and (not (= .cse130 0)) (< 218 v_prenex_96) (< .cse131 0) (<= 300005 .cse130) (<= (+ c_~a1~0 75818) (div (+ .cse130 (- 599998)) 5)) (<= 518104 v_prenex_96) (< .cse130 599998) (= (mod .cse132 10) 0) (not (= 0 (mod (+ .cse130 2) 5)))))))) (exists ((v_prenex_35 Int)) (let ((.cse134 (* 9 v_prenex_35))) (let ((.cse135 (+ (div .cse134 10) 1))) (let ((.cse133 (mod .cse135 299993))) (and (not (= 0 .cse133)) (<= 518104 v_prenex_35) (< 218 v_prenex_35) (<= 599998 .cse133) (< .cse134 0) (< .cse135 0) (not (= (mod .cse134 10) 0)) (< .cse133 300005) (<= (+ c_~a1~0 75819) (div (+ .cse133 (- 599998)) 5)) (not (= 0 (mod .cse133 5)))))))) (exists ((v_prenex_63 Int)) (let ((.cse138 (* 9 v_prenex_63))) (let ((.cse136 (div .cse138 10))) (let ((.cse137 (mod .cse136 299993))) (and (< .cse136 0) (not (= 0 (mod .cse137 5))) (<= 518104 v_prenex_63) (not (= 0 (mod (+ .cse137 2) 5))) (< 218 v_prenex_63) (not (= .cse137 0)) (= (mod .cse138 10) 0) (<= (+ c_~a1~0 75818) (div (+ .cse137 (- 599998)) 5)) (< .cse137 300005) (< .cse137 599998)))))) (exists ((v_prenex_66 Int)) (let ((.cse140 (* 9 v_prenex_66))) (let ((.cse141 (div .cse140 10))) (let ((.cse139 (mod .cse141 299993))) (and (<= (+ c_~a1~0 75819) (div (+ .cse139 (- 300005)) 5)) (<= 300005 .cse139) (< 218 v_prenex_66) (= (mod .cse140 10) 0) (<= 0 .cse141) (<= 518104 v_prenex_66) (= 0 (mod (+ .cse139 2) 5))))))) (exists ((v_prenex_45 Int)) (let ((.cse142 (* 9 v_prenex_45))) (let ((.cse144 (+ (div .cse142 10) 1))) (let ((.cse143 (mod .cse144 299993))) (and (< .cse142 0) (not (= (mod .cse142 10) 0)) (= 0 (mod (+ .cse143 2) 5)) (not (= 0 .cse143)) (<= (+ c_~a1~0 75819) (div (+ .cse143 (- 599998)) 5)) (< 218 v_prenex_45) (< .cse143 300005) (<= 518104 v_prenex_45) (not (= 0 (mod .cse143 5))) (< .cse144 0)))))) (exists ((v_prenex_87 Int)) (let ((.cse147 (* 9 v_prenex_87))) (let ((.cse145 (div .cse147 10))) (let ((.cse146 (mod .cse145 299993))) (and (< 218 v_prenex_87) (< .cse145 0) (<= 599998 .cse146) (<= 300005 .cse146) (<= 0 .cse147) (<= 518104 v_prenex_87) (<= (+ c_~a1~0 75819) (div (+ .cse146 (- 599998)) 5)) (not (= .cse146 0))))))) (exists ((v_prenex_59 Int)) (let ((.cse149 (* 9 v_prenex_59))) (let ((.cse148 (mod (div .cse149 10) 299993))) (and (not (= 0 (mod (+ .cse148 2) 5))) (<= 300005 .cse148) (= .cse148 0) (<= (+ c_~a1~0 75819) (div (+ .cse148 (- 300005)) 5)) (< .cse148 599998) (= (mod .cse149 10) 0) (< 218 v_prenex_59) (<= 518104 v_prenex_59))))) (exists ((v_prenex_95 Int)) (let ((.cse150 (* 9 v_prenex_95))) (let ((.cse152 (+ (div .cse150 10) 1))) (let ((.cse151 (mod .cse152 299993))) (and (not (= (mod .cse150 10) 0)) (< .cse150 0) (not (= 0 .cse151)) (<= 300005 .cse151) (< 218 v_prenex_95) (<= (+ c_~a1~0 75819) (div (+ .cse151 (- 599998)) 5)) (= 0 (mod (+ .cse151 2) 5)) (<= 518104 v_prenex_95) (< .cse152 0)))))) (exists ((v_prenex_98 Int)) (let ((.cse154 (* 9 v_prenex_98))) (let ((.cse153 (mod (div .cse154 10) 299993))) (and (<= 518104 v_prenex_98) (< .cse153 300005) (= .cse153 0) (< 218 v_prenex_98) (<= (+ c_~a1~0 75818) (div (+ .cse153 (- 300005)) 5)) (= 0 (mod (+ .cse153 2) 5)) (= (mod .cse154 10) 0) (not (= 0 (mod .cse153 5))))))) (exists ((v_prenex_39 Int)) (let ((.cse157 (* 9 v_prenex_39))) (let ((.cse156 (div .cse157 10))) (let ((.cse155 (mod .cse156 299993))) (and (not (= .cse155 0)) (< 218 v_prenex_39) (not (= 0 (mod .cse155 5))) (< .cse155 300005) (<= (+ c_~a1~0 75819) (div (+ .cse155 (- 599998)) 5)) (<= 518104 v_prenex_39) (< .cse156 0) (<= 599998 .cse155) (<= 0 .cse157)))))) (exists ((v_prenex_20 Int)) (let ((.cse159 (* 9 v_prenex_20))) (let ((.cse160 (+ (div .cse159 10) 1))) (let ((.cse158 (mod .cse160 299993))) (and (not (= 0 (mod (+ .cse158 2) 5))) (not (= (mod .cse159 10) 0)) (<= 518104 v_prenex_20) (< 218 v_prenex_20) (= 0 (mod .cse158 5)) (< .cse159 0) (<= (+ c_~a1~0 75819) (div (+ .cse158 (- 300005)) 5)) (<= 0 .cse160) (< .cse158 599998)))))) (exists ((v_prenex_32 Int)) (let ((.cse162 (* 9 v_prenex_32))) (let ((.cse161 (mod (div .cse162 10) 299993))) (and (<= 599998 .cse161) (= 0 (mod .cse161 5)) (< 218 v_prenex_32) (<= (+ c_~a1~0 75819) (div (+ .cse161 (- 300005)) 5)) (= (mod .cse162 10) 0) (<= 518104 v_prenex_32) (= .cse161 0))))) (exists ((v_prenex_34 Int)) (let ((.cse164 (* 9 v_prenex_34))) (let ((.cse163 (mod (div .cse164 10) 299993))) (and (< 218 v_prenex_34) (= .cse163 0) (<= 0 .cse164) (<= 518104 v_prenex_34) (= 0 (mod .cse163 5)) (not (= 0 (mod (+ .cse163 2) 5))) (<= (+ c_~a1~0 75819) (div (+ .cse163 (- 300005)) 5)) (< .cse163 599998))))) (exists ((v_prenex_93 Int)) (let ((.cse166 (* 9 v_prenex_93))) (let ((.cse167 (div .cse166 10))) (let ((.cse165 (mod .cse167 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse165 (- 300005)) 5)) (< .cse165 300005) (<= 518104 v_prenex_93) (= (mod .cse166 10) 0) (< 218 v_prenex_93) (<= 0 .cse167) (not (= 0 (mod .cse165 5))) (= 0 (mod (+ .cse165 2) 5))))))) (exists ((v_prenex_19 Int)) (let ((.cse169 (* 9 v_prenex_19))) (let ((.cse170 (div .cse169 10))) (let ((.cse168 (mod .cse170 299993))) (and (< 218 v_prenex_19) (< .cse168 300005) (not (= 0 (mod .cse168 5))) (<= (+ c_~a1~0 75818) (div (+ .cse168 (- 300005)) 5)) (= 0 (mod (+ .cse168 2) 5)) (<= 0 .cse169) (<= 518104 v_prenex_19) (<= 0 .cse170)))))) (exists ((v_prenex_62 Int)) (let ((.cse173 (* 9 v_prenex_62))) (let ((.cse171 (div .cse173 10))) (let ((.cse172 (mod .cse171 299993))) (and (< .cse171 0) (not (= 0 (mod .cse172 5))) (= 0 (mod (+ .cse172 2) 5)) (< .cse172 300005) (< 218 v_prenex_62) (= (mod .cse173 10) 0) (not (= .cse172 0)) (<= 518104 v_prenex_62) (<= (+ c_~a1~0 75819) (div (+ .cse172 (- 599998)) 5))))))) (exists ((v_prenex_29 Int)) (let ((.cse176 (* 9 v_prenex_29))) (let ((.cse175 (+ (div .cse176 10) 1))) (let ((.cse174 (mod .cse175 299993))) (and (= 0 (mod .cse174 5)) (<= (+ c_~a1~0 75819) (div (+ .cse174 (- 300005)) 5)) (< 218 v_prenex_29) (= 0 (mod (+ .cse174 2) 5)) (<= 518104 v_prenex_29) (<= 0 .cse175) (< .cse176 0) (not (= (mod .cse176 10) 0))))))) (exists ((v_prenex_50 Int)) (let ((.cse178 (* 9 v_prenex_50))) (let ((.cse179 (+ (div .cse178 10) 1))) (let ((.cse177 (mod .cse179 299993))) (and (= 0 (mod .cse177 5)) (< .cse178 0) (<= 518104 v_prenex_50) (<= 599998 .cse177) (< 218 v_prenex_50) (not (= (mod .cse178 10) 0)) (<= 0 .cse179) (<= (+ c_~a1~0 75819) (div (+ .cse177 (- 300005)) 5))))))) (exists ((v_prenex_42 Int)) (let ((.cse181 (* 9 v_prenex_42))) (let ((.cse182 (div .cse181 10))) (let ((.cse180 (mod .cse182 299993))) (and (<= (+ c_~a1~0 75819) (div (+ .cse180 (- 599998)) 5)) (= (mod .cse181 10) 0) (not (= .cse180 0)) (< 218 v_prenex_42) (<= 300005 .cse180) (<= 599998 .cse180) (<= 518104 v_prenex_42) (< .cse182 0)))))) (exists ((v_prenex_38 Int)) (let ((.cse184 (* 9 v_prenex_38))) (let ((.cse185 (+ (div .cse184 10) 1))) (let ((.cse183 (mod .cse185 299993))) (and (<= 599998 .cse183) (= 0 (mod .cse183 5)) (not (= (mod .cse184 10) 0)) (<= 518104 v_prenex_38) (not (= 0 .cse183)) (< .cse184 0) (< 218 v_prenex_38) (<= (+ c_~a1~0 75819) (div (+ .cse183 (- 599998)) 5)) (< .cse185 0)))))) (exists ((v_prenex_56 Int)) (let ((.cse187 (* 9 v_prenex_56))) (let ((.cse188 (div .cse187 10))) (let ((.cse186 (mod .cse188 299993))) (and (< 218 v_prenex_56) (= 0 (mod .cse186 5)) (<= 0 .cse187) (< .cse188 0) (<= 518104 v_prenex_56) (not (= 0 (mod (+ .cse186 2) 5))) (<= (+ c_~a1~0 75818) (div (+ .cse186 (- 599998)) 5)) (< .cse186 599998) (not (= .cse186 0))))))) (exists ((v_prenex_86 Int)) (let ((.cse190 (* 9 v_prenex_86))) (let ((.cse191 (div .cse190 10))) (let ((.cse189 (mod .cse191 299993))) (and (< 218 v_prenex_86) (<= (+ c_~a1~0 75819) (div (+ .cse189 (- 300005)) 5)) (<= 0 .cse190) (< .cse189 599998) (<= 518104 v_prenex_86) (<= 300005 .cse189) (not (= 0 (mod (+ .cse189 2) 5))) (<= 0 .cse191)))))) (exists ((v_prenex_41 Int)) (let ((.cse192 (* 9 v_prenex_41))) (let ((.cse194 (+ (div .cse192 10) 1))) (let ((.cse193 (mod .cse194 299993))) (and (not (= (mod .cse192 10) 0)) (<= 300005 .cse193) (< .cse192 0) (<= 518104 v_prenex_41) (< 218 v_prenex_41) (<= (+ c_~a1~0 75819) (div (+ .cse193 (- 300005)) 5)) (< .cse193 599998) (not (= 0 (mod (+ .cse193 2) 5))) (<= 0 .cse194)))))) (exists ((v_prenex_40 Int)) (let ((.cse196 (* 9 v_prenex_40))) (let ((.cse195 (mod (div .cse196 10) 299993))) (and (= .cse195 0) (<= (+ c_~a1~0 75819) (div (+ .cse195 (- 300005)) 5)) (< 218 v_prenex_40) (< .cse195 599998) (<= 0 .cse196) (not (= 0 (mod (+ .cse195 2) 5))) (<= 300005 .cse195) (<= 518104 v_prenex_40))))) (exists ((v_prenex_78 Int)) (let ((.cse198 (* 9 v_prenex_78))) (let ((.cse199 (div .cse198 10))) (let ((.cse197 (mod .cse199 299993))) (and (<= (+ c_~a1~0 75819) (div (+ .cse197 (- 300005)) 5)) (= 0 (mod .cse197 5)) (= (mod .cse198 10) 0) (< 218 v_prenex_78) (<= 0 .cse199) (<= 518104 v_prenex_78) (<= 599998 .cse197)))))) (exists ((v_prenex_31 Int)) (let ((.cse201 (* 9 v_prenex_31))) (let ((.cse200 (mod (div .cse201 10) 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse200 (- 300005)) 5)) (= .cse200 0) (<= 0 .cse201) (<= 599998 .cse200) (not (= 0 (mod .cse200 5))) (<= 518104 v_prenex_31) (< 218 v_prenex_31) (< .cse200 300005))))) (exists ((v_prenex_76 Int)) (let ((.cse203 (* 9 v_prenex_76))) (let ((.cse202 (mod (+ (div .cse203 10) 1) 299993))) (and (= 0 .cse202) (<= (+ c_~a1~0 75819) (div (+ .cse202 (- 300005)) 5)) (= 0 (mod .cse202 5)) (<= 518104 v_prenex_76) (= 0 (mod (+ .cse202 2) 5)) (not (= (mod .cse203 10) 0)) (< .cse203 0) (< 218 v_prenex_76))))) (exists ((v_prenex_54 Int)) (let ((.cse205 (* 9 v_prenex_54))) (let ((.cse204 (mod (div .cse205 10) 299993))) (and (not (= 0 (mod .cse204 5))) (<= 0 .cse205) (<= 518104 v_prenex_54) (= .cse204 0) (< .cse204 599998) (<= (+ c_~a1~0 75818) (div (+ .cse204 (- 300005)) 5)) (< .cse204 300005) (< 218 v_prenex_54) (not (= 0 (mod (+ .cse204 2) 5))))))) (exists ((v_prenex_60 Int)) (let ((.cse207 (* 9 v_prenex_60))) (let ((.cse206 (mod (+ (div .cse207 10) 1) 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse206 (- 300005)) 5)) (= 0 .cse206) (< .cse207 0) (< 218 v_prenex_60) (< .cse206 300005) (not (= (mod .cse207 10) 0)) (not (= 0 (mod .cse206 5))) (< .cse206 599998) (<= 518104 v_prenex_60) (not (= 0 (mod (+ .cse206 2) 5))))))) (exists ((v_prenex_75 Int)) (let ((.cse209 (* 9 v_prenex_75))) (let ((.cse210 (div .cse209 10))) (let ((.cse208 (mod .cse210 299993))) (and (not (= 0 (mod .cse208 5))) (not (= 0 (mod (+ .cse208 2) 5))) (<= 518104 v_prenex_75) (< .cse208 599998) (= (mod .cse209 10) 0) (< .cse208 300005) (< 218 v_prenex_75) (<= 0 .cse210) (<= (+ c_~a1~0 75818) (div (+ .cse208 (- 300005)) 5))))))) (exists ((v_prenex_92 Int)) (let ((.cse213 (* 9 v_prenex_92))) (let ((.cse212 (div .cse213 10))) (let ((.cse211 (mod .cse212 299993))) (and (< 218 v_prenex_92) (<= 300005 .cse211) (<= (+ c_~a1~0 75819) (div (+ .cse211 (- 300005)) 5)) (<= 0 .cse212) (<= 0 .cse213) (= 0 (mod (+ .cse211 2) 5)) (<= 518104 v_prenex_92)))))) (exists ((v_prenex_65 Int)) (let ((.cse215 (* 9 v_prenex_65))) (let ((.cse214 (mod (div .cse215 10) 299993))) (and (= 0 (mod (+ .cse214 2) 5)) (<= (+ c_~a1~0 75819) (div (+ .cse214 (- 300005)) 5)) (= .cse214 0) (= 0 (mod .cse214 5)) (<= 0 .cse215) (< 218 v_prenex_65) (<= 518104 v_prenex_65)))))) is different from false [2018-10-24 14:00:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 98 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 170 not checked. [2018-10-24 14:00:26,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:00:26,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-10-24 14:00:26,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 14:00:26,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 14:00:26,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2018-10-24 14:00:26,186 INFO L87 Difference]: Start difference. First operand 4246 states and 4586 transitions. Second operand 9 states. [2018-10-24 14:00:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:00:29,555 INFO L93 Difference]: Finished difference Result 9792 states and 10562 transitions. [2018-10-24 14:00:29,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 14:00:29,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 316 [2018-10-24 14:00:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:00:29,579 INFO L225 Difference]: With dead ends: 9792 [2018-10-24 14:00:29,580 INFO L226 Difference]: Without dead ends: 5968 [2018-10-24 14:00:29,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 312 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2018-10-24 14:00:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2018-10-24 14:00:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 4386. [2018-10-24 14:00:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4386 states. [2018-10-24 14:00:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 4705 transitions. [2018-10-24 14:00:29,671 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 4705 transitions. Word has length 316 [2018-10-24 14:00:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:00:29,671 INFO L481 AbstractCegarLoop]: Abstraction has 4386 states and 4705 transitions. [2018-10-24 14:00:29,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 14:00:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 4705 transitions. [2018-10-24 14:00:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-24 14:00:29,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:00:29,682 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:00:29,682 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:00:29,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:00:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1222289717, now seen corresponding path program 1 times [2018-10-24 14:00:29,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:00:29,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:00:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:00:29,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:00:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:00:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 14:00:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 14:00:29,861 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 14:00:30,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:00:30 BoogieIcfgContainer [2018-10-24 14:00:30,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:00:30,064 INFO L168 Benchmark]: Toolchain (without parser) took 83821.80 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 223.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:00:30,066 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:00:30,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:00:30,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 206.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:00:30,069 INFO L168 Benchmark]: Boogie Preprocessor took 130.27 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:00:30,070 INFO L168 Benchmark]: RCFGBuilder took 3311.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 131.1 MB). Peak memory consumption was 131.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:00:30,070 INFO L168 Benchmark]: TraceAbstraction took 79454.91 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 136.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:00:30,077 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 708.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 206.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.27 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3311.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 131.1 MB). Peak memory consumption was 131.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79454.91 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 136.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] RET return 25; VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L461] a1 = (((a1 / 5) + 105416) + 61704) [L462] a10 = 4 [L464] RET return 24; VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND TRUE ((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))) [L314] a19 = 8 [L316] RET return -1; VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND TRUE (((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] __VERIFIER_error() VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 207 locations, 1 error locations. UNSAFE Result, 79.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 40.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1029 SDtfs, 5481 SDslu, 822 SDs, 0 SdLazy, 16343 SolverSat, 1816 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 34.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1208 GetRequests, 1133 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4386occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 5733 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 36.0s InterpolantComputationTime, 3364 NumberOfCodeBlocks, 3364 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2997 ConstructedInterpolants, 181 QuantifiedInterpolants, 170432714 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1551 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1269/2159 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...