./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label21_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem15_label21_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0a4c8012874d1ff764bed1f77512608d8acedf8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:33:15,549 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:33:15,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:33:15,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:33:15,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:33:15,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:33:15,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:33:15,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:33:15,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:33:15,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:33:15,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:33:15,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:33:15,577 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:33:15,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:33:15,579 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:33:15,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:33:15,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:33:15,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:33:15,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:33:15,587 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:33:15,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:33:15,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:33:15,592 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:33:15,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:33:15,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:33:15,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:33:15,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:33:15,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:33:15,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:33:15,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:33:15,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:33:15,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:33:15,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:33:15,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:33:15,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:33:15,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:33:15,602 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:33:15,617 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:33:15,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:33:15,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:33:15,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:33:15,619 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:33:15,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:33:15,620 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:33:15,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:33:15,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:33:15,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:33:15,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:33:15,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:33:15,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:33:15,622 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:33:15,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:33:15,622 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:33:15,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:33:15,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:33:15,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:33:15,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:33:15,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:33:15,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:33:15,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:33:15,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:33:15,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:33:15,624 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:33:15,625 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:33:15,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:33:15,626 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0a4c8012874d1ff764bed1f77512608d8acedf8 [2019-01-12 04:33:15,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:33:15,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:33:15,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:33:15,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:33:15,697 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:33:15,699 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label21_true-unreach-call.c [2019-01-12 04:33:15,752 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b9ef849e/770250675fa247c6a42c7cc7d6fb6c7e/FLAGde4aebed1 [2019-01-12 04:33:16,359 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:33:16,359 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label21_true-unreach-call.c [2019-01-12 04:33:16,382 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b9ef849e/770250675fa247c6a42c7cc7d6fb6c7e/FLAGde4aebed1 [2019-01-12 04:33:16,537 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b9ef849e/770250675fa247c6a42c7cc7d6fb6c7e [2019-01-12 04:33:16,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:33:16,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:33:16,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:33:16,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:33:16,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:33:16,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:33:16" (1/1) ... [2019-01-12 04:33:16,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf6d897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:16, skipping insertion in model container [2019-01-12 04:33:16,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:33:16" (1/1) ... [2019-01-12 04:33:16,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:33:16,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:33:17,491 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:33:17,496 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:33:17,879 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:33:17,906 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:33:17,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17 WrapperNode [2019-01-12 04:33:17,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:33:17,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:33:17,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:33:17,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:33:18,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:33:18,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:33:18,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:33:18,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:33:18,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... [2019-01-12 04:33:18,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:33:18,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:33:18,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:33:18,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:33:18,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:33:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:33:18,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:33:25,139 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:33:25,140 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:33:25,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:33:25 BoogieIcfgContainer [2019-01-12 04:33:25,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:33:25,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:33:25,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:33:25,145 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:33:25,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:33:16" (1/3) ... [2019-01-12 04:33:25,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b78863f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:33:25, skipping insertion in model container [2019-01-12 04:33:25,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:17" (2/3) ... [2019-01-12 04:33:25,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b78863f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:33:25, skipping insertion in model container [2019-01-12 04:33:25,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:33:25" (3/3) ... [2019-01-12 04:33:25,149 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label21_true-unreach-call.c [2019-01-12 04:33:25,156 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:33:25,164 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:33:25,180 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:33:25,217 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:33:25,218 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:33:25,218 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:33:25,218 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:33:25,218 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:33:25,218 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:33:25,219 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:33:25,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:33:25,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:33:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:33:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 04:33:25,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:25,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:33:25,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash -634083006, now seen corresponding path program 1 times [2019-01-12 04:33:25,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:25,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:25,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:33:25,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:33:25,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:33:25,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:33:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:33:25,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:25,760 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:33:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:33,187 INFO L93 Difference]: Finished difference Result 1506 states and 2774 transitions. [2019-01-12 04:33:33,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:33:33,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-01-12 04:33:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:33,215 INFO L225 Difference]: With dead ends: 1506 [2019-01-12 04:33:33,215 INFO L226 Difference]: Without dead ends: 1000 [2019-01-12 04:33:33,222 INFO L631 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 [2019-01-12 04:33:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-01-12 04:33:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 680. [2019-01-12 04:33:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-01-12 04:33:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2019-01-12 04:33:33,322 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 60 [2019-01-12 04:33:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:33,323 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2019-01-12 04:33:33,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:33:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2019-01-12 04:33:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-12 04:33:33,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:33,331 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:33:33,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1884968881, now seen corresponding path program 1 times [2019-01-12 04:33:33,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:33,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:33,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:33,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:33,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:33:33,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:33:33,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:33:33,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:33:33,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:33:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:33,626 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand 4 states. [2019-01-12 04:33:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:38,923 INFO L93 Difference]: Finished difference Result 2561 states and 4133 transitions. [2019-01-12 04:33:38,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:33:38,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-01-12 04:33:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:38,937 INFO L225 Difference]: With dead ends: 2561 [2019-01-12 04:33:38,937 INFO L226 Difference]: Without dead ends: 1883 [2019-01-12 04:33:38,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2019-01-12 04:33:39,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1278. [2019-01-12 04:33:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-01-12 04:33:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1775 transitions. [2019-01-12 04:33:39,051 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1775 transitions. Word has length 128 [2019-01-12 04:33:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:39,054 INFO L480 AbstractCegarLoop]: Abstraction has 1278 states and 1775 transitions. [2019-01-12 04:33:39,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:33:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1775 transitions. [2019-01-12 04:33:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-12 04:33:39,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:39,059 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:33:39,059 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash -998448995, now seen corresponding path program 1 times [2019-01-12 04:33:39,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:39,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:39,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:39,679 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:33:40,001 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:33:40,538 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-01-12 04:33:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:33:40,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:33:40,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:33:40,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:33:40,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:33:40,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:33:40,621 INFO L87 Difference]: Start difference. First operand 1278 states and 1775 transitions. Second operand 6 states. [2019-01-12 04:33:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:50,079 INFO L93 Difference]: Finished difference Result 5270 states and 7256 transitions. [2019-01-12 04:33:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:33:50,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-01-12 04:33:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:50,100 INFO L225 Difference]: With dead ends: 5270 [2019-01-12 04:33:50,100 INFO L226 Difference]: Without dead ends: 3994 [2019-01-12 04:33:50,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:33:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2019-01-12 04:33:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3681. [2019-01-12 04:33:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3681 states. [2019-01-12 04:33:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4586 transitions. [2019-01-12 04:33:50,173 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4586 transitions. Word has length 136 [2019-01-12 04:33:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:50,174 INFO L480 AbstractCegarLoop]: Abstraction has 3681 states and 4586 transitions. [2019-01-12 04:33:50,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:33:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4586 transitions. [2019-01-12 04:33:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-01-12 04:33:50,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:50,180 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:33:50,181 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash 878864329, now seen corresponding path program 1 times [2019-01-12 04:33:50,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:50,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-12 04:33:50,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:33:50,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:33:50,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:33:50,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:33:50,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:50,559 INFO L87 Difference]: Start difference. First operand 3681 states and 4586 transitions. Second operand 4 states. [2019-01-12 04:33:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:54,737 INFO L93 Difference]: Finished difference Result 10951 states and 14029 transitions. [2019-01-12 04:33:54,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:33:54,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-01-12 04:33:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:54,770 INFO L225 Difference]: With dead ends: 10951 [2019-01-12 04:33:54,770 INFO L226 Difference]: Without dead ends: 7272 [2019-01-12 04:33:54,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2019-01-12 04:33:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6971. [2019-01-12 04:33:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6971 states. [2019-01-12 04:33:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6971 states to 6971 states and 8376 transitions. [2019-01-12 04:33:54,912 INFO L78 Accepts]: Start accepts. Automaton has 6971 states and 8376 transitions. Word has length 227 [2019-01-12 04:33:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:54,915 INFO L480 AbstractCegarLoop]: Abstraction has 6971 states and 8376 transitions. [2019-01-12 04:33:54,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:33:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6971 states and 8376 transitions. [2019-01-12 04:33:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-12 04:33:54,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:54,923 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:33:54,923 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:54,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1749555422, now seen corresponding path program 1 times [2019-01-12 04:33:54,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:54,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:54,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:54,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:54,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 244 proven. 1 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-12 04:33:55,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:33:55,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-12 04:33:55,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:55,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:33:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-01-12 04:33:55,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:33:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-01-12 04:33:55,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:33:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:33:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:33:55,771 INFO L87 Difference]: Start difference. First operand 6971 states and 8376 transitions. Second operand 5 states. [2019-01-12 04:34:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:01,115 INFO L93 Difference]: Finished difference Result 13939 states and 16751 transitions. [2019-01-12 04:34:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:01,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 298 [2019-01-12 04:34:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:01,145 INFO L225 Difference]: With dead ends: 13939 [2019-01-12 04:34:01,145 INFO L226 Difference]: Without dead ends: 6970 [2019-01-12 04:34:01,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:34:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2019-01-12 04:34:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 6968. [2019-01-12 04:34:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6968 states. [2019-01-12 04:34:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 7890 transitions. [2019-01-12 04:34:01,302 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 7890 transitions. Word has length 298 [2019-01-12 04:34:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:01,302 INFO L480 AbstractCegarLoop]: Abstraction has 6968 states and 7890 transitions. [2019-01-12 04:34:01,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:34:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 7890 transitions. [2019-01-12 04:34:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-01-12 04:34:01,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:01,314 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:01,314 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:01,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:01,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1611989383, now seen corresponding path program 1 times [2019-01-12 04:34:01,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:01,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:01,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:01,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:02,228 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 7 [2019-01-12 04:34:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 04:34:02,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:34:02,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-12 04:34:02,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:02,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:34:03,151 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 25 [2019-01-12 04:34:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 04:34:03,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:34:03,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:34:03,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:34:03,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:34:03,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:34:03,643 INFO L87 Difference]: Start difference. First operand 6968 states and 7890 transitions. Second operand 7 states. [2019-01-12 04:34:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:13,068 INFO L93 Difference]: Finished difference Result 29807 states and 33846 transitions. [2019-01-12 04:34:13,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:34:13,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 407 [2019-01-12 04:34:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:13,152 INFO L225 Difference]: With dead ends: 29807 [2019-01-12 04:34:13,152 INFO L226 Difference]: Without dead ends: 17459 [2019-01-12 04:34:13,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:34:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17459 states. [2019-01-12 04:34:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17459 to 12350. [2019-01-12 04:34:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12350 states. [2019-01-12 04:34:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12350 states to 12350 states and 13284 transitions. [2019-01-12 04:34:13,563 INFO L78 Accepts]: Start accepts. Automaton has 12350 states and 13284 transitions. Word has length 407 [2019-01-12 04:34:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:13,565 INFO L480 AbstractCegarLoop]: Abstraction has 12350 states and 13284 transitions. [2019-01-12 04:34:13,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:34:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 12350 states and 13284 transitions. [2019-01-12 04:34:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-01-12 04:34:13,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:13,582 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:13,582 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:13,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1149462817, now seen corresponding path program 1 times [2019-01-12 04:34:13,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:13,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:13,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:14,191 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:34:14,807 WARN L181 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-01-12 04:34:15,059 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-01-12 04:34:16,045 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-01-12 04:34:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 266 proven. 71 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-12 04:34:16,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:34:16,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-12 04:34:16,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:16,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:34:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-12 04:34:17,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:34:17,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2019-01-12 04:34:17,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 04:34:17,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 04:34:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:34:17,205 INFO L87 Difference]: Start difference. First operand 12350 states and 13284 transitions. Second operand 12 states. [2019-01-12 04:34:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:27,687 INFO L93 Difference]: Finished difference Result 31157 states and 33469 transitions. [2019-01-12 04:34:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 04:34:27,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 480 [2019-01-12 04:34:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:27,723 INFO L225 Difference]: With dead ends: 31157 [2019-01-12 04:34:27,723 INFO L226 Difference]: Without dead ends: 18809 [2019-01-12 04:34:27,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 482 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-12 04:34:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18809 states. [2019-01-12 04:34:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18809 to 14742. [2019-01-12 04:34:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14742 states. [2019-01-12 04:34:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14742 states to 14742 states and 15754 transitions. [2019-01-12 04:34:28,054 INFO L78 Accepts]: Start accepts. Automaton has 14742 states and 15754 transitions. Word has length 480 [2019-01-12 04:34:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:28,057 INFO L480 AbstractCegarLoop]: Abstraction has 14742 states and 15754 transitions. [2019-01-12 04:34:28,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 04:34:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 14742 states and 15754 transitions. [2019-01-12 04:34:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-01-12 04:34:28,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:28,087 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:28,088 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:28,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:28,088 INFO L82 PathProgramCache]: Analyzing trace with hash 130843868, now seen corresponding path program 1 times [2019-01-12 04:34:28,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:28,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:28,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-12 04:34:28,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:28,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:28,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:34:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:34:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:28,693 INFO L87 Difference]: Start difference. First operand 14742 states and 15754 transitions. Second operand 3 states. [2019-01-12 04:34:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:31,430 INFO L93 Difference]: Finished difference Result 31873 states and 34081 transitions. [2019-01-12 04:34:31,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:34:31,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 547 [2019-01-12 04:34:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:31,467 INFO L225 Difference]: With dead ends: 31873 [2019-01-12 04:34:31,467 INFO L226 Difference]: Without dead ends: 17133 [2019-01-12 04:34:31,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17133 states. [2019-01-12 04:34:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17133 to 15339. [2019-01-12 04:34:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-01-12 04:34:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 16352 transitions. [2019-01-12 04:34:31,685 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 16352 transitions. Word has length 547 [2019-01-12 04:34:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:31,686 INFO L480 AbstractCegarLoop]: Abstraction has 15339 states and 16352 transitions. [2019-01-12 04:34:31,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:34:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 16352 transitions. [2019-01-12 04:34:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2019-01-12 04:34:31,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:31,708 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:31,708 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash -148100372, now seen corresponding path program 1 times [2019-01-12 04:34:31,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:31,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:31,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:31,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:32,261 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-01-12 04:34:32,521 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-01-12 04:34:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 579 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-01-12 04:34:33,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:33,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:34:33,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:34:33,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:34:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:34:33,305 INFO L87 Difference]: Start difference. First operand 15339 states and 16352 transitions. Second operand 6 states. [2019-01-12 04:34:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:36,289 INFO L93 Difference]: Finished difference Result 32940 states and 35260 transitions. [2019-01-12 04:34:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:34:36,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 606 [2019-01-12 04:34:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:36,312 INFO L225 Difference]: With dead ends: 32940 [2019-01-12 04:34:36,313 INFO L226 Difference]: Without dead ends: 17603 [2019-01-12 04:34:36,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:34:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17603 states. [2019-01-12 04:34:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17603 to 15635. [2019-01-12 04:34:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15635 states. [2019-01-12 04:34:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15635 states to 15635 states and 16597 transitions. [2019-01-12 04:34:36,595 INFO L78 Accepts]: Start accepts. Automaton has 15635 states and 16597 transitions. Word has length 606 [2019-01-12 04:34:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:36,596 INFO L480 AbstractCegarLoop]: Abstraction has 15635 states and 16597 transitions. [2019-01-12 04:34:36,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:34:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 15635 states and 16597 transitions. [2019-01-12 04:34:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-01-12 04:34:36,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:36,613 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:36,613 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:36,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash -197861864, now seen corresponding path program 1 times [2019-01-12 04:34:36,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:36,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:36,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:36,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-01-12 04:34:37,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:37,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:37,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:34:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:34:37,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:37,310 INFO L87 Difference]: Start difference. First operand 15635 states and 16597 transitions. Second operand 3 states. [2019-01-12 04:34:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:39,577 INFO L93 Difference]: Finished difference Result 33658 states and 35646 transitions. [2019-01-12 04:34:39,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:34:39,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 684 [2019-01-12 04:34:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:39,600 INFO L225 Difference]: With dead ends: 33658 [2019-01-12 04:34:39,601 INFO L226 Difference]: Without dead ends: 15334 [2019-01-12 04:34:39,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15334 states. [2019-01-12 04:34:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15334 to 12942. [2019-01-12 04:34:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12942 states. [2019-01-12 04:34:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12942 states to 12942 states and 13527 transitions. [2019-01-12 04:34:39,981 INFO L78 Accepts]: Start accepts. Automaton has 12942 states and 13527 transitions. Word has length 684 [2019-01-12 04:34:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:39,982 INFO L480 AbstractCegarLoop]: Abstraction has 12942 states and 13527 transitions. [2019-01-12 04:34:39,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:34:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 12942 states and 13527 transitions. [2019-01-12 04:34:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-01-12 04:34:39,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:40,001 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:40,003 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1307477677, now seen corresponding path program 1 times [2019-01-12 04:34:40,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:40,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:40,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-01-12 04:34:40,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:40,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:40,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:34:40,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:34:40,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:40,602 INFO L87 Difference]: Start difference. First operand 12942 states and 13527 transitions. Second operand 3 states. [2019-01-12 04:34:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:42,481 INFO L93 Difference]: Finished difference Result 27074 states and 28342 transitions. [2019-01-12 04:34:42,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:34:42,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 702 [2019-01-12 04:34:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:42,498 INFO L225 Difference]: With dead ends: 27074 [2019-01-12 04:34:42,499 INFO L226 Difference]: Without dead ends: 15631 [2019-01-12 04:34:42,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15631 states. [2019-01-12 04:34:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15631 to 14136. [2019-01-12 04:34:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14136 states. [2019-01-12 04:34:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14136 states to 14136 states and 14725 transitions. [2019-01-12 04:34:42,677 INFO L78 Accepts]: Start accepts. Automaton has 14136 states and 14725 transitions. Word has length 702 [2019-01-12 04:34:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:42,678 INFO L480 AbstractCegarLoop]: Abstraction has 14136 states and 14725 transitions. [2019-01-12 04:34:42,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:34:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 14136 states and 14725 transitions. [2019-01-12 04:34:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-01-12 04:34:42,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:42,692 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:42,694 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2096571881, now seen corresponding path program 1 times [2019-01-12 04:34:42,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:42,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:42,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:42,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:43,392 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-12 04:34:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 394 proven. 58 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-12 04:34:43,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:34:43,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-12 04:34:43,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:44,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:34:46,318 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_70 Int)) (let ((.cse2 (mod v_prenex_70 18))) (let ((.cse1 (* 9 .cse2))) (let ((.cse0 (* 9 (div (+ .cse1 (- 864)) 10)))) (and (<= (div .cse0 10) c_~a0~0) (<= 0 .cse0) (= (mod (+ .cse1 6) 10) 0) (< v_prenex_70 0) (not (= 0 .cse2)) (<= (+ v_prenex_70 147) 0) (<= 0 (+ .cse0 9))))))) (exists ((v_prenex_32 Int)) (let ((.cse3 (mod v_prenex_32 18))) (let ((.cse5 (* 9 .cse3))) (let ((.cse4 (* 9 (div (+ .cse5 (- 864)) 10)))) (let ((.cse6 (+ .cse4 9))) (and (not (= 0 .cse3)) (not (= 0 (mod .cse4 10))) (<= (+ (div .cse4 10) 1) c_~a0~0) (= (mod (+ .cse5 6) 10) 0) (<= (+ v_prenex_32 147) 0) (< .cse4 0) (< v_prenex_32 0) (not (= (mod .cse6 10) 0)) (< .cse6 0))))))) (exists ((v_prenex_81 Int)) (let ((.cse8 (* 9 (mod v_prenex_81 18)))) (let ((.cse7 (* 9 (div (+ .cse8 (- 702)) 10)))) (and (<= 0 v_prenex_81) (<= (+ v_prenex_81 147) 0) (<= 0 (+ .cse7 9)) (<= 702 .cse8) (<= 0 .cse7) (<= (div .cse7 10) c_~a0~0))))) (exists ((v_prenex_74 Int)) (let ((.cse9 (mod v_prenex_74 18))) (let ((.cse12 (* 9 .cse9))) (let ((.cse10 (* 9 (div (+ .cse12 (- 702)) 10)))) (let ((.cse11 (+ .cse10 9))) (and (= 0 .cse9) (not (= 0 (mod .cse10 10))) (< .cse10 0) (<= (+ v_prenex_74 147) 0) (not (= (mod .cse11 10) 0)) (<= (+ (div .cse10 10) 1) c_~a0~0) (< .cse11 0) (<= 702 .cse12))))))) (exists ((v_prenex_85 Int)) (let ((.cse15 (mod v_prenex_85 18))) (let ((.cse14 (* 9 .cse15))) (let ((.cse13 (* 9 (div (+ .cse14 (- 864)) 10)))) (and (= (mod (+ .cse13 9) 10) 0) (<= (div .cse13 10) c_~a0~0) (< v_prenex_85 0) (= 0 (mod .cse13 10)) (<= (+ v_prenex_85 147) 0) (<= 864 .cse14) (not (= 0 .cse15))))))) (exists ((v_prenex_16 Int)) (let ((.cse18 (mod v_prenex_16 18))) (let ((.cse17 (* 9 .cse18))) (let ((.cse19 (* 9 (div (+ .cse17 (- 702)) 10)))) (let ((.cse16 (+ .cse19 9))) (and (<= (div .cse16 10) c_~a0~0) (not (= (mod (+ .cse17 8) 10) 0)) (<= (+ v_prenex_16 147) 0) (= 0 .cse18) (< .cse17 702) (= 0 (mod .cse19 10)) (<= 0 .cse16))))))) (exists ((v_prenex_88 Int)) (let ((.cse21 (* 9 (mod v_prenex_88 18)))) (let ((.cse20 (* 9 (div (+ .cse21 (- 702)) 10)))) (let ((.cse22 (+ .cse20 9))) (and (<= 0 v_prenex_88) (<= (div .cse20 10) c_~a0~0) (<= (+ v_prenex_88 147) 0) (= (mod (+ .cse21 8) 10) 0) (not (= (mod .cse22 10) 0)) (<= 0 .cse20) (< .cse22 0)))))) (exists ((v_prenex_17 Int)) (let ((.cse25 (mod v_prenex_17 18))) (let ((.cse23 (* 9 .cse25))) (let ((.cse24 (* 9 (div (+ .cse23 (- 702)) 10)))) (and (<= 702 .cse23) (<= 0 .cse24) (<= (div .cse24 10) c_~a0~0) (= 0 .cse25) (= (mod (+ .cse24 9) 10) 0) (<= (+ v_prenex_17 147) 0)))))) (exists ((v_prenex_78 Int)) (let ((.cse26 (* 9 (mod v_prenex_78 18)))) (let ((.cse27 (* 9 (div (+ .cse26 (- 702)) 10)))) (and (= (mod (+ .cse26 8) 10) 0) (= (mod (+ .cse27 9) 10) 0) (<= 0 v_prenex_78) (not (= 0 (mod .cse27 10))) (< .cse27 0) (<= (+ (div .cse27 10) 1) c_~a0~0) (<= (+ v_prenex_78 147) 0))))) (exists ((v_prenex_28 Int)) (let ((.cse28 (mod v_prenex_28 18))) (let ((.cse30 (* 9 .cse28))) (let ((.cse29 (* 9 (div (+ .cse30 (- 864)) 10)))) (and (not (= 0 .cse28)) (= (mod (+ .cse29 9) 10) 0) (= (mod (+ .cse30 6) 10) 0) (<= (div .cse29 10) c_~a0~0) (<= (+ v_prenex_28 147) 0) (= 0 (mod .cse29 10)) (< v_prenex_28 0)))))) (exists ((v_prenex_69 Int)) (let ((.cse33 (mod v_prenex_69 18))) (let ((.cse31 (* 9 .cse33))) (let ((.cse32 (* 9 (div (+ .cse31 (- 864)) 10)))) (and (<= (+ v_prenex_69 147) 0) (= (mod (+ .cse31 6) 10) 0) (= (mod (+ .cse32 9) 10) 0) (<= (+ (div .cse32 10) 1) c_~a0~0) (not (= 0 (mod .cse32 10))) (< .cse32 0) (not (= 0 .cse33)) (< v_prenex_69 0)))))) (exists ((v_prenex_80 Int)) (let ((.cse34 (* 9 (mod v_prenex_80 18)))) (let ((.cse36 (* 9 (div (+ .cse34 (- 702)) 10)))) (let ((.cse35 (+ .cse36 9))) (and (<= 0 v_prenex_80) (not (= (mod (+ .cse34 8) 10) 0)) (<= (div .cse35 10) c_~a0~0) (< .cse34 702) (<= (+ v_prenex_80 147) 0) (= 0 (mod .cse36 10)) (= (mod .cse35 10) 0)))))) (exists ((v_prenex_31 Int)) (let ((.cse39 (mod v_prenex_31 18))) (let ((.cse37 (* 9 .cse39))) (let ((.cse38 (* 9 (div (+ .cse37 (- 702)) 10)))) (and (= (mod (+ .cse37 8) 10) 0) (<= (div .cse38 10) c_~a0~0) (= 0 .cse39) (<= 0 (+ .cse38 9)) (<= (+ v_prenex_31 147) 0) (<= 0 .cse38)))))) (exists ((v_prenex_13 Int)) (let ((.cse43 (mod v_prenex_13 18))) (let ((.cse40 (* 9 .cse43))) (let ((.cse41 (* 9 (div (+ .cse40 (- 702)) 10)))) (let ((.cse42 (+ .cse41 9))) (and (< .cse40 702) (not (= 0 (mod .cse41 10))) (<= (+ v_prenex_13 147) 0) (not (= (mod (+ .cse40 8) 10) 0)) (< .cse41 0) (<= 0 .cse42) (= 0 .cse43) (<= (div .cse42 10) c_~a0~0))))))) (exists ((v_prenex_71 Int)) (let ((.cse45 (mod v_prenex_71 18))) (let ((.cse46 (* 9 .cse45))) (let ((.cse44 (* 9 (div (+ .cse46 (- 702)) 10)))) (and (<= 0 (+ .cse44 9)) (= 0 (mod .cse44 10)) (= 0 .cse45) (<= 702 .cse46) (<= (+ v_prenex_71 147) 0) (<= (div .cse44 10) c_~a0~0)))))) (exists ((v_prenex_44 Int)) (let ((.cse49 (* 9 (mod v_prenex_44 18)))) (let ((.cse48 (* 9 (div (+ .cse49 (- 702)) 10)))) (let ((.cse47 (+ .cse48 9))) (and (<= (+ v_prenex_44 147) 0) (not (= (mod .cse47 10) 0)) (<= 0 .cse48) (<= 0 v_prenex_44) (<= 702 .cse49) (<= (div .cse48 10) c_~a0~0) (< .cse47 0)))))) (exists ((v_prenex_61 Int)) (let ((.cse51 (* 9 (mod v_prenex_61 18)))) (let ((.cse50 (* 9 (div (+ .cse51 (- 702)) 10)))) (and (<= (div .cse50 10) c_~a0~0) (<= (+ v_prenex_61 147) 0) (<= 0 v_prenex_61) (= 0 (mod .cse50 10)) (= (mod (+ .cse51 8) 10) 0) (= (mod (+ .cse50 9) 10) 0))))) (exists ((v_prenex_24 Int)) (let ((.cse53 (mod v_prenex_24 18))) (let ((.cse55 (* 9 .cse53))) (let ((.cse52 (* 9 (div (+ .cse55 (- 864)) 10)))) (let ((.cse54 (+ .cse52 9))) (and (<= (div .cse52 10) c_~a0~0) (= 0 (mod .cse52 10)) (< v_prenex_24 0) (<= (+ v_prenex_24 147) 0) (not (= 0 .cse53)) (not (= (mod .cse54 10) 0)) (< .cse54 0) (<= 864 .cse55))))))) (exists ((v_prenex_64 Int)) (let ((.cse59 (mod v_prenex_64 18))) (let ((.cse58 (* 9 .cse59))) (let ((.cse57 (* 9 (div (+ .cse58 (- 864)) 10)))) (let ((.cse56 (+ .cse57 9))) (and (< v_prenex_64 0) (<= 0 .cse56) (= 0 (mod .cse57 10)) (not (= (mod (+ .cse58 6) 10) 0)) (not (= 0 .cse59)) (< .cse58 864) (<= (+ v_prenex_64 147) 0) (<= (div .cse56 10) c_~a0~0))))))) (exists ((v_prenex_55 Int)) (let ((.cse62 (mod v_prenex_55 18))) (let ((.cse61 (* 9 .cse62))) (let ((.cse60 (* 9 (div (+ .cse61 (- 864)) 10)))) (and (<= 0 .cse60) (<= (div .cse60 10) c_~a0~0) (<= 0 (+ .cse60 9)) (<= (+ v_prenex_55 147) 0) (< v_prenex_55 0) (<= 864 .cse61) (not (= 0 .cse62))))))) (exists ((v_prenex_37 Int)) (let ((.cse65 (* 9 (mod v_prenex_37 18)))) (let ((.cse64 (* 9 (div (+ .cse65 (- 702)) 10)))) (let ((.cse63 (+ .cse64 9))) (and (< .cse63 0) (not (= (mod .cse63 10) 0)) (<= (div .cse64 10) c_~a0~0) (<= 0 v_prenex_37) (<= (+ v_prenex_37 147) 0) (<= 702 .cse65) (= 0 (mod .cse64 10))))))) (exists ((v_prenex_9 Int)) (let ((.cse68 (mod v_prenex_9 18))) (let ((.cse66 (* 9 .cse68))) (let ((.cse67 (* 9 (div (+ .cse66 (- 864)) 10)))) (and (<= 864 .cse66) (<= (div .cse67 10) c_~a0~0) (<= 0 .cse67) (not (= 0 .cse68)) (<= (+ v_prenex_9 147) 0) (< v_prenex_9 0) (= (mod (+ .cse67 9) 10) 0)))))) (exists ((v_prenex_51 Int)) (let ((.cse70 (mod v_prenex_51 18))) (let ((.cse71 (* 9 .cse70))) (let ((.cse69 (* 9 (div (+ .cse71 (- 702)) 10)))) (and (<= (+ v_prenex_51 147) 0) (<= 0 .cse69) (= 0 .cse70) (<= 702 .cse71) (<= (div .cse69 10) c_~a0~0) (<= 0 (+ .cse69 9))))))) (exists ((v_prenex_52 Int)) (let ((.cse73 (* 9 (mod v_prenex_52 18)))) (let ((.cse72 (* 9 (div (+ .cse73 (- 702)) 10)))) (and (= (mod (+ .cse72 9) 10) 0) (< .cse72 0) (<= 702 .cse73) (not (= 0 (mod .cse72 10))) (<= (+ (div .cse72 10) 1) c_~a0~0) (<= (+ v_prenex_52 147) 0) (<= 0 v_prenex_52))))) (exists ((v_prenex_86 Int)) (let ((.cse76 (mod v_prenex_86 18))) (let ((.cse74 (* 9 .cse76))) (let ((.cse75 (* 9 (div (+ .cse74 (- 702)) 10)))) (and (<= (+ v_prenex_86 147) 0) (= (mod (+ .cse74 8) 10) 0) (<= (div .cse75 10) c_~a0~0) (= 0 .cse76) (= 0 (mod .cse75 10)) (= (mod (+ .cse75 9) 10) 0)))))) (exists ((v_prenex_20 Int)) (let ((.cse79 (* 9 (mod v_prenex_20 18)))) (let ((.cse77 (* 9 (div (+ .cse79 (- 702)) 10)))) (let ((.cse78 (+ .cse77 9))) (and (not (= 0 (mod .cse77 10))) (<= (+ (div .cse77 10) 1) c_~a0~0) (< .cse78 0) (= (mod (+ .cse79 8) 10) 0) (<= 0 v_prenex_20) (<= (+ v_prenex_20 147) 0) (not (= (mod .cse78 10) 0)) (< .cse77 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse80 (mod v_prenex_10 18))) (let ((.cse83 (* 9 .cse80))) (let ((.cse82 (* 9 (div (+ .cse83 (- 864)) 10)))) (let ((.cse81 (+ .cse82 9))) (and (not (= 0 .cse80)) (< .cse81 0) (<= 0 .cse82) (< v_prenex_10 0) (not (= (mod .cse81 10) 0)) (<= (div .cse82 10) c_~a0~0) (= (mod (+ .cse83 6) 10) 0) (<= (+ v_prenex_10 147) 0))))))) (exists ((v_prenex_38 Int)) (let ((.cse86 (* 9 (mod v_prenex_38 18)))) (let ((.cse84 (* 9 (div (+ .cse86 (- 702)) 10)))) (let ((.cse85 (+ .cse84 9))) (and (<= 0 .cse84) (not (= (mod .cse85 10) 0)) (not (= (mod (+ .cse86 8) 10) 0)) (< .cse86 702) (< .cse85 0) (<= (+ v_prenex_38 147) 0) (<= (+ (div .cse85 10) 1) c_~a0~0) (<= 0 v_prenex_38)))))) (exists ((v_prenex_50 Int)) (let ((.cse89 (mod v_prenex_50 18))) (let ((.cse88 (* 9 .cse89))) (let ((.cse87 (* 9 (div (+ .cse88 (- 702)) 10)))) (and (<= 0 .cse87) (<= (div .cse87 10) c_~a0~0) (<= (+ v_prenex_50 147) 0) (= (mod (+ .cse88 8) 10) 0) (= 0 .cse89) (= (mod (+ .cse87 9) 10) 0)))))) (exists ((v_prenex_54 Int)) (let ((.cse91 (* 9 (mod v_prenex_54 18)))) (let ((.cse90 (* 9 (div (+ .cse91 (- 702)) 10)))) (and (<= 0 v_prenex_54) (<= (+ v_prenex_54 147) 0) (= 0 (mod .cse90 10)) (= (mod (+ .cse90 9) 10) 0) (<= 702 .cse91) (<= (div .cse90 10) c_~a0~0))))) (exists ((v_prenex_72 Int)) (let ((.cse94 (mod v_prenex_72 18))) (let ((.cse93 (* 9 .cse94))) (let ((.cse92 (* 9 (div (+ .cse93 (- 864)) 10)))) (and (<= (+ (div .cse92 10) 1) c_~a0~0) (< .cse92 0) (<= 864 .cse93) (<= (+ v_prenex_72 147) 0) (< v_prenex_72 0) (not (= 0 (mod .cse92 10))) (not (= 0 .cse94)) (= (mod (+ .cse92 9) 10) 0)))))) (exists ((v_prenex_57 Int)) (let ((.cse95 (* 9 (mod v_prenex_57 18)))) (let ((.cse96 (* 9 (div (+ .cse95 (- 702)) 10)))) (and (<= 702 .cse95) (<= 0 v_prenex_57) (<= 0 .cse96) (= (mod (+ .cse96 9) 10) 0) (<= (+ v_prenex_57 147) 0) (<= (div .cse96 10) c_~a0~0))))) (exists ((v_prenex_39 Int)) (let ((.cse100 (mod v_prenex_39 18))) (let ((.cse97 (* 9 .cse100))) (let ((.cse99 (* 9 (div (+ .cse97 (- 864)) 10)))) (let ((.cse98 (+ .cse99 9))) (and (<= (+ v_prenex_39 147) 0) (< .cse97 864) (< v_prenex_39 0) (<= 0 .cse98) (<= (div .cse98 10) c_~a0~0) (<= 0 .cse99) (not (= 0 .cse100)) (not (= (mod (+ .cse97 6) 10) 0)))))))) (exists ((v_prenex_36 Int)) (let ((.cse101 (* 9 (mod v_prenex_36 18)))) (let ((.cse102 (* 9 (div (+ .cse101 (- 702)) 10)))) (and (<= (+ v_prenex_36 147) 0) (<= 702 .cse101) (<= 0 (+ .cse102 9)) (= 0 (mod .cse102 10)) (<= 0 v_prenex_36) (<= (div .cse102 10) c_~a0~0))))) (exists ((v_prenex_15 Int)) (let ((.cse105 (mod v_prenex_15 18))) (let ((.cse106 (* 9 .cse105))) (let ((.cse104 (* 9 (div (+ .cse106 (- 864)) 10)))) (let ((.cse103 (+ .cse104 9))) (and (<= (div .cse103 10) c_~a0~0) (not (= 0 (mod .cse104 10))) (= (mod .cse103 10) 0) (not (= 0 .cse105)) (< .cse106 864) (not (= (mod (+ .cse106 6) 10) 0)) (<= (+ v_prenex_15 147) 0) (< v_prenex_15 0) (< .cse104 0))))))) (exists ((v_prenex_12 Int)) (let ((.cse110 (mod v_prenex_12 18))) (let ((.cse108 (* 9 .cse110))) (let ((.cse109 (* 9 (div (+ .cse108 (- 702)) 10)))) (let ((.cse107 (+ .cse109 9))) (and (<= (+ v_prenex_12 147) 0) (not (= (mod .cse107 10) 0)) (<= (+ (div .cse107 10) 1) c_~a0~0) (not (= (mod (+ .cse108 8) 10) 0)) (<= 0 .cse109) (< .cse108 702) (= 0 .cse110) (< .cse107 0))))))) (exists ((v_~a0~0_826 Int)) (let ((.cse113 (mod v_~a0~0_826 18))) (let ((.cse112 (* 9 .cse113))) (let ((.cse111 (* 9 (div (+ .cse112 (- 702)) 10)))) (and (< .cse111 0) (<= (+ v_~a0~0_826 147) 0) (= (mod (+ .cse111 9) 10) 0) (<= (+ (div .cse111 10) 1) c_~a0~0) (= (mod (+ .cse112 8) 10) 0) (= 0 .cse113) (not (= 0 (mod .cse111 10)))))))) (exists ((v_prenex_30 Int)) (let ((.cse117 (mod v_prenex_30 18))) (let ((.cse115 (* 9 .cse117))) (let ((.cse116 (* 9 (div (+ .cse115 (- 864)) 10)))) (let ((.cse114 (+ .cse116 9))) (and (< v_prenex_30 0) (= (mod .cse114 10) 0) (< .cse115 864) (<= (div .cse114 10) c_~a0~0) (not (= (mod (+ .cse115 6) 10) 0)) (<= (+ v_prenex_30 147) 0) (= 0 (mod .cse116 10)) (not (= 0 .cse117)))))))) (exists ((v_prenex_83 Int)) (let ((.cse118 (mod v_prenex_83 18))) (let ((.cse120 (* 9 .cse118))) (let ((.cse119 (* 9 (div (+ .cse120 (- 702)) 10)))) (and (= 0 .cse118) (<= 0 (+ .cse119 9)) (<= (+ (div .cse119 10) 1) c_~a0~0) (not (= 0 (mod .cse119 10))) (< .cse119 0) (<= (+ v_prenex_83 147) 0) (<= 702 .cse120)))))) (exists ((v_prenex_46 Int)) (let ((.cse122 (* 9 (mod v_prenex_46 18)))) (let ((.cse121 (* 9 (div (+ .cse122 (- 702)) 10)))) (and (<= 0 .cse121) (<= 0 v_prenex_46) (= (mod (+ .cse122 8) 10) 0) (<= (+ v_prenex_46 147) 0) (<= (div .cse121 10) c_~a0~0) (<= 0 (+ .cse121 9)))))) (exists ((v_prenex_23 Int)) (let ((.cse126 (mod v_prenex_23 18))) (let ((.cse124 (* 9 .cse126))) (let ((.cse125 (* 9 (div (+ .cse124 (- 864)) 10)))) (let ((.cse123 (+ .cse125 9))) (and (<= (+ (div .cse123 10) 1) c_~a0~0) (not (= (mod (+ .cse124 6) 10) 0)) (< v_prenex_23 0) (< .cse125 0) (< .cse124 864) (not (= 0 (mod .cse125 10))) (not (= 0 .cse126)) (not (= (mod .cse123 10) 0)) (<= (+ v_prenex_23 147) 0) (< .cse123 0))))))) (exists ((v_prenex_25 Int)) (let ((.cse129 (mod v_prenex_25 18))) (let ((.cse128 (* 9 .cse129))) (let ((.cse127 (* 9 (div (+ .cse128 (- 864)) 10)))) (and (< v_prenex_25 0) (= 0 (mod .cse127 10)) (<= (div .cse127 10) c_~a0~0) (<= 0 (+ .cse127 9)) (= (mod (+ .cse128 6) 10) 0) (<= (+ v_prenex_25 147) 0) (not (= 0 .cse129))))))) (exists ((v_prenex_11 Int)) (let ((.cse132 (mod v_prenex_11 18))) (let ((.cse133 (* 9 .cse132))) (let ((.cse131 (* 9 (div (+ .cse133 (- 864)) 10)))) (let ((.cse130 (+ .cse131 9))) (and (< .cse130 0) (<= (div .cse131 10) c_~a0~0) (not (= (mod .cse130 10) 0)) (<= (+ v_prenex_11 147) 0) (< v_prenex_11 0) (= 0 (mod .cse131 10)) (not (= 0 .cse132)) (= (mod (+ .cse133 6) 10) 0))))))) (exists ((v_prenex_65 Int)) (let ((.cse137 (mod v_prenex_65 18))) (let ((.cse136 (* 9 .cse137))) (let ((.cse135 (* 9 (div (+ .cse136 (- 702)) 10)))) (let ((.cse134 (+ .cse135 9))) (and (< .cse134 0) (< .cse135 0) (not (= 0 (mod .cse135 10))) (<= (+ v_prenex_65 147) 0) (< .cse136 702) (<= (+ (div .cse134 10) 1) c_~a0~0) (not (= (mod (+ .cse136 8) 10) 0)) (not (= (mod .cse134 10) 0)) (= 0 .cse137))))))) (exists ((v_prenex_79 Int)) (let ((.cse139 (* 9 (mod v_prenex_79 18)))) (let ((.cse138 (* 9 (div (+ .cse139 (- 702)) 10)))) (and (<= 0 (+ .cse138 9)) (= 0 (mod .cse138 10)) (<= (+ v_prenex_79 147) 0) (<= (div .cse138 10) c_~a0~0) (<= 0 v_prenex_79) (= (mod (+ .cse139 8) 10) 0))))) (exists ((v_prenex_48 Int)) (let ((.cse142 (mod v_prenex_48 18))) (let ((.cse140 (* 9 .cse142))) (let ((.cse143 (* 9 (div (+ .cse140 (- 864)) 10)))) (let ((.cse141 (+ .cse143 9))) (and (not (= (mod (+ .cse140 6) 10) 0)) (< .cse141 0) (not (= 0 .cse142)) (< v_prenex_48 0) (not (= (mod .cse141 10) 0)) (< .cse140 864) (= 0 (mod .cse143 10)) (<= (+ v_prenex_48 147) 0) (<= (+ (div .cse141 10) 1) c_~a0~0))))))) (exists ((v_prenex_63 Int)) (let ((.cse147 (mod v_prenex_63 18))) (let ((.cse145 (* 9 .cse147))) (let ((.cse144 (* 9 (div (+ .cse145 (- 864)) 10)))) (let ((.cse146 (+ .cse144 9))) (and (< .cse144 0) (not (= 0 (mod .cse144 10))) (<= (+ v_prenex_63 147) 0) (< v_prenex_63 0) (< .cse145 864) (not (= (mod (+ .cse145 6) 10) 0)) (<= 0 .cse146) (not (= 0 .cse147)) (<= (div .cse146 10) c_~a0~0))))))) (exists ((v_prenex_76 Int)) (let ((.cse150 (* 9 (mod v_prenex_76 18)))) (let ((.cse149 (* 9 (div (+ .cse150 (- 702)) 10)))) (let ((.cse148 (+ .cse149 9))) (and (<= 0 .cse148) (not (= 0 (mod .cse149 10))) (<= 0 v_prenex_76) (<= (div .cse148 10) c_~a0~0) (not (= (mod (+ .cse150 8) 10) 0)) (<= (+ v_prenex_76 147) 0) (< .cse150 702) (< .cse149 0)))))) (exists ((v_prenex_62 Int)) (let ((.cse153 (mod v_prenex_62 18))) (let ((.cse152 (* 9 .cse153))) (let ((.cse154 (* 9 (div (+ .cse152 (- 702)) 10)))) (let ((.cse151 (+ .cse154 9))) (and (<= (+ (div .cse151 10) 1) c_~a0~0) (< .cse152 702) (= 0 .cse153) (not (= (mod (+ .cse152 8) 10) 0)) (<= (+ v_prenex_62 147) 0) (= 0 (mod .cse154 10)) (< .cse151 0) (not (= (mod .cse151 10) 0)))))))) (exists ((v_prenex_49 Int)) (let ((.cse156 (mod v_prenex_49 18))) (let ((.cse158 (* 9 .cse156))) (let ((.cse155 (* 9 (div (+ .cse158 (- 864)) 10)))) (let ((.cse157 (+ .cse155 9))) (and (< .cse155 0) (<= (+ v_prenex_49 147) 0) (not (= 0 (mod .cse155 10))) (<= (+ (div .cse155 10) 1) c_~a0~0) (not (= 0 .cse156)) (< v_prenex_49 0) (< .cse157 0) (<= 864 .cse158) (not (= (mod .cse157 10) 0)))))))) (exists ((v_prenex_66 Int)) (let ((.cse160 (* 9 (mod v_prenex_66 18)))) (let ((.cse161 (* 9 (div (+ .cse160 (- 702)) 10)))) (let ((.cse159 (+ .cse161 9))) (and (<= (div .cse159 10) c_~a0~0) (<= (+ v_prenex_66 147) 0) (<= 0 v_prenex_66) (< .cse160 702) (<= 0 .cse161) (not (= (mod (+ .cse160 8) 10) 0)) (= (mod .cse159 10) 0)))))) (exists ((v_prenex_53 Int)) (let ((.cse163 (* 9 (mod v_prenex_53 18)))) (let ((.cse162 (* 9 (div (+ .cse163 (- 702)) 10)))) (and (<= 0 v_prenex_53) (<= 0 .cse162) (<= (+ v_prenex_53 147) 0) (= (mod (+ .cse163 8) 10) 0) (= (mod (+ .cse162 9) 10) 0) (<= (div .cse162 10) c_~a0~0))))) (exists ((v_prenex_33 Int)) (let ((.cse167 (mod v_prenex_33 18))) (let ((.cse165 (* 9 .cse167))) (let ((.cse164 (* 9 (div (+ .cse165 (- 702)) 10)))) (let ((.cse166 (+ .cse164 9))) (and (<= 0 .cse164) (= (mod (+ .cse165 8) 10) 0) (not (= (mod .cse166 10) 0)) (<= (div .cse164 10) c_~a0~0) (= 0 .cse167) (< .cse166 0) (<= (+ v_prenex_33 147) 0))))))) (exists ((v_prenex_82 Int)) (let ((.cse169 (* 9 (mod v_prenex_82 18)))) (let ((.cse168 (* 9 (div (+ .cse169 (- 702)) 10)))) (and (<= 0 (+ .cse168 9)) (<= (+ v_prenex_82 147) 0) (<= (+ (div .cse168 10) 1) c_~a0~0) (= (mod (+ .cse169 8) 10) 0) (<= 0 v_prenex_82) (< .cse168 0) (not (= 0 (mod .cse168 10))))))) (exists ((v_prenex_43 Int)) (let ((.cse170 (mod v_prenex_43 18))) (let ((.cse171 (* 9 .cse170))) (let ((.cse172 (* 9 (div (+ .cse171 (- 702)) 10)))) (let ((.cse173 (+ .cse172 9))) (and (= 0 .cse170) (not (= (mod (+ .cse171 8) 10) 0)) (= 0 (mod .cse172 10)) (= (mod .cse173 10) 0) (<= (div .cse173 10) c_~a0~0) (<= (+ v_prenex_43 147) 0) (< .cse171 702))))))) (exists ((v_prenex_19 Int)) (let ((.cse175 (mod v_prenex_19 18))) (let ((.cse176 (* 9 .cse175))) (let ((.cse174 (* 9 (div (+ .cse176 (- 864)) 10)))) (and (not (= 0 (mod .cse174 10))) (< .cse174 0) (not (= 0 .cse175)) (<= (+ (div .cse174 10) 1) c_~a0~0) (< v_prenex_19 0) (= (mod (+ .cse176 6) 10) 0) (<= 0 (+ .cse174 9)) (<= (+ v_prenex_19 147) 0)))))) (exists ((v_prenex_34 Int)) (let ((.cse179 (* 9 (mod v_prenex_34 18)))) (let ((.cse178 (* 9 (div (+ .cse179 (- 702)) 10)))) (let ((.cse177 (+ .cse178 9))) (and (not (= (mod .cse177 10) 0)) (<= 0 v_prenex_34) (<= (+ (div .cse178 10) 1) c_~a0~0) (< .cse177 0) (< .cse178 0) (<= (+ v_prenex_34 147) 0) (not (= 0 (mod .cse178 10))) (<= 702 .cse179)))))) (exists ((v_prenex_18 Int)) (let ((.cse181 (* 9 (mod v_prenex_18 18)))) (let ((.cse182 (* 9 (div (+ .cse181 (- 702)) 10)))) (let ((.cse180 (+ .cse182 9))) (and (<= 0 v_prenex_18) (< .cse180 0) (<= (+ v_prenex_18 147) 0) (not (= (mod (+ .cse181 8) 10) 0)) (<= (+ (div .cse180 10) 1) c_~a0~0) (not (= 0 (mod .cse182 10))) (< .cse181 702) (not (= (mod .cse180 10) 0)) (< .cse182 0)))))) (exists ((v_prenex_14 Int)) (let ((.cse186 (mod v_prenex_14 18))) (let ((.cse183 (* 9 .cse186))) (let ((.cse185 (* 9 (div (+ .cse183 (- 702)) 10)))) (let ((.cse184 (+ .cse185 9))) (and (not (= (mod (+ .cse183 8) 10) 0)) (= (mod .cse184 10) 0) (not (= 0 (mod .cse185 10))) (<= (div .cse184 10) c_~a0~0) (< .cse183 702) (= 0 .cse186) (< .cse185 0) (<= (+ v_prenex_14 147) 0))))))) (exists ((v_prenex_27 Int)) (let ((.cse187 (* 9 (mod v_prenex_27 18)))) (let ((.cse189 (* 9 (div (+ .cse187 (- 702)) 10)))) (let ((.cse188 (+ .cse189 9))) (and (< .cse187 702) (<= 0 .cse188) (<= (+ v_prenex_27 147) 0) (<= (div .cse188 10) c_~a0~0) (<= 0 v_prenex_27) (<= 0 .cse189) (not (= (mod (+ .cse187 8) 10) 0))))))) (exists ((v_prenex_77 Int)) (let ((.cse193 (mod v_prenex_77 18))) (let ((.cse191 (* 9 .cse193))) (let ((.cse190 (* 9 (div (+ .cse191 (- 702)) 10)))) (let ((.cse192 (+ .cse190 9))) (and (not (= 0 (mod .cse190 10))) (= (mod (+ .cse191 8) 10) 0) (not (= (mod .cse192 10) 0)) (< .cse192 0) (= 0 .cse193) (<= (+ v_prenex_77 147) 0) (< .cse190 0) (<= (+ (div .cse190 10) 1) c_~a0~0))))))) (exists ((v_prenex_60 Int)) (let ((.cse196 (mod v_prenex_60 18))) (let ((.cse195 (* 9 .cse196))) (let ((.cse194 (* 9 (div (+ .cse195 (- 702)) 10)))) (and (< .cse194 0) (<= 702 .cse195) (= (mod (+ .cse194 9) 10) 0) (<= (+ v_prenex_60 147) 0) (not (= 0 (mod .cse194 10))) (<= (+ (div .cse194 10) 1) c_~a0~0) (= 0 .cse196)))))) (exists ((v_prenex_84 Int)) (let ((.cse199 (mod v_prenex_84 18))) (let ((.cse198 (* 9 .cse199))) (let ((.cse197 (* 9 (div (+ .cse198 (- 702)) 10)))) (let ((.cse200 (+ .cse197 9))) (and (<= 0 .cse197) (< .cse198 702) (= 0 .cse199) (<= (div .cse200 10) c_~a0~0) (<= 0 .cse200) (not (= (mod (+ .cse198 8) 10) 0)) (<= (+ v_prenex_84 147) 0))))))) (exists ((v_prenex_56 Int)) (let ((.cse201 (mod v_prenex_56 18))) (let ((.cse203 (* 9 .cse201))) (let ((.cse202 (* 9 (div (+ .cse203 (- 702)) 10)))) (and (= 0 .cse201) (not (= 0 (mod .cse202 10))) (<= (+ (div .cse202 10) 1) c_~a0~0) (= (mod (+ .cse203 8) 10) 0) (<= 0 (+ .cse202 9)) (<= (+ v_prenex_56 147) 0) (< .cse202 0)))))) (exists ((v_prenex_26 Int)) (let ((.cse204 (* 9 (mod v_prenex_26 18)))) (let ((.cse205 (* 9 (div (+ .cse204 (- 702)) 10)))) (let ((.cse206 (+ .cse205 9))) (and (not (= (mod (+ .cse204 8) 10) 0)) (< .cse205 0) (= (mod .cse206 10) 0) (<= (div .cse206 10) c_~a0~0) (<= 0 v_prenex_26) (<= (+ v_prenex_26 147) 0) (not (= 0 (mod .cse205 10))) (< .cse204 702)))))) (exists ((v_prenex_41 Int)) (let ((.cse207 (* 9 (mod v_prenex_41 18)))) (let ((.cse208 (* 9 (div (+ .cse207 (- 702)) 10)))) (let ((.cse209 (+ .cse208 9))) (and (= (mod (+ .cse207 8) 10) 0) (<= (div .cse208 10) c_~a0~0) (<= (+ v_prenex_41 147) 0) (not (= (mod .cse209 10) 0)) (= 0 (mod .cse208 10)) (<= 0 v_prenex_41) (< .cse209 0)))))) (exists ((v_prenex_73 Int)) (let ((.cse213 (mod v_prenex_73 18))) (let ((.cse212 (* 9 .cse213))) (let ((.cse210 (* 9 (div (+ .cse212 (- 702)) 10)))) (let ((.cse211 (+ .cse210 9))) (and (<= 0 .cse210) (<= (div .cse211 10) c_~a0~0) (not (= (mod (+ .cse212 8) 10) 0)) (= 0 .cse213) (= (mod .cse211 10) 0) (<= (+ v_prenex_73 147) 0) (< .cse212 702))))))) (exists ((v_prenex_68 Int)) (let ((.cse215 (mod v_prenex_68 18))) (let ((.cse216 (* 9 .cse215))) (let ((.cse214 (* 9 (div (+ .cse216 (- 702)) 10)))) (and (= 0 (mod .cse214 10)) (<= (+ v_prenex_68 147) 0) (= 0 .cse215) (<= (div .cse214 10) c_~a0~0) (<= 702 .cse216) (= (mod (+ .cse214 9) 10) 0)))))) (exists ((v_prenex_67 Int)) (let ((.cse220 (mod v_prenex_67 18))) (let ((.cse217 (* 9 .cse220))) (let ((.cse219 (* 9 (div (+ .cse217 (- 864)) 10)))) (let ((.cse218 (+ .cse219 9))) (and (< .cse217 864) (not (= (mod (+ .cse217 6) 10) 0)) (<= (+ (div .cse218 10) 1) c_~a0~0) (< v_prenex_67 0) (< .cse218 0) (<= (+ v_prenex_67 147) 0) (<= 0 .cse219) (not (= 0 .cse220)) (not (= (mod .cse218 10) 0)))))))) (exists ((v_prenex_35 Int)) (let ((.cse221 (mod v_prenex_35 18))) (let ((.cse222 (* 9 .cse221))) (let ((.cse223 (* 9 (div (+ .cse222 (- 864)) 10)))) (and (<= (+ v_prenex_35 147) 0) (not (= 0 .cse221)) (<= 864 .cse222) (<= 0 (+ .cse223 9)) (< v_prenex_35 0) (<= (div .cse223 10) c_~a0~0) (= 0 (mod .cse223 10))))))) (exists ((v_prenex_58 Int)) (let ((.cse226 (mod v_prenex_58 18))) (let ((.cse227 (* 9 .cse226))) (let ((.cse224 (* 9 (div (+ .cse227 (- 864)) 10)))) (let ((.cse225 (+ .cse224 9))) (and (< v_prenex_58 0) (<= 0 .cse224) (<= (div .cse225 10) c_~a0~0) (= (mod .cse225 10) 0) (not (= 0 .cse226)) (not (= (mod (+ .cse227 6) 10) 0)) (<= (+ v_prenex_58 147) 0) (< .cse227 864))))))) (exists ((v_prenex_47 Int)) (let ((.cse229 (* 9 (mod v_prenex_47 18)))) (let ((.cse228 (* 9 (div (+ .cse229 (- 702)) 10)))) (and (<= (+ (div .cse228 10) 1) c_~a0~0) (<= 702 .cse229) (< .cse228 0) (not (= 0 (mod .cse228 10))) (<= 0 v_prenex_47) (<= (+ v_prenex_47 147) 0) (<= 0 (+ .cse228 9)))))) (exists ((v_prenex_42 Int)) (let ((.cse232 (mod v_prenex_42 18))) (let ((.cse230 (* 9 .cse232))) (let ((.cse231 (* 9 (div (+ .cse230 (- 864)) 10)))) (and (<= 864 .cse230) (<= 0 (+ .cse231 9)) (not (= 0 .cse232)) (< v_prenex_42 0) (<= (+ (div .cse231 10) 1) c_~a0~0) (<= (+ v_prenex_42 147) 0) (< .cse231 0) (not (= 0 (mod .cse231 10)))))))) (exists ((v_prenex_87 Int)) (let ((.cse235 (* 9 (mod v_prenex_87 18)))) (let ((.cse234 (* 9 (div (+ .cse235 (- 702)) 10)))) (let ((.cse233 (+ .cse234 9))) (and (<= (+ v_prenex_87 147) 0) (< .cse233 0) (= 0 (mod .cse234 10)) (not (= (mod (+ .cse235 8) 10) 0)) (<= 0 v_prenex_87) (<= (+ (div .cse233 10) 1) c_~a0~0) (not (= (mod .cse233 10) 0)) (< .cse235 702)))))) (exists ((v_prenex_40 Int)) (let ((.cse237 (mod v_prenex_40 18))) (let ((.cse238 (* 9 .cse237))) (let ((.cse236 (* 9 (div (+ .cse238 (- 864)) 10)))) (and (<= (div .cse236 10) c_~a0~0) (= (mod (+ .cse236 9) 10) 0) (<= (+ v_prenex_40 147) 0) (< v_prenex_40 0) (<= 0 .cse236) (not (= 0 .cse237)) (= (mod (+ .cse238 6) 10) 0)))))) (exists ((v_prenex_75 Int)) (let ((.cse241 (mod v_prenex_75 18))) (let ((.cse240 (* 9 .cse241))) (let ((.cse242 (* 9 (div (+ .cse240 (- 702)) 10)))) (let ((.cse239 (+ .cse242 9))) (and (not (= (mod .cse239 10) 0)) (<= 702 .cse240) (<= (+ v_prenex_75 147) 0) (< .cse239 0) (= 0 .cse241) (<= (div .cse242 10) c_~a0~0) (= 0 (mod .cse242 10)))))))) (exists ((v_prenex_22 Int)) (let ((.cse245 (mod v_prenex_22 18))) (let ((.cse246 (* 9 .cse245))) (let ((.cse243 (* 9 (div (+ .cse246 (- 702)) 10)))) (let ((.cse244 (+ .cse243 9))) (and (<= 0 .cse243) (< .cse244 0) (<= (div .cse243 10) c_~a0~0) (= 0 .cse245) (<= (+ v_prenex_22 147) 0) (<= 702 .cse246) (not (= (mod .cse244 10) 0)))))))) (exists ((v_prenex_59 Int)) (let ((.cse247 (mod v_prenex_59 18))) (let ((.cse249 (* 9 .cse247))) (let ((.cse250 (* 9 (div (+ .cse249 (- 864)) 10)))) (let ((.cse248 (+ .cse250 9))) (and (not (= 0 .cse247)) (not (= (mod .cse248 10) 0)) (<= 864 .cse249) (<= 0 .cse250) (< .cse248 0) (< v_prenex_59 0) (<= (div .cse250 10) c_~a0~0) (<= (+ v_prenex_59 147) 0))))))) (exists ((v_prenex_45 Int)) (let ((.cse253 (mod v_prenex_45 18))) (let ((.cse254 (* 9 .cse253))) (let ((.cse252 (* 9 (div (+ .cse254 (- 702)) 10)))) (let ((.cse251 (+ .cse252 9))) (and (< .cse251 0) (= 0 (mod .cse252 10)) (not (= (mod .cse251 10) 0)) (= 0 .cse253) (= (mod (+ .cse254 8) 10) 0) (<= (div .cse252 10) c_~a0~0) (<= (+ v_prenex_45 147) 0))))))) (exists ((v_prenex_21 Int)) (let ((.cse255 (* 9 (mod v_prenex_21 18)))) (let ((.cse257 (* 9 (div (+ .cse255 (- 702)) 10)))) (let ((.cse256 (+ .cse257 9))) (and (not (= (mod (+ .cse255 8) 10) 0)) (<= (div .cse256 10) c_~a0~0) (= 0 (mod .cse257 10)) (<= (+ v_prenex_21 147) 0) (<= 0 .cse256) (< .cse255 702) (<= 0 v_prenex_21)))))) (exists ((v_prenex_29 Int)) (let ((.cse260 (mod v_prenex_29 18))) (let ((.cse258 (* 9 .cse260))) (let ((.cse259 (* 9 (div (+ .cse258 (- 702)) 10)))) (and (= (mod (+ .cse258 8) 10) 0) (<= 0 (+ .cse259 9)) (= 0 .cse260) (= 0 (mod .cse259 10)) (<= (+ v_prenex_29 147) 0) (<= (div .cse259 10) c_~a0~0))))))) is different from false [2019-01-12 04:35:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-01-12 04:35:23,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:23,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-01-12 04:35:23,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:35:23,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:35:23,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2019-01-12 04:35:23,935 INFO L87 Difference]: Start difference. First operand 14136 states and 14725 transitions. Second operand 7 states. [2019-01-12 04:35:28,511 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~a0~0 75)) (or (exists ((v_prenex_70 Int)) (let ((.cse2 (mod v_prenex_70 18))) (let ((.cse1 (* 9 .cse2))) (let ((.cse0 (* 9 (div (+ .cse1 (- 864)) 10)))) (and (<= (div .cse0 10) c_~a0~0) (<= 0 .cse0) (= (mod (+ .cse1 6) 10) 0) (< v_prenex_70 0) (not (= 0 .cse2)) (<= (+ v_prenex_70 147) 0) (<= 0 (+ .cse0 9))))))) (exists ((v_prenex_32 Int)) (let ((.cse3 (mod v_prenex_32 18))) (let ((.cse5 (* 9 .cse3))) (let ((.cse4 (* 9 (div (+ .cse5 (- 864)) 10)))) (let ((.cse6 (+ .cse4 9))) (and (not (= 0 .cse3)) (not (= 0 (mod .cse4 10))) (<= (+ (div .cse4 10) 1) c_~a0~0) (= (mod (+ .cse5 6) 10) 0) (<= (+ v_prenex_32 147) 0) (< .cse4 0) (< v_prenex_32 0) (not (= (mod .cse6 10) 0)) (< .cse6 0))))))) (exists ((v_prenex_81 Int)) (let ((.cse8 (* 9 (mod v_prenex_81 18)))) (let ((.cse7 (* 9 (div (+ .cse8 (- 702)) 10)))) (and (<= 0 v_prenex_81) (<= (+ v_prenex_81 147) 0) (<= 0 (+ .cse7 9)) (<= 702 .cse8) (<= 0 .cse7) (<= (div .cse7 10) c_~a0~0))))) (exists ((v_prenex_74 Int)) (let ((.cse9 (mod v_prenex_74 18))) (let ((.cse12 (* 9 .cse9))) (let ((.cse10 (* 9 (div (+ .cse12 (- 702)) 10)))) (let ((.cse11 (+ .cse10 9))) (and (= 0 .cse9) (not (= 0 (mod .cse10 10))) (< .cse10 0) (<= (+ v_prenex_74 147) 0) (not (= (mod .cse11 10) 0)) (<= (+ (div .cse10 10) 1) c_~a0~0) (< .cse11 0) (<= 702 .cse12))))))) (exists ((v_prenex_85 Int)) (let ((.cse15 (mod v_prenex_85 18))) (let ((.cse14 (* 9 .cse15))) (let ((.cse13 (* 9 (div (+ .cse14 (- 864)) 10)))) (and (= (mod (+ .cse13 9) 10) 0) (<= (div .cse13 10) c_~a0~0) (< v_prenex_85 0) (= 0 (mod .cse13 10)) (<= (+ v_prenex_85 147) 0) (<= 864 .cse14) (not (= 0 .cse15))))))) (exists ((v_prenex_16 Int)) (let ((.cse18 (mod v_prenex_16 18))) (let ((.cse17 (* 9 .cse18))) (let ((.cse19 (* 9 (div (+ .cse17 (- 702)) 10)))) (let ((.cse16 (+ .cse19 9))) (and (<= (div .cse16 10) c_~a0~0) (not (= (mod (+ .cse17 8) 10) 0)) (<= (+ v_prenex_16 147) 0) (= 0 .cse18) (< .cse17 702) (= 0 (mod .cse19 10)) (<= 0 .cse16))))))) (exists ((v_prenex_88 Int)) (let ((.cse21 (* 9 (mod v_prenex_88 18)))) (let ((.cse20 (* 9 (div (+ .cse21 (- 702)) 10)))) (let ((.cse22 (+ .cse20 9))) (and (<= 0 v_prenex_88) (<= (div .cse20 10) c_~a0~0) (<= (+ v_prenex_88 147) 0) (= (mod (+ .cse21 8) 10) 0) (not (= (mod .cse22 10) 0)) (<= 0 .cse20) (< .cse22 0)))))) (exists ((v_prenex_17 Int)) (let ((.cse25 (mod v_prenex_17 18))) (let ((.cse23 (* 9 .cse25))) (let ((.cse24 (* 9 (div (+ .cse23 (- 702)) 10)))) (and (<= 702 .cse23) (<= 0 .cse24) (<= (div .cse24 10) c_~a0~0) (= 0 .cse25) (= (mod (+ .cse24 9) 10) 0) (<= (+ v_prenex_17 147) 0)))))) (exists ((v_prenex_78 Int)) (let ((.cse26 (* 9 (mod v_prenex_78 18)))) (let ((.cse27 (* 9 (div (+ .cse26 (- 702)) 10)))) (and (= (mod (+ .cse26 8) 10) 0) (= (mod (+ .cse27 9) 10) 0) (<= 0 v_prenex_78) (not (= 0 (mod .cse27 10))) (< .cse27 0) (<= (+ (div .cse27 10) 1) c_~a0~0) (<= (+ v_prenex_78 147) 0))))) (exists ((v_prenex_28 Int)) (let ((.cse28 (mod v_prenex_28 18))) (let ((.cse30 (* 9 .cse28))) (let ((.cse29 (* 9 (div (+ .cse30 (- 864)) 10)))) (and (not (= 0 .cse28)) (= (mod (+ .cse29 9) 10) 0) (= (mod (+ .cse30 6) 10) 0) (<= (div .cse29 10) c_~a0~0) (<= (+ v_prenex_28 147) 0) (= 0 (mod .cse29 10)) (< v_prenex_28 0)))))) (exists ((v_prenex_69 Int)) (let ((.cse33 (mod v_prenex_69 18))) (let ((.cse31 (* 9 .cse33))) (let ((.cse32 (* 9 (div (+ .cse31 (- 864)) 10)))) (and (<= (+ v_prenex_69 147) 0) (= (mod (+ .cse31 6) 10) 0) (= (mod (+ .cse32 9) 10) 0) (<= (+ (div .cse32 10) 1) c_~a0~0) (not (= 0 (mod .cse32 10))) (< .cse32 0) (not (= 0 .cse33)) (< v_prenex_69 0)))))) (exists ((v_prenex_80 Int)) (let ((.cse34 (* 9 (mod v_prenex_80 18)))) (let ((.cse36 (* 9 (div (+ .cse34 (- 702)) 10)))) (let ((.cse35 (+ .cse36 9))) (and (<= 0 v_prenex_80) (not (= (mod (+ .cse34 8) 10) 0)) (<= (div .cse35 10) c_~a0~0) (< .cse34 702) (<= (+ v_prenex_80 147) 0) (= 0 (mod .cse36 10)) (= (mod .cse35 10) 0)))))) (exists ((v_prenex_31 Int)) (let ((.cse39 (mod v_prenex_31 18))) (let ((.cse37 (* 9 .cse39))) (let ((.cse38 (* 9 (div (+ .cse37 (- 702)) 10)))) (and (= (mod (+ .cse37 8) 10) 0) (<= (div .cse38 10) c_~a0~0) (= 0 .cse39) (<= 0 (+ .cse38 9)) (<= (+ v_prenex_31 147) 0) (<= 0 .cse38)))))) (exists ((v_prenex_13 Int)) (let ((.cse43 (mod v_prenex_13 18))) (let ((.cse40 (* 9 .cse43))) (let ((.cse41 (* 9 (div (+ .cse40 (- 702)) 10)))) (let ((.cse42 (+ .cse41 9))) (and (< .cse40 702) (not (= 0 (mod .cse41 10))) (<= (+ v_prenex_13 147) 0) (not (= (mod (+ .cse40 8) 10) 0)) (< .cse41 0) (<= 0 .cse42) (= 0 .cse43) (<= (div .cse42 10) c_~a0~0))))))) (exists ((v_prenex_71 Int)) (let ((.cse45 (mod v_prenex_71 18))) (let ((.cse46 (* 9 .cse45))) (let ((.cse44 (* 9 (div (+ .cse46 (- 702)) 10)))) (and (<= 0 (+ .cse44 9)) (= 0 (mod .cse44 10)) (= 0 .cse45) (<= 702 .cse46) (<= (+ v_prenex_71 147) 0) (<= (div .cse44 10) c_~a0~0)))))) (exists ((v_prenex_44 Int)) (let ((.cse49 (* 9 (mod v_prenex_44 18)))) (let ((.cse48 (* 9 (div (+ .cse49 (- 702)) 10)))) (let ((.cse47 (+ .cse48 9))) (and (<= (+ v_prenex_44 147) 0) (not (= (mod .cse47 10) 0)) (<= 0 .cse48) (<= 0 v_prenex_44) (<= 702 .cse49) (<= (div .cse48 10) c_~a0~0) (< .cse47 0)))))) (exists ((v_prenex_61 Int)) (let ((.cse51 (* 9 (mod v_prenex_61 18)))) (let ((.cse50 (* 9 (div (+ .cse51 (- 702)) 10)))) (and (<= (div .cse50 10) c_~a0~0) (<= (+ v_prenex_61 147) 0) (<= 0 v_prenex_61) (= 0 (mod .cse50 10)) (= (mod (+ .cse51 8) 10) 0) (= (mod (+ .cse50 9) 10) 0))))) (exists ((v_prenex_24 Int)) (let ((.cse53 (mod v_prenex_24 18))) (let ((.cse55 (* 9 .cse53))) (let ((.cse52 (* 9 (div (+ .cse55 (- 864)) 10)))) (let ((.cse54 (+ .cse52 9))) (and (<= (div .cse52 10) c_~a0~0) (= 0 (mod .cse52 10)) (< v_prenex_24 0) (<= (+ v_prenex_24 147) 0) (not (= 0 .cse53)) (not (= (mod .cse54 10) 0)) (< .cse54 0) (<= 864 .cse55))))))) (exists ((v_prenex_64 Int)) (let ((.cse59 (mod v_prenex_64 18))) (let ((.cse58 (* 9 .cse59))) (let ((.cse57 (* 9 (div (+ .cse58 (- 864)) 10)))) (let ((.cse56 (+ .cse57 9))) (and (< v_prenex_64 0) (<= 0 .cse56) (= 0 (mod .cse57 10)) (not (= (mod (+ .cse58 6) 10) 0)) (not (= 0 .cse59)) (< .cse58 864) (<= (+ v_prenex_64 147) 0) (<= (div .cse56 10) c_~a0~0))))))) (exists ((v_prenex_55 Int)) (let ((.cse62 (mod v_prenex_55 18))) (let ((.cse61 (* 9 .cse62))) (let ((.cse60 (* 9 (div (+ .cse61 (- 864)) 10)))) (and (<= 0 .cse60) (<= (div .cse60 10) c_~a0~0) (<= 0 (+ .cse60 9)) (<= (+ v_prenex_55 147) 0) (< v_prenex_55 0) (<= 864 .cse61) (not (= 0 .cse62))))))) (exists ((v_prenex_37 Int)) (let ((.cse65 (* 9 (mod v_prenex_37 18)))) (let ((.cse64 (* 9 (div (+ .cse65 (- 702)) 10)))) (let ((.cse63 (+ .cse64 9))) (and (< .cse63 0) (not (= (mod .cse63 10) 0)) (<= (div .cse64 10) c_~a0~0) (<= 0 v_prenex_37) (<= (+ v_prenex_37 147) 0) (<= 702 .cse65) (= 0 (mod .cse64 10))))))) (exists ((v_prenex_9 Int)) (let ((.cse68 (mod v_prenex_9 18))) (let ((.cse66 (* 9 .cse68))) (let ((.cse67 (* 9 (div (+ .cse66 (- 864)) 10)))) (and (<= 864 .cse66) (<= (div .cse67 10) c_~a0~0) (<= 0 .cse67) (not (= 0 .cse68)) (<= (+ v_prenex_9 147) 0) (< v_prenex_9 0) (= (mod (+ .cse67 9) 10) 0)))))) (exists ((v_prenex_51 Int)) (let ((.cse70 (mod v_prenex_51 18))) (let ((.cse71 (* 9 .cse70))) (let ((.cse69 (* 9 (div (+ .cse71 (- 702)) 10)))) (and (<= (+ v_prenex_51 147) 0) (<= 0 .cse69) (= 0 .cse70) (<= 702 .cse71) (<= (div .cse69 10) c_~a0~0) (<= 0 (+ .cse69 9))))))) (exists ((v_prenex_52 Int)) (let ((.cse73 (* 9 (mod v_prenex_52 18)))) (let ((.cse72 (* 9 (div (+ .cse73 (- 702)) 10)))) (and (= (mod (+ .cse72 9) 10) 0) (< .cse72 0) (<= 702 .cse73) (not (= 0 (mod .cse72 10))) (<= (+ (div .cse72 10) 1) c_~a0~0) (<= (+ v_prenex_52 147) 0) (<= 0 v_prenex_52))))) (exists ((v_prenex_86 Int)) (let ((.cse76 (mod v_prenex_86 18))) (let ((.cse74 (* 9 .cse76))) (let ((.cse75 (* 9 (div (+ .cse74 (- 702)) 10)))) (and (<= (+ v_prenex_86 147) 0) (= (mod (+ .cse74 8) 10) 0) (<= (div .cse75 10) c_~a0~0) (= 0 .cse76) (= 0 (mod .cse75 10)) (= (mod (+ .cse75 9) 10) 0)))))) (exists ((v_prenex_20 Int)) (let ((.cse79 (* 9 (mod v_prenex_20 18)))) (let ((.cse77 (* 9 (div (+ .cse79 (- 702)) 10)))) (let ((.cse78 (+ .cse77 9))) (and (not (= 0 (mod .cse77 10))) (<= (+ (div .cse77 10) 1) c_~a0~0) (< .cse78 0) (= (mod (+ .cse79 8) 10) 0) (<= 0 v_prenex_20) (<= (+ v_prenex_20 147) 0) (not (= (mod .cse78 10) 0)) (< .cse77 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse80 (mod v_prenex_10 18))) (let ((.cse83 (* 9 .cse80))) (let ((.cse82 (* 9 (div (+ .cse83 (- 864)) 10)))) (let ((.cse81 (+ .cse82 9))) (and (not (= 0 .cse80)) (< .cse81 0) (<= 0 .cse82) (< v_prenex_10 0) (not (= (mod .cse81 10) 0)) (<= (div .cse82 10) c_~a0~0) (= (mod (+ .cse83 6) 10) 0) (<= (+ v_prenex_10 147) 0))))))) (exists ((v_prenex_38 Int)) (let ((.cse86 (* 9 (mod v_prenex_38 18)))) (let ((.cse84 (* 9 (div (+ .cse86 (- 702)) 10)))) (let ((.cse85 (+ .cse84 9))) (and (<= 0 .cse84) (not (= (mod .cse85 10) 0)) (not (= (mod (+ .cse86 8) 10) 0)) (< .cse86 702) (< .cse85 0) (<= (+ v_prenex_38 147) 0) (<= (+ (div .cse85 10) 1) c_~a0~0) (<= 0 v_prenex_38)))))) (exists ((v_prenex_50 Int)) (let ((.cse89 (mod v_prenex_50 18))) (let ((.cse88 (* 9 .cse89))) (let ((.cse87 (* 9 (div (+ .cse88 (- 702)) 10)))) (and (<= 0 .cse87) (<= (div .cse87 10) c_~a0~0) (<= (+ v_prenex_50 147) 0) (= (mod (+ .cse88 8) 10) 0) (= 0 .cse89) (= (mod (+ .cse87 9) 10) 0)))))) (exists ((v_prenex_54 Int)) (let ((.cse91 (* 9 (mod v_prenex_54 18)))) (let ((.cse90 (* 9 (div (+ .cse91 (- 702)) 10)))) (and (<= 0 v_prenex_54) (<= (+ v_prenex_54 147) 0) (= 0 (mod .cse90 10)) (= (mod (+ .cse90 9) 10) 0) (<= 702 .cse91) (<= (div .cse90 10) c_~a0~0))))) (exists ((v_prenex_72 Int)) (let ((.cse94 (mod v_prenex_72 18))) (let ((.cse93 (* 9 .cse94))) (let ((.cse92 (* 9 (div (+ .cse93 (- 864)) 10)))) (and (<= (+ (div .cse92 10) 1) c_~a0~0) (< .cse92 0) (<= 864 .cse93) (<= (+ v_prenex_72 147) 0) (< v_prenex_72 0) (not (= 0 (mod .cse92 10))) (not (= 0 .cse94)) (= (mod (+ .cse92 9) 10) 0)))))) (exists ((v_prenex_57 Int)) (let ((.cse95 (* 9 (mod v_prenex_57 18)))) (let ((.cse96 (* 9 (div (+ .cse95 (- 702)) 10)))) (and (<= 702 .cse95) (<= 0 v_prenex_57) (<= 0 .cse96) (= (mod (+ .cse96 9) 10) 0) (<= (+ v_prenex_57 147) 0) (<= (div .cse96 10) c_~a0~0))))) (exists ((v_prenex_39 Int)) (let ((.cse100 (mod v_prenex_39 18))) (let ((.cse97 (* 9 .cse100))) (let ((.cse99 (* 9 (div (+ .cse97 (- 864)) 10)))) (let ((.cse98 (+ .cse99 9))) (and (<= (+ v_prenex_39 147) 0) (< .cse97 864) (< v_prenex_39 0) (<= 0 .cse98) (<= (div .cse98 10) c_~a0~0) (<= 0 .cse99) (not (= 0 .cse100)) (not (= (mod (+ .cse97 6) 10) 0)))))))) (exists ((v_prenex_36 Int)) (let ((.cse101 (* 9 (mod v_prenex_36 18)))) (let ((.cse102 (* 9 (div (+ .cse101 (- 702)) 10)))) (and (<= (+ v_prenex_36 147) 0) (<= 702 .cse101) (<= 0 (+ .cse102 9)) (= 0 (mod .cse102 10)) (<= 0 v_prenex_36) (<= (div .cse102 10) c_~a0~0))))) (exists ((v_prenex_15 Int)) (let ((.cse105 (mod v_prenex_15 18))) (let ((.cse106 (* 9 .cse105))) (let ((.cse104 (* 9 (div (+ .cse106 (- 864)) 10)))) (let ((.cse103 (+ .cse104 9))) (and (<= (div .cse103 10) c_~a0~0) (not (= 0 (mod .cse104 10))) (= (mod .cse103 10) 0) (not (= 0 .cse105)) (< .cse106 864) (not (= (mod (+ .cse106 6) 10) 0)) (<= (+ v_prenex_15 147) 0) (< v_prenex_15 0) (< .cse104 0))))))) (exists ((v_prenex_12 Int)) (let ((.cse110 (mod v_prenex_12 18))) (let ((.cse108 (* 9 .cse110))) (let ((.cse109 (* 9 (div (+ .cse108 (- 702)) 10)))) (let ((.cse107 (+ .cse109 9))) (and (<= (+ v_prenex_12 147) 0) (not (= (mod .cse107 10) 0)) (<= (+ (div .cse107 10) 1) c_~a0~0) (not (= (mod (+ .cse108 8) 10) 0)) (<= 0 .cse109) (< .cse108 702) (= 0 .cse110) (< .cse107 0))))))) (exists ((v_~a0~0_826 Int)) (let ((.cse113 (mod v_~a0~0_826 18))) (let ((.cse112 (* 9 .cse113))) (let ((.cse111 (* 9 (div (+ .cse112 (- 702)) 10)))) (and (< .cse111 0) (<= (+ v_~a0~0_826 147) 0) (= (mod (+ .cse111 9) 10) 0) (<= (+ (div .cse111 10) 1) c_~a0~0) (= (mod (+ .cse112 8) 10) 0) (= 0 .cse113) (not (= 0 (mod .cse111 10)))))))) (exists ((v_prenex_30 Int)) (let ((.cse117 (mod v_prenex_30 18))) (let ((.cse115 (* 9 .cse117))) (let ((.cse116 (* 9 (div (+ .cse115 (- 864)) 10)))) (let ((.cse114 (+ .cse116 9))) (and (< v_prenex_30 0) (= (mod .cse114 10) 0) (< .cse115 864) (<= (div .cse114 10) c_~a0~0) (not (= (mod (+ .cse115 6) 10) 0)) (<= (+ v_prenex_30 147) 0) (= 0 (mod .cse116 10)) (not (= 0 .cse117)))))))) (exists ((v_prenex_83 Int)) (let ((.cse118 (mod v_prenex_83 18))) (let ((.cse120 (* 9 .cse118))) (let ((.cse119 (* 9 (div (+ .cse120 (- 702)) 10)))) (and (= 0 .cse118) (<= 0 (+ .cse119 9)) (<= (+ (div .cse119 10) 1) c_~a0~0) (not (= 0 (mod .cse119 10))) (< .cse119 0) (<= (+ v_prenex_83 147) 0) (<= 702 .cse120)))))) (exists ((v_prenex_46 Int)) (let ((.cse122 (* 9 (mod v_prenex_46 18)))) (let ((.cse121 (* 9 (div (+ .cse122 (- 702)) 10)))) (and (<= 0 .cse121) (<= 0 v_prenex_46) (= (mod (+ .cse122 8) 10) 0) (<= (+ v_prenex_46 147) 0) (<= (div .cse121 10) c_~a0~0) (<= 0 (+ .cse121 9)))))) (exists ((v_prenex_23 Int)) (let ((.cse126 (mod v_prenex_23 18))) (let ((.cse124 (* 9 .cse126))) (let ((.cse125 (* 9 (div (+ .cse124 (- 864)) 10)))) (let ((.cse123 (+ .cse125 9))) (and (<= (+ (div .cse123 10) 1) c_~a0~0) (not (= (mod (+ .cse124 6) 10) 0)) (< v_prenex_23 0) (< .cse125 0) (< .cse124 864) (not (= 0 (mod .cse125 10))) (not (= 0 .cse126)) (not (= (mod .cse123 10) 0)) (<= (+ v_prenex_23 147) 0) (< .cse123 0))))))) (exists ((v_prenex_25 Int)) (let ((.cse129 (mod v_prenex_25 18))) (let ((.cse128 (* 9 .cse129))) (let ((.cse127 (* 9 (div (+ .cse128 (- 864)) 10)))) (and (< v_prenex_25 0) (= 0 (mod .cse127 10)) (<= (div .cse127 10) c_~a0~0) (<= 0 (+ .cse127 9)) (= (mod (+ .cse128 6) 10) 0) (<= (+ v_prenex_25 147) 0) (not (= 0 .cse129))))))) (exists ((v_prenex_11 Int)) (let ((.cse132 (mod v_prenex_11 18))) (let ((.cse133 (* 9 .cse132))) (let ((.cse131 (* 9 (div (+ .cse133 (- 864)) 10)))) (let ((.cse130 (+ .cse131 9))) (and (< .cse130 0) (<= (div .cse131 10) c_~a0~0) (not (= (mod .cse130 10) 0)) (<= (+ v_prenex_11 147) 0) (< v_prenex_11 0) (= 0 (mod .cse131 10)) (not (= 0 .cse132)) (= (mod (+ .cse133 6) 10) 0))))))) (exists ((v_prenex_65 Int)) (let ((.cse137 (mod v_prenex_65 18))) (let ((.cse136 (* 9 .cse137))) (let ((.cse135 (* 9 (div (+ .cse136 (- 702)) 10)))) (let ((.cse134 (+ .cse135 9))) (and (< .cse134 0) (< .cse135 0) (not (= 0 (mod .cse135 10))) (<= (+ v_prenex_65 147) 0) (< .cse136 702) (<= (+ (div .cse134 10) 1) c_~a0~0) (not (= (mod (+ .cse136 8) 10) 0)) (not (= (mod .cse134 10) 0)) (= 0 .cse137))))))) (exists ((v_prenex_79 Int)) (let ((.cse139 (* 9 (mod v_prenex_79 18)))) (let ((.cse138 (* 9 (div (+ .cse139 (- 702)) 10)))) (and (<= 0 (+ .cse138 9)) (= 0 (mod .cse138 10)) (<= (+ v_prenex_79 147) 0) (<= (div .cse138 10) c_~a0~0) (<= 0 v_prenex_79) (= (mod (+ .cse139 8) 10) 0))))) (exists ((v_prenex_48 Int)) (let ((.cse142 (mod v_prenex_48 18))) (let ((.cse140 (* 9 .cse142))) (let ((.cse143 (* 9 (div (+ .cse140 (- 864)) 10)))) (let ((.cse141 (+ .cse143 9))) (and (not (= (mod (+ .cse140 6) 10) 0)) (< .cse141 0) (not (= 0 .cse142)) (< v_prenex_48 0) (not (= (mod .cse141 10) 0)) (< .cse140 864) (= 0 (mod .cse143 10)) (<= (+ v_prenex_48 147) 0) (<= (+ (div .cse141 10) 1) c_~a0~0))))))) (exists ((v_prenex_63 Int)) (let ((.cse147 (mod v_prenex_63 18))) (let ((.cse145 (* 9 .cse147))) (let ((.cse144 (* 9 (div (+ .cse145 (- 864)) 10)))) (let ((.cse146 (+ .cse144 9))) (and (< .cse144 0) (not (= 0 (mod .cse144 10))) (<= (+ v_prenex_63 147) 0) (< v_prenex_63 0) (< .cse145 864) (not (= (mod (+ .cse145 6) 10) 0)) (<= 0 .cse146) (not (= 0 .cse147)) (<= (div .cse146 10) c_~a0~0))))))) (exists ((v_prenex_76 Int)) (let ((.cse150 (* 9 (mod v_prenex_76 18)))) (let ((.cse149 (* 9 (div (+ .cse150 (- 702)) 10)))) (let ((.cse148 (+ .cse149 9))) (and (<= 0 .cse148) (not (= 0 (mod .cse149 10))) (<= 0 v_prenex_76) (<= (div .cse148 10) c_~a0~0) (not (= (mod (+ .cse150 8) 10) 0)) (<= (+ v_prenex_76 147) 0) (< .cse150 702) (< .cse149 0)))))) (exists ((v_prenex_62 Int)) (let ((.cse153 (mod v_prenex_62 18))) (let ((.cse152 (* 9 .cse153))) (let ((.cse154 (* 9 (div (+ .cse152 (- 702)) 10)))) (let ((.cse151 (+ .cse154 9))) (and (<= (+ (div .cse151 10) 1) c_~a0~0) (< .cse152 702) (= 0 .cse153) (not (= (mod (+ .cse152 8) 10) 0)) (<= (+ v_prenex_62 147) 0) (= 0 (mod .cse154 10)) (< .cse151 0) (not (= (mod .cse151 10) 0)))))))) (exists ((v_prenex_49 Int)) (let ((.cse156 (mod v_prenex_49 18))) (let ((.cse158 (* 9 .cse156))) (let ((.cse155 (* 9 (div (+ .cse158 (- 864)) 10)))) (let ((.cse157 (+ .cse155 9))) (and (< .cse155 0) (<= (+ v_prenex_49 147) 0) (not (= 0 (mod .cse155 10))) (<= (+ (div .cse155 10) 1) c_~a0~0) (not (= 0 .cse156)) (< v_prenex_49 0) (< .cse157 0) (<= 864 .cse158) (not (= (mod .cse157 10) 0)))))))) (exists ((v_prenex_66 Int)) (let ((.cse160 (* 9 (mod v_prenex_66 18)))) (let ((.cse161 (* 9 (div (+ .cse160 (- 702)) 10)))) (let ((.cse159 (+ .cse161 9))) (and (<= (div .cse159 10) c_~a0~0) (<= (+ v_prenex_66 147) 0) (<= 0 v_prenex_66) (< .cse160 702) (<= 0 .cse161) (not (= (mod (+ .cse160 8) 10) 0)) (= (mod .cse159 10) 0)))))) (exists ((v_prenex_53 Int)) (let ((.cse163 (* 9 (mod v_prenex_53 18)))) (let ((.cse162 (* 9 (div (+ .cse163 (- 702)) 10)))) (and (<= 0 v_prenex_53) (<= 0 .cse162) (<= (+ v_prenex_53 147) 0) (= (mod (+ .cse163 8) 10) 0) (= (mod (+ .cse162 9) 10) 0) (<= (div .cse162 10) c_~a0~0))))) (exists ((v_prenex_33 Int)) (let ((.cse167 (mod v_prenex_33 18))) (let ((.cse165 (* 9 .cse167))) (let ((.cse164 (* 9 (div (+ .cse165 (- 702)) 10)))) (let ((.cse166 (+ .cse164 9))) (and (<= 0 .cse164) (= (mod (+ .cse165 8) 10) 0) (not (= (mod .cse166 10) 0)) (<= (div .cse164 10) c_~a0~0) (= 0 .cse167) (< .cse166 0) (<= (+ v_prenex_33 147) 0))))))) (exists ((v_prenex_82 Int)) (let ((.cse169 (* 9 (mod v_prenex_82 18)))) (let ((.cse168 (* 9 (div (+ .cse169 (- 702)) 10)))) (and (<= 0 (+ .cse168 9)) (<= (+ v_prenex_82 147) 0) (<= (+ (div .cse168 10) 1) c_~a0~0) (= (mod (+ .cse169 8) 10) 0) (<= 0 v_prenex_82) (< .cse168 0) (not (= 0 (mod .cse168 10))))))) (exists ((v_prenex_43 Int)) (let ((.cse170 (mod v_prenex_43 18))) (let ((.cse171 (* 9 .cse170))) (let ((.cse172 (* 9 (div (+ .cse171 (- 702)) 10)))) (let ((.cse173 (+ .cse172 9))) (and (= 0 .cse170) (not (= (mod (+ .cse171 8) 10) 0)) (= 0 (mod .cse172 10)) (= (mod .cse173 10) 0) (<= (div .cse173 10) c_~a0~0) (<= (+ v_prenex_43 147) 0) (< .cse171 702))))))) (exists ((v_prenex_19 Int)) (let ((.cse175 (mod v_prenex_19 18))) (let ((.cse176 (* 9 .cse175))) (let ((.cse174 (* 9 (div (+ .cse176 (- 864)) 10)))) (and (not (= 0 (mod .cse174 10))) (< .cse174 0) (not (= 0 .cse175)) (<= (+ (div .cse174 10) 1) c_~a0~0) (< v_prenex_19 0) (= (mod (+ .cse176 6) 10) 0) (<= 0 (+ .cse174 9)) (<= (+ v_prenex_19 147) 0)))))) (exists ((v_prenex_34 Int)) (let ((.cse179 (* 9 (mod v_prenex_34 18)))) (let ((.cse178 (* 9 (div (+ .cse179 (- 702)) 10)))) (let ((.cse177 (+ .cse178 9))) (and (not (= (mod .cse177 10) 0)) (<= 0 v_prenex_34) (<= (+ (div .cse178 10) 1) c_~a0~0) (< .cse177 0) (< .cse178 0) (<= (+ v_prenex_34 147) 0) (not (= 0 (mod .cse178 10))) (<= 702 .cse179)))))) (exists ((v_prenex_18 Int)) (let ((.cse181 (* 9 (mod v_prenex_18 18)))) (let ((.cse182 (* 9 (div (+ .cse181 (- 702)) 10)))) (let ((.cse180 (+ .cse182 9))) (and (<= 0 v_prenex_18) (< .cse180 0) (<= (+ v_prenex_18 147) 0) (not (= (mod (+ .cse181 8) 10) 0)) (<= (+ (div .cse180 10) 1) c_~a0~0) (not (= 0 (mod .cse182 10))) (< .cse181 702) (not (= (mod .cse180 10) 0)) (< .cse182 0)))))) (exists ((v_prenex_14 Int)) (let ((.cse186 (mod v_prenex_14 18))) (let ((.cse183 (* 9 .cse186))) (let ((.cse185 (* 9 (div (+ .cse183 (- 702)) 10)))) (let ((.cse184 (+ .cse185 9))) (and (not (= (mod (+ .cse183 8) 10) 0)) (= (mod .cse184 10) 0) (not (= 0 (mod .cse185 10))) (<= (div .cse184 10) c_~a0~0) (< .cse183 702) (= 0 .cse186) (< .cse185 0) (<= (+ v_prenex_14 147) 0))))))) (exists ((v_prenex_27 Int)) (let ((.cse187 (* 9 (mod v_prenex_27 18)))) (let ((.cse189 (* 9 (div (+ .cse187 (- 702)) 10)))) (let ((.cse188 (+ .cse189 9))) (and (< .cse187 702) (<= 0 .cse188) (<= (+ v_prenex_27 147) 0) (<= (div .cse188 10) c_~a0~0) (<= 0 v_prenex_27) (<= 0 .cse189) (not (= (mod (+ .cse187 8) 10) 0))))))) (exists ((v_prenex_77 Int)) (let ((.cse193 (mod v_prenex_77 18))) (let ((.cse191 (* 9 .cse193))) (let ((.cse190 (* 9 (div (+ .cse191 (- 702)) 10)))) (let ((.cse192 (+ .cse190 9))) (and (not (= 0 (mod .cse190 10))) (= (mod (+ .cse191 8) 10) 0) (not (= (mod .cse192 10) 0)) (< .cse192 0) (= 0 .cse193) (<= (+ v_prenex_77 147) 0) (< .cse190 0) (<= (+ (div .cse190 10) 1) c_~a0~0))))))) (exists ((v_prenex_60 Int)) (let ((.cse196 (mod v_prenex_60 18))) (let ((.cse195 (* 9 .cse196))) (let ((.cse194 (* 9 (div (+ .cse195 (- 702)) 10)))) (and (< .cse194 0) (<= 702 .cse195) (= (mod (+ .cse194 9) 10) 0) (<= (+ v_prenex_60 147) 0) (not (= 0 (mod .cse194 10))) (<= (+ (div .cse194 10) 1) c_~a0~0) (= 0 .cse196)))))) (exists ((v_prenex_84 Int)) (let ((.cse199 (mod v_prenex_84 18))) (let ((.cse198 (* 9 .cse199))) (let ((.cse197 (* 9 (div (+ .cse198 (- 702)) 10)))) (let ((.cse200 (+ .cse197 9))) (and (<= 0 .cse197) (< .cse198 702) (= 0 .cse199) (<= (div .cse200 10) c_~a0~0) (<= 0 .cse200) (not (= (mod (+ .cse198 8) 10) 0)) (<= (+ v_prenex_84 147) 0))))))) (exists ((v_prenex_56 Int)) (let ((.cse201 (mod v_prenex_56 18))) (let ((.cse203 (* 9 .cse201))) (let ((.cse202 (* 9 (div (+ .cse203 (- 702)) 10)))) (and (= 0 .cse201) (not (= 0 (mod .cse202 10))) (<= (+ (div .cse202 10) 1) c_~a0~0) (= (mod (+ .cse203 8) 10) 0) (<= 0 (+ .cse202 9)) (<= (+ v_prenex_56 147) 0) (< .cse202 0)))))) (exists ((v_prenex_26 Int)) (let ((.cse204 (* 9 (mod v_prenex_26 18)))) (let ((.cse205 (* 9 (div (+ .cse204 (- 702)) 10)))) (let ((.cse206 (+ .cse205 9))) (and (not (= (mod (+ .cse204 8) 10) 0)) (< .cse205 0) (= (mod .cse206 10) 0) (<= (div .cse206 10) c_~a0~0) (<= 0 v_prenex_26) (<= (+ v_prenex_26 147) 0) (not (= 0 (mod .cse205 10))) (< .cse204 702)))))) (exists ((v_prenex_41 Int)) (let ((.cse207 (* 9 (mod v_prenex_41 18)))) (let ((.cse208 (* 9 (div (+ .cse207 (- 702)) 10)))) (let ((.cse209 (+ .cse208 9))) (and (= (mod (+ .cse207 8) 10) 0) (<= (div .cse208 10) c_~a0~0) (<= (+ v_prenex_41 147) 0) (not (= (mod .cse209 10) 0)) (= 0 (mod .cse208 10)) (<= 0 v_prenex_41) (< .cse209 0)))))) (exists ((v_prenex_73 Int)) (let ((.cse213 (mod v_prenex_73 18))) (let ((.cse212 (* 9 .cse213))) (let ((.cse210 (* 9 (div (+ .cse212 (- 702)) 10)))) (let ((.cse211 (+ .cse210 9))) (and (<= 0 .cse210) (<= (div .cse211 10) c_~a0~0) (not (= (mod (+ .cse212 8) 10) 0)) (= 0 .cse213) (= (mod .cse211 10) 0) (<= (+ v_prenex_73 147) 0) (< .cse212 702))))))) (exists ((v_prenex_68 Int)) (let ((.cse215 (mod v_prenex_68 18))) (let ((.cse216 (* 9 .cse215))) (let ((.cse214 (* 9 (div (+ .cse216 (- 702)) 10)))) (and (= 0 (mod .cse214 10)) (<= (+ v_prenex_68 147) 0) (= 0 .cse215) (<= (div .cse214 10) c_~a0~0) (<= 702 .cse216) (= (mod (+ .cse214 9) 10) 0)))))) (exists ((v_prenex_67 Int)) (let ((.cse220 (mod v_prenex_67 18))) (let ((.cse217 (* 9 .cse220))) (let ((.cse219 (* 9 (div (+ .cse217 (- 864)) 10)))) (let ((.cse218 (+ .cse219 9))) (and (< .cse217 864) (not (= (mod (+ .cse217 6) 10) 0)) (<= (+ (div .cse218 10) 1) c_~a0~0) (< v_prenex_67 0) (< .cse218 0) (<= (+ v_prenex_67 147) 0) (<= 0 .cse219) (not (= 0 .cse220)) (not (= (mod .cse218 10) 0)))))))) (exists ((v_prenex_35 Int)) (let ((.cse221 (mod v_prenex_35 18))) (let ((.cse222 (* 9 .cse221))) (let ((.cse223 (* 9 (div (+ .cse222 (- 864)) 10)))) (and (<= (+ v_prenex_35 147) 0) (not (= 0 .cse221)) (<= 864 .cse222) (<= 0 (+ .cse223 9)) (< v_prenex_35 0) (<= (div .cse223 10) c_~a0~0) (= 0 (mod .cse223 10))))))) (exists ((v_prenex_58 Int)) (let ((.cse226 (mod v_prenex_58 18))) (let ((.cse227 (* 9 .cse226))) (let ((.cse224 (* 9 (div (+ .cse227 (- 864)) 10)))) (let ((.cse225 (+ .cse224 9))) (and (< v_prenex_58 0) (<= 0 .cse224) (<= (div .cse225 10) c_~a0~0) (= (mod .cse225 10) 0) (not (= 0 .cse226)) (not (= (mod (+ .cse227 6) 10) 0)) (<= (+ v_prenex_58 147) 0) (< .cse227 864))))))) (exists ((v_prenex_47 Int)) (let ((.cse229 (* 9 (mod v_prenex_47 18)))) (let ((.cse228 (* 9 (div (+ .cse229 (- 702)) 10)))) (and (<= (+ (div .cse228 10) 1) c_~a0~0) (<= 702 .cse229) (< .cse228 0) (not (= 0 (mod .cse228 10))) (<= 0 v_prenex_47) (<= (+ v_prenex_47 147) 0) (<= 0 (+ .cse228 9)))))) (exists ((v_prenex_42 Int)) (let ((.cse232 (mod v_prenex_42 18))) (let ((.cse230 (* 9 .cse232))) (let ((.cse231 (* 9 (div (+ .cse230 (- 864)) 10)))) (and (<= 864 .cse230) (<= 0 (+ .cse231 9)) (not (= 0 .cse232)) (< v_prenex_42 0) (<= (+ (div .cse231 10) 1) c_~a0~0) (<= (+ v_prenex_42 147) 0) (< .cse231 0) (not (= 0 (mod .cse231 10)))))))) (exists ((v_prenex_87 Int)) (let ((.cse235 (* 9 (mod v_prenex_87 18)))) (let ((.cse234 (* 9 (div (+ .cse235 (- 702)) 10)))) (let ((.cse233 (+ .cse234 9))) (and (<= (+ v_prenex_87 147) 0) (< .cse233 0) (= 0 (mod .cse234 10)) (not (= (mod (+ .cse235 8) 10) 0)) (<= 0 v_prenex_87) (<= (+ (div .cse233 10) 1) c_~a0~0) (not (= (mod .cse233 10) 0)) (< .cse235 702)))))) (exists ((v_prenex_40 Int)) (let ((.cse237 (mod v_prenex_40 18))) (let ((.cse238 (* 9 .cse237))) (let ((.cse236 (* 9 (div (+ .cse238 (- 864)) 10)))) (and (<= (div .cse236 10) c_~a0~0) (= (mod (+ .cse236 9) 10) 0) (<= (+ v_prenex_40 147) 0) (< v_prenex_40 0) (<= 0 .cse236) (not (= 0 .cse237)) (= (mod (+ .cse238 6) 10) 0)))))) (exists ((v_prenex_75 Int)) (let ((.cse241 (mod v_prenex_75 18))) (let ((.cse240 (* 9 .cse241))) (let ((.cse242 (* 9 (div (+ .cse240 (- 702)) 10)))) (let ((.cse239 (+ .cse242 9))) (and (not (= (mod .cse239 10) 0)) (<= 702 .cse240) (<= (+ v_prenex_75 147) 0) (< .cse239 0) (= 0 .cse241) (<= (div .cse242 10) c_~a0~0) (= 0 (mod .cse242 10)))))))) (exists ((v_prenex_22 Int)) (let ((.cse245 (mod v_prenex_22 18))) (let ((.cse246 (* 9 .cse245))) (let ((.cse243 (* 9 (div (+ .cse246 (- 702)) 10)))) (let ((.cse244 (+ .cse243 9))) (and (<= 0 .cse243) (< .cse244 0) (<= (div .cse243 10) c_~a0~0) (= 0 .cse245) (<= (+ v_prenex_22 147) 0) (<= 702 .cse246) (not (= (mod .cse244 10) 0)))))))) (exists ((v_prenex_59 Int)) (let ((.cse247 (mod v_prenex_59 18))) (let ((.cse249 (* 9 .cse247))) (let ((.cse250 (* 9 (div (+ .cse249 (- 864)) 10)))) (let ((.cse248 (+ .cse250 9))) (and (not (= 0 .cse247)) (not (= (mod .cse248 10) 0)) (<= 864 .cse249) (<= 0 .cse250) (< .cse248 0) (< v_prenex_59 0) (<= (div .cse250 10) c_~a0~0) (<= (+ v_prenex_59 147) 0))))))) (exists ((v_prenex_45 Int)) (let ((.cse253 (mod v_prenex_45 18))) (let ((.cse254 (* 9 .cse253))) (let ((.cse252 (* 9 (div (+ .cse254 (- 702)) 10)))) (let ((.cse251 (+ .cse252 9))) (and (< .cse251 0) (= 0 (mod .cse252 10)) (not (= (mod .cse251 10) 0)) (= 0 .cse253) (= (mod (+ .cse254 8) 10) 0) (<= (div .cse252 10) c_~a0~0) (<= (+ v_prenex_45 147) 0))))))) (exists ((v_prenex_21 Int)) (let ((.cse255 (* 9 (mod v_prenex_21 18)))) (let ((.cse257 (* 9 (div (+ .cse255 (- 702)) 10)))) (let ((.cse256 (+ .cse257 9))) (and (not (= (mod (+ .cse255 8) 10) 0)) (<= (div .cse256 10) c_~a0~0) (= 0 (mod .cse257 10)) (<= (+ v_prenex_21 147) 0) (<= 0 .cse256) (< .cse255 702) (<= 0 v_prenex_21)))))) (exists ((v_prenex_29 Int)) (let ((.cse260 (mod v_prenex_29 18))) (let ((.cse258 (* 9 .cse260))) (let ((.cse259 (* 9 (div (+ .cse258 (- 702)) 10)))) (and (= (mod (+ .cse258 8) 10) 0) (<= 0 (+ .cse259 9)) (= 0 .cse260) (= 0 (mod .cse259 10)) (<= (+ v_prenex_29 147) 0) (<= (div .cse259 10) c_~a0~0)))))))) is different from false [2019-01-12 04:35:30,678 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 (+ c_~a0~0 98)) (or (exists ((v_prenex_70 Int)) (let ((.cse2 (mod v_prenex_70 18))) (let ((.cse1 (* 9 .cse2))) (let ((.cse0 (* 9 (div (+ .cse1 (- 864)) 10)))) (and (<= (div .cse0 10) c_~a0~0) (<= 0 .cse0) (= (mod (+ .cse1 6) 10) 0) (< v_prenex_70 0) (not (= 0 .cse2)) (<= (+ v_prenex_70 147) 0) (<= 0 (+ .cse0 9))))))) (exists ((v_prenex_32 Int)) (let ((.cse3 (mod v_prenex_32 18))) (let ((.cse5 (* 9 .cse3))) (let ((.cse4 (* 9 (div (+ .cse5 (- 864)) 10)))) (let ((.cse6 (+ .cse4 9))) (and (not (= 0 .cse3)) (not (= 0 (mod .cse4 10))) (<= (+ (div .cse4 10) 1) c_~a0~0) (= (mod (+ .cse5 6) 10) 0) (<= (+ v_prenex_32 147) 0) (< .cse4 0) (< v_prenex_32 0) (not (= (mod .cse6 10) 0)) (< .cse6 0))))))) (exists ((v_prenex_81 Int)) (let ((.cse8 (* 9 (mod v_prenex_81 18)))) (let ((.cse7 (* 9 (div (+ .cse8 (- 702)) 10)))) (and (<= 0 v_prenex_81) (<= (+ v_prenex_81 147) 0) (<= 0 (+ .cse7 9)) (<= 702 .cse8) (<= 0 .cse7) (<= (div .cse7 10) c_~a0~0))))) (exists ((v_prenex_74 Int)) (let ((.cse9 (mod v_prenex_74 18))) (let ((.cse12 (* 9 .cse9))) (let ((.cse10 (* 9 (div (+ .cse12 (- 702)) 10)))) (let ((.cse11 (+ .cse10 9))) (and (= 0 .cse9) (not (= 0 (mod .cse10 10))) (< .cse10 0) (<= (+ v_prenex_74 147) 0) (not (= (mod .cse11 10) 0)) (<= (+ (div .cse10 10) 1) c_~a0~0) (< .cse11 0) (<= 702 .cse12))))))) (exists ((v_prenex_85 Int)) (let ((.cse15 (mod v_prenex_85 18))) (let ((.cse14 (* 9 .cse15))) (let ((.cse13 (* 9 (div (+ .cse14 (- 864)) 10)))) (and (= (mod (+ .cse13 9) 10) 0) (<= (div .cse13 10) c_~a0~0) (< v_prenex_85 0) (= 0 (mod .cse13 10)) (<= (+ v_prenex_85 147) 0) (<= 864 .cse14) (not (= 0 .cse15))))))) (exists ((v_prenex_16 Int)) (let ((.cse18 (mod v_prenex_16 18))) (let ((.cse17 (* 9 .cse18))) (let ((.cse19 (* 9 (div (+ .cse17 (- 702)) 10)))) (let ((.cse16 (+ .cse19 9))) (and (<= (div .cse16 10) c_~a0~0) (not (= (mod (+ .cse17 8) 10) 0)) (<= (+ v_prenex_16 147) 0) (= 0 .cse18) (< .cse17 702) (= 0 (mod .cse19 10)) (<= 0 .cse16))))))) (exists ((v_prenex_88 Int)) (let ((.cse21 (* 9 (mod v_prenex_88 18)))) (let ((.cse20 (* 9 (div (+ .cse21 (- 702)) 10)))) (let ((.cse22 (+ .cse20 9))) (and (<= 0 v_prenex_88) (<= (div .cse20 10) c_~a0~0) (<= (+ v_prenex_88 147) 0) (= (mod (+ .cse21 8) 10) 0) (not (= (mod .cse22 10) 0)) (<= 0 .cse20) (< .cse22 0)))))) (exists ((v_prenex_17 Int)) (let ((.cse25 (mod v_prenex_17 18))) (let ((.cse23 (* 9 .cse25))) (let ((.cse24 (* 9 (div (+ .cse23 (- 702)) 10)))) (and (<= 702 .cse23) (<= 0 .cse24) (<= (div .cse24 10) c_~a0~0) (= 0 .cse25) (= (mod (+ .cse24 9) 10) 0) (<= (+ v_prenex_17 147) 0)))))) (exists ((v_prenex_78 Int)) (let ((.cse26 (* 9 (mod v_prenex_78 18)))) (let ((.cse27 (* 9 (div (+ .cse26 (- 702)) 10)))) (and (= (mod (+ .cse26 8) 10) 0) (= (mod (+ .cse27 9) 10) 0) (<= 0 v_prenex_78) (not (= 0 (mod .cse27 10))) (< .cse27 0) (<= (+ (div .cse27 10) 1) c_~a0~0) (<= (+ v_prenex_78 147) 0))))) (exists ((v_prenex_28 Int)) (let ((.cse28 (mod v_prenex_28 18))) (let ((.cse30 (* 9 .cse28))) (let ((.cse29 (* 9 (div (+ .cse30 (- 864)) 10)))) (and (not (= 0 .cse28)) (= (mod (+ .cse29 9) 10) 0) (= (mod (+ .cse30 6) 10) 0) (<= (div .cse29 10) c_~a0~0) (<= (+ v_prenex_28 147) 0) (= 0 (mod .cse29 10)) (< v_prenex_28 0)))))) (exists ((v_prenex_69 Int)) (let ((.cse33 (mod v_prenex_69 18))) (let ((.cse31 (* 9 .cse33))) (let ((.cse32 (* 9 (div (+ .cse31 (- 864)) 10)))) (and (<= (+ v_prenex_69 147) 0) (= (mod (+ .cse31 6) 10) 0) (= (mod (+ .cse32 9) 10) 0) (<= (+ (div .cse32 10) 1) c_~a0~0) (not (= 0 (mod .cse32 10))) (< .cse32 0) (not (= 0 .cse33)) (< v_prenex_69 0)))))) (exists ((v_prenex_80 Int)) (let ((.cse34 (* 9 (mod v_prenex_80 18)))) (let ((.cse36 (* 9 (div (+ .cse34 (- 702)) 10)))) (let ((.cse35 (+ .cse36 9))) (and (<= 0 v_prenex_80) (not (= (mod (+ .cse34 8) 10) 0)) (<= (div .cse35 10) c_~a0~0) (< .cse34 702) (<= (+ v_prenex_80 147) 0) (= 0 (mod .cse36 10)) (= (mod .cse35 10) 0)))))) (exists ((v_prenex_31 Int)) (let ((.cse39 (mod v_prenex_31 18))) (let ((.cse37 (* 9 .cse39))) (let ((.cse38 (* 9 (div (+ .cse37 (- 702)) 10)))) (and (= (mod (+ .cse37 8) 10) 0) (<= (div .cse38 10) c_~a0~0) (= 0 .cse39) (<= 0 (+ .cse38 9)) (<= (+ v_prenex_31 147) 0) (<= 0 .cse38)))))) (exists ((v_prenex_13 Int)) (let ((.cse43 (mod v_prenex_13 18))) (let ((.cse40 (* 9 .cse43))) (let ((.cse41 (* 9 (div (+ .cse40 (- 702)) 10)))) (let ((.cse42 (+ .cse41 9))) (and (< .cse40 702) (not (= 0 (mod .cse41 10))) (<= (+ v_prenex_13 147) 0) (not (= (mod (+ .cse40 8) 10) 0)) (< .cse41 0) (<= 0 .cse42) (= 0 .cse43) (<= (div .cse42 10) c_~a0~0))))))) (exists ((v_prenex_71 Int)) (let ((.cse45 (mod v_prenex_71 18))) (let ((.cse46 (* 9 .cse45))) (let ((.cse44 (* 9 (div (+ .cse46 (- 702)) 10)))) (and (<= 0 (+ .cse44 9)) (= 0 (mod .cse44 10)) (= 0 .cse45) (<= 702 .cse46) (<= (+ v_prenex_71 147) 0) (<= (div .cse44 10) c_~a0~0)))))) (exists ((v_prenex_44 Int)) (let ((.cse49 (* 9 (mod v_prenex_44 18)))) (let ((.cse48 (* 9 (div (+ .cse49 (- 702)) 10)))) (let ((.cse47 (+ .cse48 9))) (and (<= (+ v_prenex_44 147) 0) (not (= (mod .cse47 10) 0)) (<= 0 .cse48) (<= 0 v_prenex_44) (<= 702 .cse49) (<= (div .cse48 10) c_~a0~0) (< .cse47 0)))))) (exists ((v_prenex_61 Int)) (let ((.cse51 (* 9 (mod v_prenex_61 18)))) (let ((.cse50 (* 9 (div (+ .cse51 (- 702)) 10)))) (and (<= (div .cse50 10) c_~a0~0) (<= (+ v_prenex_61 147) 0) (<= 0 v_prenex_61) (= 0 (mod .cse50 10)) (= (mod (+ .cse51 8) 10) 0) (= (mod (+ .cse50 9) 10) 0))))) (exists ((v_prenex_24 Int)) (let ((.cse53 (mod v_prenex_24 18))) (let ((.cse55 (* 9 .cse53))) (let ((.cse52 (* 9 (div (+ .cse55 (- 864)) 10)))) (let ((.cse54 (+ .cse52 9))) (and (<= (div .cse52 10) c_~a0~0) (= 0 (mod .cse52 10)) (< v_prenex_24 0) (<= (+ v_prenex_24 147) 0) (not (= 0 .cse53)) (not (= (mod .cse54 10) 0)) (< .cse54 0) (<= 864 .cse55))))))) (exists ((v_prenex_64 Int)) (let ((.cse59 (mod v_prenex_64 18))) (let ((.cse58 (* 9 .cse59))) (let ((.cse57 (* 9 (div (+ .cse58 (- 864)) 10)))) (let ((.cse56 (+ .cse57 9))) (and (< v_prenex_64 0) (<= 0 .cse56) (= 0 (mod .cse57 10)) (not (= (mod (+ .cse58 6) 10) 0)) (not (= 0 .cse59)) (< .cse58 864) (<= (+ v_prenex_64 147) 0) (<= (div .cse56 10) c_~a0~0))))))) (exists ((v_prenex_55 Int)) (let ((.cse62 (mod v_prenex_55 18))) (let ((.cse61 (* 9 .cse62))) (let ((.cse60 (* 9 (div (+ .cse61 (- 864)) 10)))) (and (<= 0 .cse60) (<= (div .cse60 10) c_~a0~0) (<= 0 (+ .cse60 9)) (<= (+ v_prenex_55 147) 0) (< v_prenex_55 0) (<= 864 .cse61) (not (= 0 .cse62))))))) (exists ((v_prenex_37 Int)) (let ((.cse65 (* 9 (mod v_prenex_37 18)))) (let ((.cse64 (* 9 (div (+ .cse65 (- 702)) 10)))) (let ((.cse63 (+ .cse64 9))) (and (< .cse63 0) (not (= (mod .cse63 10) 0)) (<= (div .cse64 10) c_~a0~0) (<= 0 v_prenex_37) (<= (+ v_prenex_37 147) 0) (<= 702 .cse65) (= 0 (mod .cse64 10))))))) (exists ((v_prenex_9 Int)) (let ((.cse68 (mod v_prenex_9 18))) (let ((.cse66 (* 9 .cse68))) (let ((.cse67 (* 9 (div (+ .cse66 (- 864)) 10)))) (and (<= 864 .cse66) (<= (div .cse67 10) c_~a0~0) (<= 0 .cse67) (not (= 0 .cse68)) (<= (+ v_prenex_9 147) 0) (< v_prenex_9 0) (= (mod (+ .cse67 9) 10) 0)))))) (exists ((v_prenex_51 Int)) (let ((.cse70 (mod v_prenex_51 18))) (let ((.cse71 (* 9 .cse70))) (let ((.cse69 (* 9 (div (+ .cse71 (- 702)) 10)))) (and (<= (+ v_prenex_51 147) 0) (<= 0 .cse69) (= 0 .cse70) (<= 702 .cse71) (<= (div .cse69 10) c_~a0~0) (<= 0 (+ .cse69 9))))))) (exists ((v_prenex_52 Int)) (let ((.cse73 (* 9 (mod v_prenex_52 18)))) (let ((.cse72 (* 9 (div (+ .cse73 (- 702)) 10)))) (and (= (mod (+ .cse72 9) 10) 0) (< .cse72 0) (<= 702 .cse73) (not (= 0 (mod .cse72 10))) (<= (+ (div .cse72 10) 1) c_~a0~0) (<= (+ v_prenex_52 147) 0) (<= 0 v_prenex_52))))) (exists ((v_prenex_86 Int)) (let ((.cse76 (mod v_prenex_86 18))) (let ((.cse74 (* 9 .cse76))) (let ((.cse75 (* 9 (div (+ .cse74 (- 702)) 10)))) (and (<= (+ v_prenex_86 147) 0) (= (mod (+ .cse74 8) 10) 0) (<= (div .cse75 10) c_~a0~0) (= 0 .cse76) (= 0 (mod .cse75 10)) (= (mod (+ .cse75 9) 10) 0)))))) (exists ((v_prenex_20 Int)) (let ((.cse79 (* 9 (mod v_prenex_20 18)))) (let ((.cse77 (* 9 (div (+ .cse79 (- 702)) 10)))) (let ((.cse78 (+ .cse77 9))) (and (not (= 0 (mod .cse77 10))) (<= (+ (div .cse77 10) 1) c_~a0~0) (< .cse78 0) (= (mod (+ .cse79 8) 10) 0) (<= 0 v_prenex_20) (<= (+ v_prenex_20 147) 0) (not (= (mod .cse78 10) 0)) (< .cse77 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse80 (mod v_prenex_10 18))) (let ((.cse83 (* 9 .cse80))) (let ((.cse82 (* 9 (div (+ .cse83 (- 864)) 10)))) (let ((.cse81 (+ .cse82 9))) (and (not (= 0 .cse80)) (< .cse81 0) (<= 0 .cse82) (< v_prenex_10 0) (not (= (mod .cse81 10) 0)) (<= (div .cse82 10) c_~a0~0) (= (mod (+ .cse83 6) 10) 0) (<= (+ v_prenex_10 147) 0))))))) (exists ((v_prenex_38 Int)) (let ((.cse86 (* 9 (mod v_prenex_38 18)))) (let ((.cse84 (* 9 (div (+ .cse86 (- 702)) 10)))) (let ((.cse85 (+ .cse84 9))) (and (<= 0 .cse84) (not (= (mod .cse85 10) 0)) (not (= (mod (+ .cse86 8) 10) 0)) (< .cse86 702) (< .cse85 0) (<= (+ v_prenex_38 147) 0) (<= (+ (div .cse85 10) 1) c_~a0~0) (<= 0 v_prenex_38)))))) (exists ((v_prenex_50 Int)) (let ((.cse89 (mod v_prenex_50 18))) (let ((.cse88 (* 9 .cse89))) (let ((.cse87 (* 9 (div (+ .cse88 (- 702)) 10)))) (and (<= 0 .cse87) (<= (div .cse87 10) c_~a0~0) (<= (+ v_prenex_50 147) 0) (= (mod (+ .cse88 8) 10) 0) (= 0 .cse89) (= (mod (+ .cse87 9) 10) 0)))))) (exists ((v_prenex_54 Int)) (let ((.cse91 (* 9 (mod v_prenex_54 18)))) (let ((.cse90 (* 9 (div (+ .cse91 (- 702)) 10)))) (and (<= 0 v_prenex_54) (<= (+ v_prenex_54 147) 0) (= 0 (mod .cse90 10)) (= (mod (+ .cse90 9) 10) 0) (<= 702 .cse91) (<= (div .cse90 10) c_~a0~0))))) (exists ((v_prenex_72 Int)) (let ((.cse94 (mod v_prenex_72 18))) (let ((.cse93 (* 9 .cse94))) (let ((.cse92 (* 9 (div (+ .cse93 (- 864)) 10)))) (and (<= (+ (div .cse92 10) 1) c_~a0~0) (< .cse92 0) (<= 864 .cse93) (<= (+ v_prenex_72 147) 0) (< v_prenex_72 0) (not (= 0 (mod .cse92 10))) (not (= 0 .cse94)) (= (mod (+ .cse92 9) 10) 0)))))) (exists ((v_prenex_57 Int)) (let ((.cse95 (* 9 (mod v_prenex_57 18)))) (let ((.cse96 (* 9 (div (+ .cse95 (- 702)) 10)))) (and (<= 702 .cse95) (<= 0 v_prenex_57) (<= 0 .cse96) (= (mod (+ .cse96 9) 10) 0) (<= (+ v_prenex_57 147) 0) (<= (div .cse96 10) c_~a0~0))))) (exists ((v_prenex_39 Int)) (let ((.cse100 (mod v_prenex_39 18))) (let ((.cse97 (* 9 .cse100))) (let ((.cse99 (* 9 (div (+ .cse97 (- 864)) 10)))) (let ((.cse98 (+ .cse99 9))) (and (<= (+ v_prenex_39 147) 0) (< .cse97 864) (< v_prenex_39 0) (<= 0 .cse98) (<= (div .cse98 10) c_~a0~0) (<= 0 .cse99) (not (= 0 .cse100)) (not (= (mod (+ .cse97 6) 10) 0)))))))) (exists ((v_prenex_36 Int)) (let ((.cse101 (* 9 (mod v_prenex_36 18)))) (let ((.cse102 (* 9 (div (+ .cse101 (- 702)) 10)))) (and (<= (+ v_prenex_36 147) 0) (<= 702 .cse101) (<= 0 (+ .cse102 9)) (= 0 (mod .cse102 10)) (<= 0 v_prenex_36) (<= (div .cse102 10) c_~a0~0))))) (exists ((v_prenex_15 Int)) (let ((.cse105 (mod v_prenex_15 18))) (let ((.cse106 (* 9 .cse105))) (let ((.cse104 (* 9 (div (+ .cse106 (- 864)) 10)))) (let ((.cse103 (+ .cse104 9))) (and (<= (div .cse103 10) c_~a0~0) (not (= 0 (mod .cse104 10))) (= (mod .cse103 10) 0) (not (= 0 .cse105)) (< .cse106 864) (not (= (mod (+ .cse106 6) 10) 0)) (<= (+ v_prenex_15 147) 0) (< v_prenex_15 0) (< .cse104 0))))))) (exists ((v_prenex_12 Int)) (let ((.cse110 (mod v_prenex_12 18))) (let ((.cse108 (* 9 .cse110))) (let ((.cse109 (* 9 (div (+ .cse108 (- 702)) 10)))) (let ((.cse107 (+ .cse109 9))) (and (<= (+ v_prenex_12 147) 0) (not (= (mod .cse107 10) 0)) (<= (+ (div .cse107 10) 1) c_~a0~0) (not (= (mod (+ .cse108 8) 10) 0)) (<= 0 .cse109) (< .cse108 702) (= 0 .cse110) (< .cse107 0))))))) (exists ((v_~a0~0_826 Int)) (let ((.cse113 (mod v_~a0~0_826 18))) (let ((.cse112 (* 9 .cse113))) (let ((.cse111 (* 9 (div (+ .cse112 (- 702)) 10)))) (and (< .cse111 0) (<= (+ v_~a0~0_826 147) 0) (= (mod (+ .cse111 9) 10) 0) (<= (+ (div .cse111 10) 1) c_~a0~0) (= (mod (+ .cse112 8) 10) 0) (= 0 .cse113) (not (= 0 (mod .cse111 10)))))))) (exists ((v_prenex_30 Int)) (let ((.cse117 (mod v_prenex_30 18))) (let ((.cse115 (* 9 .cse117))) (let ((.cse116 (* 9 (div (+ .cse115 (- 864)) 10)))) (let ((.cse114 (+ .cse116 9))) (and (< v_prenex_30 0) (= (mod .cse114 10) 0) (< .cse115 864) (<= (div .cse114 10) c_~a0~0) (not (= (mod (+ .cse115 6) 10) 0)) (<= (+ v_prenex_30 147) 0) (= 0 (mod .cse116 10)) (not (= 0 .cse117)))))))) (exists ((v_prenex_83 Int)) (let ((.cse118 (mod v_prenex_83 18))) (let ((.cse120 (* 9 .cse118))) (let ((.cse119 (* 9 (div (+ .cse120 (- 702)) 10)))) (and (= 0 .cse118) (<= 0 (+ .cse119 9)) (<= (+ (div .cse119 10) 1) c_~a0~0) (not (= 0 (mod .cse119 10))) (< .cse119 0) (<= (+ v_prenex_83 147) 0) (<= 702 .cse120)))))) (exists ((v_prenex_46 Int)) (let ((.cse122 (* 9 (mod v_prenex_46 18)))) (let ((.cse121 (* 9 (div (+ .cse122 (- 702)) 10)))) (and (<= 0 .cse121) (<= 0 v_prenex_46) (= (mod (+ .cse122 8) 10) 0) (<= (+ v_prenex_46 147) 0) (<= (div .cse121 10) c_~a0~0) (<= 0 (+ .cse121 9)))))) (exists ((v_prenex_23 Int)) (let ((.cse126 (mod v_prenex_23 18))) (let ((.cse124 (* 9 .cse126))) (let ((.cse125 (* 9 (div (+ .cse124 (- 864)) 10)))) (let ((.cse123 (+ .cse125 9))) (and (<= (+ (div .cse123 10) 1) c_~a0~0) (not (= (mod (+ .cse124 6) 10) 0)) (< v_prenex_23 0) (< .cse125 0) (< .cse124 864) (not (= 0 (mod .cse125 10))) (not (= 0 .cse126)) (not (= (mod .cse123 10) 0)) (<= (+ v_prenex_23 147) 0) (< .cse123 0))))))) (exists ((v_prenex_25 Int)) (let ((.cse129 (mod v_prenex_25 18))) (let ((.cse128 (* 9 .cse129))) (let ((.cse127 (* 9 (div (+ .cse128 (- 864)) 10)))) (and (< v_prenex_25 0) (= 0 (mod .cse127 10)) (<= (div .cse127 10) c_~a0~0) (<= 0 (+ .cse127 9)) (= (mod (+ .cse128 6) 10) 0) (<= (+ v_prenex_25 147) 0) (not (= 0 .cse129))))))) (exists ((v_prenex_11 Int)) (let ((.cse132 (mod v_prenex_11 18))) (let ((.cse133 (* 9 .cse132))) (let ((.cse131 (* 9 (div (+ .cse133 (- 864)) 10)))) (let ((.cse130 (+ .cse131 9))) (and (< .cse130 0) (<= (div .cse131 10) c_~a0~0) (not (= (mod .cse130 10) 0)) (<= (+ v_prenex_11 147) 0) (< v_prenex_11 0) (= 0 (mod .cse131 10)) (not (= 0 .cse132)) (= (mod (+ .cse133 6) 10) 0))))))) (exists ((v_prenex_65 Int)) (let ((.cse137 (mod v_prenex_65 18))) (let ((.cse136 (* 9 .cse137))) (let ((.cse135 (* 9 (div (+ .cse136 (- 702)) 10)))) (let ((.cse134 (+ .cse135 9))) (and (< .cse134 0) (< .cse135 0) (not (= 0 (mod .cse135 10))) (<= (+ v_prenex_65 147) 0) (< .cse136 702) (<= (+ (div .cse134 10) 1) c_~a0~0) (not (= (mod (+ .cse136 8) 10) 0)) (not (= (mod .cse134 10) 0)) (= 0 .cse137))))))) (exists ((v_prenex_79 Int)) (let ((.cse139 (* 9 (mod v_prenex_79 18)))) (let ((.cse138 (* 9 (div (+ .cse139 (- 702)) 10)))) (and (<= 0 (+ .cse138 9)) (= 0 (mod .cse138 10)) (<= (+ v_prenex_79 147) 0) (<= (div .cse138 10) c_~a0~0) (<= 0 v_prenex_79) (= (mod (+ .cse139 8) 10) 0))))) (exists ((v_prenex_48 Int)) (let ((.cse142 (mod v_prenex_48 18))) (let ((.cse140 (* 9 .cse142))) (let ((.cse143 (* 9 (div (+ .cse140 (- 864)) 10)))) (let ((.cse141 (+ .cse143 9))) (and (not (= (mod (+ .cse140 6) 10) 0)) (< .cse141 0) (not (= 0 .cse142)) (< v_prenex_48 0) (not (= (mod .cse141 10) 0)) (< .cse140 864) (= 0 (mod .cse143 10)) (<= (+ v_prenex_48 147) 0) (<= (+ (div .cse141 10) 1) c_~a0~0))))))) (exists ((v_prenex_63 Int)) (let ((.cse147 (mod v_prenex_63 18))) (let ((.cse145 (* 9 .cse147))) (let ((.cse144 (* 9 (div (+ .cse145 (- 864)) 10)))) (let ((.cse146 (+ .cse144 9))) (and (< .cse144 0) (not (= 0 (mod .cse144 10))) (<= (+ v_prenex_63 147) 0) (< v_prenex_63 0) (< .cse145 864) (not (= (mod (+ .cse145 6) 10) 0)) (<= 0 .cse146) (not (= 0 .cse147)) (<= (div .cse146 10) c_~a0~0))))))) (exists ((v_prenex_76 Int)) (let ((.cse150 (* 9 (mod v_prenex_76 18)))) (let ((.cse149 (* 9 (div (+ .cse150 (- 702)) 10)))) (let ((.cse148 (+ .cse149 9))) (and (<= 0 .cse148) (not (= 0 (mod .cse149 10))) (<= 0 v_prenex_76) (<= (div .cse148 10) c_~a0~0) (not (= (mod (+ .cse150 8) 10) 0)) (<= (+ v_prenex_76 147) 0) (< .cse150 702) (< .cse149 0)))))) (exists ((v_prenex_62 Int)) (let ((.cse153 (mod v_prenex_62 18))) (let ((.cse152 (* 9 .cse153))) (let ((.cse154 (* 9 (div (+ .cse152 (- 702)) 10)))) (let ((.cse151 (+ .cse154 9))) (and (<= (+ (div .cse151 10) 1) c_~a0~0) (< .cse152 702) (= 0 .cse153) (not (= (mod (+ .cse152 8) 10) 0)) (<= (+ v_prenex_62 147) 0) (= 0 (mod .cse154 10)) (< .cse151 0) (not (= (mod .cse151 10) 0)))))))) (exists ((v_prenex_49 Int)) (let ((.cse156 (mod v_prenex_49 18))) (let ((.cse158 (* 9 .cse156))) (let ((.cse155 (* 9 (div (+ .cse158 (- 864)) 10)))) (let ((.cse157 (+ .cse155 9))) (and (< .cse155 0) (<= (+ v_prenex_49 147) 0) (not (= 0 (mod .cse155 10))) (<= (+ (div .cse155 10) 1) c_~a0~0) (not (= 0 .cse156)) (< v_prenex_49 0) (< .cse157 0) (<= 864 .cse158) (not (= (mod .cse157 10) 0)))))))) (exists ((v_prenex_66 Int)) (let ((.cse160 (* 9 (mod v_prenex_66 18)))) (let ((.cse161 (* 9 (div (+ .cse160 (- 702)) 10)))) (let ((.cse159 (+ .cse161 9))) (and (<= (div .cse159 10) c_~a0~0) (<= (+ v_prenex_66 147) 0) (<= 0 v_prenex_66) (< .cse160 702) (<= 0 .cse161) (not (= (mod (+ .cse160 8) 10) 0)) (= (mod .cse159 10) 0)))))) (exists ((v_prenex_53 Int)) (let ((.cse163 (* 9 (mod v_prenex_53 18)))) (let ((.cse162 (* 9 (div (+ .cse163 (- 702)) 10)))) (and (<= 0 v_prenex_53) (<= 0 .cse162) (<= (+ v_prenex_53 147) 0) (= (mod (+ .cse163 8) 10) 0) (= (mod (+ .cse162 9) 10) 0) (<= (div .cse162 10) c_~a0~0))))) (exists ((v_prenex_33 Int)) (let ((.cse167 (mod v_prenex_33 18))) (let ((.cse165 (* 9 .cse167))) (let ((.cse164 (* 9 (div (+ .cse165 (- 702)) 10)))) (let ((.cse166 (+ .cse164 9))) (and (<= 0 .cse164) (= (mod (+ .cse165 8) 10) 0) (not (= (mod .cse166 10) 0)) (<= (div .cse164 10) c_~a0~0) (= 0 .cse167) (< .cse166 0) (<= (+ v_prenex_33 147) 0))))))) (exists ((v_prenex_82 Int)) (let ((.cse169 (* 9 (mod v_prenex_82 18)))) (let ((.cse168 (* 9 (div (+ .cse169 (- 702)) 10)))) (and (<= 0 (+ .cse168 9)) (<= (+ v_prenex_82 147) 0) (<= (+ (div .cse168 10) 1) c_~a0~0) (= (mod (+ .cse169 8) 10) 0) (<= 0 v_prenex_82) (< .cse168 0) (not (= 0 (mod .cse168 10))))))) (exists ((v_prenex_43 Int)) (let ((.cse170 (mod v_prenex_43 18))) (let ((.cse171 (* 9 .cse170))) (let ((.cse172 (* 9 (div (+ .cse171 (- 702)) 10)))) (let ((.cse173 (+ .cse172 9))) (and (= 0 .cse170) (not (= (mod (+ .cse171 8) 10) 0)) (= 0 (mod .cse172 10)) (= (mod .cse173 10) 0) (<= (div .cse173 10) c_~a0~0) (<= (+ v_prenex_43 147) 0) (< .cse171 702))))))) (exists ((v_prenex_19 Int)) (let ((.cse175 (mod v_prenex_19 18))) (let ((.cse176 (* 9 .cse175))) (let ((.cse174 (* 9 (div (+ .cse176 (- 864)) 10)))) (and (not (= 0 (mod .cse174 10))) (< .cse174 0) (not (= 0 .cse175)) (<= (+ (div .cse174 10) 1) c_~a0~0) (< v_prenex_19 0) (= (mod (+ .cse176 6) 10) 0) (<= 0 (+ .cse174 9)) (<= (+ v_prenex_19 147) 0)))))) (exists ((v_prenex_34 Int)) (let ((.cse179 (* 9 (mod v_prenex_34 18)))) (let ((.cse178 (* 9 (div (+ .cse179 (- 702)) 10)))) (let ((.cse177 (+ .cse178 9))) (and (not (= (mod .cse177 10) 0)) (<= 0 v_prenex_34) (<= (+ (div .cse178 10) 1) c_~a0~0) (< .cse177 0) (< .cse178 0) (<= (+ v_prenex_34 147) 0) (not (= 0 (mod .cse178 10))) (<= 702 .cse179)))))) (exists ((v_prenex_18 Int)) (let ((.cse181 (* 9 (mod v_prenex_18 18)))) (let ((.cse182 (* 9 (div (+ .cse181 (- 702)) 10)))) (let ((.cse180 (+ .cse182 9))) (and (<= 0 v_prenex_18) (< .cse180 0) (<= (+ v_prenex_18 147) 0) (not (= (mod (+ .cse181 8) 10) 0)) (<= (+ (div .cse180 10) 1) c_~a0~0) (not (= 0 (mod .cse182 10))) (< .cse181 702) (not (= (mod .cse180 10) 0)) (< .cse182 0)))))) (exists ((v_prenex_14 Int)) (let ((.cse186 (mod v_prenex_14 18))) (let ((.cse183 (* 9 .cse186))) (let ((.cse185 (* 9 (div (+ .cse183 (- 702)) 10)))) (let ((.cse184 (+ .cse185 9))) (and (not (= (mod (+ .cse183 8) 10) 0)) (= (mod .cse184 10) 0) (not (= 0 (mod .cse185 10))) (<= (div .cse184 10) c_~a0~0) (< .cse183 702) (= 0 .cse186) (< .cse185 0) (<= (+ v_prenex_14 147) 0))))))) (exists ((v_prenex_27 Int)) (let ((.cse187 (* 9 (mod v_prenex_27 18)))) (let ((.cse189 (* 9 (div (+ .cse187 (- 702)) 10)))) (let ((.cse188 (+ .cse189 9))) (and (< .cse187 702) (<= 0 .cse188) (<= (+ v_prenex_27 147) 0) (<= (div .cse188 10) c_~a0~0) (<= 0 v_prenex_27) (<= 0 .cse189) (not (= (mod (+ .cse187 8) 10) 0))))))) (exists ((v_prenex_77 Int)) (let ((.cse193 (mod v_prenex_77 18))) (let ((.cse191 (* 9 .cse193))) (let ((.cse190 (* 9 (div (+ .cse191 (- 702)) 10)))) (let ((.cse192 (+ .cse190 9))) (and (not (= 0 (mod .cse190 10))) (= (mod (+ .cse191 8) 10) 0) (not (= (mod .cse192 10) 0)) (< .cse192 0) (= 0 .cse193) (<= (+ v_prenex_77 147) 0) (< .cse190 0) (<= (+ (div .cse190 10) 1) c_~a0~0))))))) (exists ((v_prenex_60 Int)) (let ((.cse196 (mod v_prenex_60 18))) (let ((.cse195 (* 9 .cse196))) (let ((.cse194 (* 9 (div (+ .cse195 (- 702)) 10)))) (and (< .cse194 0) (<= 702 .cse195) (= (mod (+ .cse194 9) 10) 0) (<= (+ v_prenex_60 147) 0) (not (= 0 (mod .cse194 10))) (<= (+ (div .cse194 10) 1) c_~a0~0) (= 0 .cse196)))))) (exists ((v_prenex_84 Int)) (let ((.cse199 (mod v_prenex_84 18))) (let ((.cse198 (* 9 .cse199))) (let ((.cse197 (* 9 (div (+ .cse198 (- 702)) 10)))) (let ((.cse200 (+ .cse197 9))) (and (<= 0 .cse197) (< .cse198 702) (= 0 .cse199) (<= (div .cse200 10) c_~a0~0) (<= 0 .cse200) (not (= (mod (+ .cse198 8) 10) 0)) (<= (+ v_prenex_84 147) 0))))))) (exists ((v_prenex_56 Int)) (let ((.cse201 (mod v_prenex_56 18))) (let ((.cse203 (* 9 .cse201))) (let ((.cse202 (* 9 (div (+ .cse203 (- 702)) 10)))) (and (= 0 .cse201) (not (= 0 (mod .cse202 10))) (<= (+ (div .cse202 10) 1) c_~a0~0) (= (mod (+ .cse203 8) 10) 0) (<= 0 (+ .cse202 9)) (<= (+ v_prenex_56 147) 0) (< .cse202 0)))))) (exists ((v_prenex_26 Int)) (let ((.cse204 (* 9 (mod v_prenex_26 18)))) (let ((.cse205 (* 9 (div (+ .cse204 (- 702)) 10)))) (let ((.cse206 (+ .cse205 9))) (and (not (= (mod (+ .cse204 8) 10) 0)) (< .cse205 0) (= (mod .cse206 10) 0) (<= (div .cse206 10) c_~a0~0) (<= 0 v_prenex_26) (<= (+ v_prenex_26 147) 0) (not (= 0 (mod .cse205 10))) (< .cse204 702)))))) (exists ((v_prenex_41 Int)) (let ((.cse207 (* 9 (mod v_prenex_41 18)))) (let ((.cse208 (* 9 (div (+ .cse207 (- 702)) 10)))) (let ((.cse209 (+ .cse208 9))) (and (= (mod (+ .cse207 8) 10) 0) (<= (div .cse208 10) c_~a0~0) (<= (+ v_prenex_41 147) 0) (not (= (mod .cse209 10) 0)) (= 0 (mod .cse208 10)) (<= 0 v_prenex_41) (< .cse209 0)))))) (exists ((v_prenex_73 Int)) (let ((.cse213 (mod v_prenex_73 18))) (let ((.cse212 (* 9 .cse213))) (let ((.cse210 (* 9 (div (+ .cse212 (- 702)) 10)))) (let ((.cse211 (+ .cse210 9))) (and (<= 0 .cse210) (<= (div .cse211 10) c_~a0~0) (not (= (mod (+ .cse212 8) 10) 0)) (= 0 .cse213) (= (mod .cse211 10) 0) (<= (+ v_prenex_73 147) 0) (< .cse212 702))))))) (exists ((v_prenex_68 Int)) (let ((.cse215 (mod v_prenex_68 18))) (let ((.cse216 (* 9 .cse215))) (let ((.cse214 (* 9 (div (+ .cse216 (- 702)) 10)))) (and (= 0 (mod .cse214 10)) (<= (+ v_prenex_68 147) 0) (= 0 .cse215) (<= (div .cse214 10) c_~a0~0) (<= 702 .cse216) (= (mod (+ .cse214 9) 10) 0)))))) (exists ((v_prenex_67 Int)) (let ((.cse220 (mod v_prenex_67 18))) (let ((.cse217 (* 9 .cse220))) (let ((.cse219 (* 9 (div (+ .cse217 (- 864)) 10)))) (let ((.cse218 (+ .cse219 9))) (and (< .cse217 864) (not (= (mod (+ .cse217 6) 10) 0)) (<= (+ (div .cse218 10) 1) c_~a0~0) (< v_prenex_67 0) (< .cse218 0) (<= (+ v_prenex_67 147) 0) (<= 0 .cse219) (not (= 0 .cse220)) (not (= (mod .cse218 10) 0)))))))) (exists ((v_prenex_35 Int)) (let ((.cse221 (mod v_prenex_35 18))) (let ((.cse222 (* 9 .cse221))) (let ((.cse223 (* 9 (div (+ .cse222 (- 864)) 10)))) (and (<= (+ v_prenex_35 147) 0) (not (= 0 .cse221)) (<= 864 .cse222) (<= 0 (+ .cse223 9)) (< v_prenex_35 0) (<= (div .cse223 10) c_~a0~0) (= 0 (mod .cse223 10))))))) (exists ((v_prenex_58 Int)) (let ((.cse226 (mod v_prenex_58 18))) (let ((.cse227 (* 9 .cse226))) (let ((.cse224 (* 9 (div (+ .cse227 (- 864)) 10)))) (let ((.cse225 (+ .cse224 9))) (and (< v_prenex_58 0) (<= 0 .cse224) (<= (div .cse225 10) c_~a0~0) (= (mod .cse225 10) 0) (not (= 0 .cse226)) (not (= (mod (+ .cse227 6) 10) 0)) (<= (+ v_prenex_58 147) 0) (< .cse227 864))))))) (exists ((v_prenex_47 Int)) (let ((.cse229 (* 9 (mod v_prenex_47 18)))) (let ((.cse228 (* 9 (div (+ .cse229 (- 702)) 10)))) (and (<= (+ (div .cse228 10) 1) c_~a0~0) (<= 702 .cse229) (< .cse228 0) (not (= 0 (mod .cse228 10))) (<= 0 v_prenex_47) (<= (+ v_prenex_47 147) 0) (<= 0 (+ .cse228 9)))))) (exists ((v_prenex_42 Int)) (let ((.cse232 (mod v_prenex_42 18))) (let ((.cse230 (* 9 .cse232))) (let ((.cse231 (* 9 (div (+ .cse230 (- 864)) 10)))) (and (<= 864 .cse230) (<= 0 (+ .cse231 9)) (not (= 0 .cse232)) (< v_prenex_42 0) (<= (+ (div .cse231 10) 1) c_~a0~0) (<= (+ v_prenex_42 147) 0) (< .cse231 0) (not (= 0 (mod .cse231 10)))))))) (exists ((v_prenex_87 Int)) (let ((.cse235 (* 9 (mod v_prenex_87 18)))) (let ((.cse234 (* 9 (div (+ .cse235 (- 702)) 10)))) (let ((.cse233 (+ .cse234 9))) (and (<= (+ v_prenex_87 147) 0) (< .cse233 0) (= 0 (mod .cse234 10)) (not (= (mod (+ .cse235 8) 10) 0)) (<= 0 v_prenex_87) (<= (+ (div .cse233 10) 1) c_~a0~0) (not (= (mod .cse233 10) 0)) (< .cse235 702)))))) (exists ((v_prenex_40 Int)) (let ((.cse237 (mod v_prenex_40 18))) (let ((.cse238 (* 9 .cse237))) (let ((.cse236 (* 9 (div (+ .cse238 (- 864)) 10)))) (and (<= (div .cse236 10) c_~a0~0) (= (mod (+ .cse236 9) 10) 0) (<= (+ v_prenex_40 147) 0) (< v_prenex_40 0) (<= 0 .cse236) (not (= 0 .cse237)) (= (mod (+ .cse238 6) 10) 0)))))) (exists ((v_prenex_75 Int)) (let ((.cse241 (mod v_prenex_75 18))) (let ((.cse240 (* 9 .cse241))) (let ((.cse242 (* 9 (div (+ .cse240 (- 702)) 10)))) (let ((.cse239 (+ .cse242 9))) (and (not (= (mod .cse239 10) 0)) (<= 702 .cse240) (<= (+ v_prenex_75 147) 0) (< .cse239 0) (= 0 .cse241) (<= (div .cse242 10) c_~a0~0) (= 0 (mod .cse242 10)))))))) (exists ((v_prenex_22 Int)) (let ((.cse245 (mod v_prenex_22 18))) (let ((.cse246 (* 9 .cse245))) (let ((.cse243 (* 9 (div (+ .cse246 (- 702)) 10)))) (let ((.cse244 (+ .cse243 9))) (and (<= 0 .cse243) (< .cse244 0) (<= (div .cse243 10) c_~a0~0) (= 0 .cse245) (<= (+ v_prenex_22 147) 0) (<= 702 .cse246) (not (= (mod .cse244 10) 0)))))))) (exists ((v_prenex_59 Int)) (let ((.cse247 (mod v_prenex_59 18))) (let ((.cse249 (* 9 .cse247))) (let ((.cse250 (* 9 (div (+ .cse249 (- 864)) 10)))) (let ((.cse248 (+ .cse250 9))) (and (not (= 0 .cse247)) (not (= (mod .cse248 10) 0)) (<= 864 .cse249) (<= 0 .cse250) (< .cse248 0) (< v_prenex_59 0) (<= (div .cse250 10) c_~a0~0) (<= (+ v_prenex_59 147) 0))))))) (exists ((v_prenex_45 Int)) (let ((.cse253 (mod v_prenex_45 18))) (let ((.cse254 (* 9 .cse253))) (let ((.cse252 (* 9 (div (+ .cse254 (- 702)) 10)))) (let ((.cse251 (+ .cse252 9))) (and (< .cse251 0) (= 0 (mod .cse252 10)) (not (= (mod .cse251 10) 0)) (= 0 .cse253) (= (mod (+ .cse254 8) 10) 0) (<= (div .cse252 10) c_~a0~0) (<= (+ v_prenex_45 147) 0))))))) (exists ((v_prenex_21 Int)) (let ((.cse255 (* 9 (mod v_prenex_21 18)))) (let ((.cse257 (* 9 (div (+ .cse255 (- 702)) 10)))) (let ((.cse256 (+ .cse257 9))) (and (not (= (mod (+ .cse255 8) 10) 0)) (<= (div .cse256 10) c_~a0~0) (= 0 (mod .cse257 10)) (<= (+ v_prenex_21 147) 0) (<= 0 .cse256) (< .cse255 702) (<= 0 v_prenex_21)))))) (exists ((v_prenex_29 Int)) (let ((.cse260 (mod v_prenex_29 18))) (let ((.cse258 (* 9 .cse260))) (let ((.cse259 (* 9 (div (+ .cse258 (- 702)) 10)))) (and (= (mod (+ .cse258 8) 10) 0) (<= 0 (+ .cse259 9)) (= 0 .cse260) (= 0 (mod .cse259 10)) (<= (+ v_prenex_29 147) 0) (<= (div .cse259 10) c_~a0~0)))))))) is different from false [2019-01-12 04:35:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:34,554 INFO L93 Difference]: Finished difference Result 35285 states and 36758 transitions. [2019-01-12 04:35:34,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:35:34,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 717 [2019-01-12 04:35:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:34,575 INFO L225 Difference]: With dead ends: 35285 [2019-01-12 04:35:34,575 INFO L226 Difference]: Without dead ends: 22349 [2019-01-12 04:35:34,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=16, Invalid=23, Unknown=3, NotChecked=30, Total=72 [2019-01-12 04:35:34,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22349 states. [2019-01-12 04:35:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22349 to 17786. [2019-01-12 04:35:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17786 states. [2019-01-12 04:35:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17786 states to 17786 states and 18441 transitions. [2019-01-12 04:35:34,809 INFO L78 Accepts]: Start accepts. Automaton has 17786 states and 18441 transitions. Word has length 717 [2019-01-12 04:35:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:34,810 INFO L480 AbstractCegarLoop]: Abstraction has 17786 states and 18441 transitions. [2019-01-12 04:35:34,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:35:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17786 states and 18441 transitions. [2019-01-12 04:35:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2019-01-12 04:35:34,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:34,822 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1] [2019-01-12 04:35:34,822 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:34,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:34,822 INFO L82 PathProgramCache]: Analyzing trace with hash 96971692, now seen corresponding path program 1 times [2019-01-12 04:35:34,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:34,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:34,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2019-01-12 04:35:35,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:35,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:35,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:35,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:35,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:35,437 INFO L87 Difference]: Start difference. First operand 17786 states and 18441 transitions. Second operand 4 states. [2019-01-12 04:35:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:37,871 INFO L93 Difference]: Finished difference Result 40366 states and 41807 transitions. [2019-01-12 04:35:37,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:37,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 767 [2019-01-12 04:35:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:37,889 INFO L225 Difference]: With dead ends: 40366 [2019-01-12 04:35:37,890 INFO L226 Difference]: Without dead ends: 22582 [2019-01-12 04:35:37,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22582 states. [2019-01-12 04:35:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22582 to 19273. [2019-01-12 04:35:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19273 states. [2019-01-12 04:35:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19273 states to 19273 states and 19830 transitions. [2019-01-12 04:35:38,196 INFO L78 Accepts]: Start accepts. Automaton has 19273 states and 19830 transitions. Word has length 767 [2019-01-12 04:35:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:38,197 INFO L480 AbstractCegarLoop]: Abstraction has 19273 states and 19830 transitions. [2019-01-12 04:35:38,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19273 states and 19830 transitions. [2019-01-12 04:35:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2019-01-12 04:35:38,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:38,214 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:38,214 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1510167607, now seen corresponding path program 1 times [2019-01-12 04:35:38,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:38,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:39,077 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-12 04:35:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 885 proven. 58 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-01-12 04:35:41,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:41,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:35:41,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:41,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 885 proven. 58 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-01-12 04:35:43,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:35:43,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-01-12 04:35:43,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:35:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:35:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:35:43,190 INFO L87 Difference]: Start difference. First operand 19273 states and 19830 transitions. Second operand 6 states. [2019-01-12 04:35:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:46,948 INFO L93 Difference]: Finished difference Result 22446 states and 23079 transitions. [2019-01-12 04:35:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:35:46,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1016 [2019-01-12 04:35:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:46,951 INFO L225 Difference]: With dead ends: 22446 [2019-01-12 04:35:46,951 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:35:46,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1023 GetRequests, 1017 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:35:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:35:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:35:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:35:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:35:46,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1016 [2019-01-12 04:35:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:46,961 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:35:46,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:35:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:35:46,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:35:46,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:35:47,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:47,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,884 WARN L181 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 2495 DAG size of output: 2291 [2019-01-12 04:35:48,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:48,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:49,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,356 WARN L181 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 2495 DAG size of output: 2289 [2019-01-12 04:35:50,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:50,773 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 430 DAG size of output: 317 [2019-01-12 04:35:56,489 WARN L181 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 2254 DAG size of output: 62 [2019-01-12 04:36:02,257 WARN L181 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 2251 DAG size of output: 62 [2019-01-12 04:36:04,232 WARN L181 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 306 DAG size of output: 60 [2019-01-12 04:36:04,236 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,237 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,238 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,238 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:36:04,241 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,241 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,241 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,241 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,241 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,241 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,242 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:36:04,243 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,244 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,249 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,249 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,249 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,249 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,249 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:36:04,249 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,250 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:36:04,250 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:36:04,250 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:36:04,250 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:36:04,250 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,250 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,250 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,250 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,251 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,252 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,254 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:36:04,254 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,254 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:36:04,254 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:36:04,254 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:36:04,254 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:36:04,254 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:36:04,255 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:36:04,255 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,255 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,255 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,257 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,257 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:36:04,257 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:36:04,257 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,257 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:36:04,257 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,257 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,257 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,258 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,259 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,262 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:36:04,262 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:36:04,262 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,262 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:36:04,262 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:36:04,262 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:36:04,262 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,263 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,264 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,265 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,268 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,268 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:36:04,268 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,268 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,268 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,268 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,268 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,268 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,269 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:36:04,270 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,271 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,271 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:36:04,273 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,273 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,273 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,273 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,273 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 187) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,274 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,275 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:36:04,276 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:36:04,278 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,278 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:36:04,278 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:36:04,278 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:36:04,278 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,278 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,278 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,279 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,279 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,279 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:36:04,279 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:36:04,279 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:36:04,279 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:36:04,284 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,284 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,284 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,284 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:36:04,284 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:36:04,284 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:36:04,285 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,286 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,287 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:36:04,287 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:36:04,287 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:36:04,287 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:36:04,287 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,287 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,287 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,287 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,290 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse10 (+ ~a29~0 16)) (.cse11 (+ ~a4~0 86))) (let ((.cse8 (<= .cse11 0)) (.cse6 (<= .cse10 0))) (let ((.cse2 (< 0 .cse11)) (.cse7 (= ~a2~0 4)) (.cse1 (< 0 .cse10)) (.cse4 (not (= 1 ~a2~0))) (.cse0 (<= (+ ~a0~0 61) 0)) (.cse5 (< 43 ~a29~0)) (.cse3 (<= ~a2~0 2)) (.cse9 (and .cse8 .cse6))) (or (and .cse0 (< 0 (+ ~a0~0 98))) (and (= ~a2~0 1) .cse1 .cse2 (<= ~a29~0 43)) (and .cse2 .cse3 .cse0) (and .cse4 .cse5) (and .cse6 (< 0 (+ ~a29~0 144)) .cse0) (and .cse7 .cse8) (and (not .cse7) .cse4 .cse0) (<= (+ ~a0~0 147) 0) (and .cse1 (and .cse4 .cse8)) (and (and .cse3 .cse4) .cse6) (and .cse7 (<= 0 (+ ~a0~0 75))) (and .cse1 .cse4 .cse0) (and .cse0 .cse5) (and .cse9 .cse3) (and .cse9 (= ~a2~0 3)))))) [2019-01-12 04:36:04,290 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:36:04,290 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,291 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,292 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,293 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,293 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:36:04,293 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,294 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,295 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse10 (+ ~a29~0 16)) (.cse11 (+ ~a4~0 86))) (let ((.cse9 (<= .cse11 0)) (.cse5 (<= .cse10 0))) (let ((.cse1 (< 0 .cse11)) (.cse0 (< 0 .cse10)) (.cse2 (not (= 1 ~a2~0))) (.cse8 (and .cse9 .cse5)) (.cse6 (<= ~a2~0 2)) (.cse4 (= ~a2~0 4)) (.cse7 (< 43 ~a29~0)) (.cse3 (<= (+ ~a0~0 61) 0))) (or (and .cse0 (and (= ~a2~0 1) .cse1 (<= ~a29~0 43))) (and .cse0 .cse2 .cse3) (and (and (not .cse4) .cse5) .cse3) (<= (+ ~a0~0 147) 0) (and (and .cse6 .cse2) .cse5) (and .cse6 .cse1 .cse3) (and .cse3 (< 0 (+ ~a0~0 98))) (and .cse2 .cse7) (and .cse8 (= ~a2~0 3)) (and .cse0 (and .cse2 .cse9)) (and .cse8 .cse6) (and .cse4 (< 0 (+ ~a29~0 144))) (and .cse4 (<= 0 (+ ~a0~0 75))) (and .cse9 (or .cse5 .cse7) .cse3))))) [2019-01-12 04:36:04,295 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,295 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:36:04,295 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:36:04,295 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,295 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,295 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:36:04,296 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,297 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,298 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,299 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,299 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:36:04,299 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:36:04,299 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,299 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:36:04,299 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,299 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,300 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,301 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,302 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,303 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,303 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,303 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,303 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse10 (+ ~a29~0 16)) (.cse11 (+ ~a4~0 86))) (let ((.cse9 (<= .cse11 0)) (.cse5 (<= .cse10 0))) (let ((.cse1 (< 0 .cse11)) (.cse0 (< 0 .cse10)) (.cse2 (not (= 1 ~a2~0))) (.cse8 (and .cse9 .cse5)) (.cse6 (<= ~a2~0 2)) (.cse4 (= ~a2~0 4)) (.cse7 (< 43 ~a29~0)) (.cse3 (<= (+ ~a0~0 61) 0))) (or (and .cse0 (and (= ~a2~0 1) .cse1 (<= ~a29~0 43))) (and .cse0 .cse2 .cse3) (and (and (not .cse4) .cse5) .cse3) (<= (+ ~a0~0 147) 0) (and (and .cse6 .cse2) .cse5) (and .cse6 .cse1 .cse3) (and .cse3 (< 0 (+ ~a0~0 98))) (and .cse2 .cse7) (and .cse8 (= ~a2~0 3)) (and .cse0 (and .cse2 .cse9)) (and .cse8 .cse6) (and .cse4 (< 0 (+ ~a29~0 144))) (and .cse4 (<= 0 (+ ~a0~0 75))) (and .cse9 (or .cse5 .cse7) .cse3))))) [2019-01-12 04:36:04,303 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:36:04,303 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:36:04,303 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:36:04,304 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,305 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,306 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,307 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,308 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,309 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:36:04,310 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,311 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,311 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,311 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:36:04,311 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,311 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,311 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,311 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,311 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:36:04,312 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:36:04,313 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:36:04,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:36:04 BoogieIcfgContainer [2019-01-12 04:36:04,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:36:04,364 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:36:04,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:36:04,364 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:36:04,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:33:25" (3/4) ... [2019-01-12 04:36:04,379 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:36:04,474 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:36:04,483 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:36:04,850 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:36:04,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:36:04,851 INFO L168 Benchmark]: Toolchain (without parser) took 168309.65 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 946.0 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-01-12 04:36:04,851 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:36:04,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1365.57 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 849.0 MB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:04,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 405.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 849.0 MB in the beginning and 1.1 GB in the end (delta: -232.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:04,852 INFO L168 Benchmark]: Boogie Preprocessor took 261.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:04,853 INFO L168 Benchmark]: RCFGBuilder took 6563.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.5 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:04,853 INFO L168 Benchmark]: TraceAbstraction took 159219.47 ms. Allocated memory was 1.3 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.2 GB in the beginning and 788.3 MB in the end (delta: 380.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-01-12 04:36:04,853 INFO L168 Benchmark]: Witness Printer took 485.88 ms. Allocated memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 7.9 MB). Free memory was 788.3 MB in the beginning and 3.9 GB in the end (delta: -3.1 GB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:04,857 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1365.57 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 849.0 MB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 405.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 849.0 MB in the beginning and 1.1 GB in the end (delta: -232.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 261.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6563.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.5 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 159219.47 ms. Allocated memory was 1.3 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.2 GB in the beginning and 788.3 MB in the end (delta: 380.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 485.88 ms. Allocated memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 7.9 MB). Free memory was 788.3 MB in the beginning and 3.9 GB in the end (delta: -3.1 GB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 187]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant Derived loop invariant: (((((((((((((0 < a29 + 16 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) || ((0 < a29 + 16 && !(1 == a2)) && a0 + 61 <= 0)) || ((!(a2 == 4) && a29 + 16 <= 0) && a0 + 61 <= 0)) || a0 + 147 <= 0) || ((a2 <= 2 && !(1 == a2)) && a29 + 16 <= 0)) || ((a2 <= 2 && 0 < a4 + 86) && a0 + 61 <= 0)) || (a0 + 61 <= 0 && 0 < a0 + 98)) || (!(1 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && a29 + 16 <= 0) && a2 == 3)) || (0 < a29 + 16 && !(1 == a2) && a4 + 86 <= 0)) || ((a4 + 86 <= 0 && a29 + 16 <= 0) && a2 <= 2)) || (a2 == 4 && 0 < a29 + 144)) || (a2 == 4 && 0 <= a0 + 75)) || ((a4 + 86 <= 0 && (a29 + 16 <= 0 || 43 < a29)) && a0 + 61 <= 0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((((((0 < a29 + 16 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) || ((0 < a29 + 16 && !(1 == a2)) && a0 + 61 <= 0)) || ((!(a2 == 4) && a29 + 16 <= 0) && a0 + 61 <= 0)) || a0 + 147 <= 0) || ((a2 <= 2 && !(1 == a2)) && a29 + 16 <= 0)) || ((a2 <= 2 && 0 < a4 + 86) && a0 + 61 <= 0)) || (a0 + 61 <= 0 && 0 < a0 + 98)) || (!(1 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && a29 + 16 <= 0) && a2 == 3)) || (0 < a29 + 16 && !(1 == a2) && a4 + 86 <= 0)) || ((a4 + 86 <= 0 && a29 + 16 <= 0) && a2 <= 2)) || (a2 == 4 && 0 < a29 + 144)) || (a2 == 4 && 0 <= a0 + 75)) || ((a4 + 86 <= 0 && (a29 + 16 <= 0 || 43 < a29)) && a0 + 61 <= 0) - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((a0 + 61 <= 0 && 0 < a0 + 98) || (((a2 == 1 && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 43)) || ((0 < a4 + 86 && a2 <= 2) && a0 + 61 <= 0)) || (!(1 == a2) && 43 < a29)) || ((a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0)) || (a2 == 4 && a4 + 86 <= 0)) || ((!(a2 == 4) && !(1 == a2)) && a0 + 61 <= 0)) || a0 + 147 <= 0) || (0 < a29 + 16 && !(1 == a2) && a4 + 86 <= 0)) || ((a2 <= 2 && !(1 == a2)) && a29 + 16 <= 0)) || (a2 == 4 && 0 <= a0 + 75)) || ((0 < a29 + 16 && !(1 == a2)) && a0 + 61 <= 0)) || (a0 + 61 <= 0 && 43 < a29)) || ((a4 + 86 <= 0 && a29 + 16 <= 0) && a2 <= 2)) || ((a4 + 86 <= 0 && a29 + 16 <= 0) && a2 == 3) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 159.1s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 78.8s AutomataDifference, 0.0s DeadEndRemovalTime, 17.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 3638 SDtfs, 9909 SDslu, 1561 SDs, 0 SdLazy, 33783 SolverSat, 4837 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 63.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3003 GetRequests, 2937 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19273occurred in iteration=13, 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: 2.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 26238 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 324 NumberOfFragments, 561 HoareAnnotationTreeSize, 4 FomulaSimplifications, 265345 FormulaSimplificationTreeSizeReduction, 3.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 153685 FormulaSimplificationTreeSizeReductionInter, 13.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 52.6s InterpolantComputationTime, 9693 NumberOfCodeBlocks, 9693 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 9674 ConstructedInterpolants, 116 QuantifiedInterpolants, 305415208 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3494 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 11152/11513 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...