./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label40_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/Problem11_label40_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 d4fc65ef25b30818fd1841f3cfc924fa7d058e0c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 22:31:46,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 22:31:46,564 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 22:31:46,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 22:31:46,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 22:31:46,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 22:31:46,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 22:31:46,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 22:31:46,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 22:31:46,595 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 22:31:46,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 22:31:46,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 22:31:46,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 22:31:46,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 22:31:46,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 22:31:46,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 22:31:46,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 22:31:46,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 22:31:46,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 22:31:46,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 22:31:46,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 22:31:46,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 22:31:46,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 22:31:46,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 22:31:46,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 22:31:46,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 22:31:46,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 22:31:46,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 22:31:46,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 22:31:46,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 22:31:46,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 22:31:46,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 22:31:46,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 22:31:46,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 22:31:46,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 22:31:46,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 22:31:46,635 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 22:31:46,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 22:31:46,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 22:31:46,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 22:31:46,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 22:31:46,661 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 22:31:46,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 22:31:46,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 22:31:46,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 22:31:46,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 22:31:46,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 22:31:46,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 22:31:46,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 22:31:46,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 22:31:46,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 22:31:46,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 22:31:46,664 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 22:31:46,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 22:31:46,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 22:31:46,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 22:31:46,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 22:31:46,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 22:31:46,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 22:31:46,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 22:31:46,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 22:31:46,669 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 22:31:46,669 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 22:31:46,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 22:31:46,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 22:31:46,670 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 -> d4fc65ef25b30818fd1841f3cfc924fa7d058e0c [2018-12-30 22:31:46,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 22:31:46,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 22:31:46,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 22:31:46,757 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 22:31:46,758 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 22:31:46,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label40_true-unreach-call.c [2018-12-30 22:31:46,833 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b82f689/0fe34ddd3493412ea3d692392cd05b5a/FLAG915fa7860 [2018-12-30 22:31:47,479 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 22:31:47,480 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label40_true-unreach-call.c [2018-12-30 22:31:47,496 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b82f689/0fe34ddd3493412ea3d692392cd05b5a/FLAG915fa7860 [2018-12-30 22:31:47,695 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b82f689/0fe34ddd3493412ea3d692392cd05b5a [2018-12-30 22:31:47,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 22:31:47,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 22:31:47,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 22:31:47,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 22:31:47,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 22:31:47,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 10:31:47" (1/1) ... [2018-12-30 22:31:47,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283bee70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:47, skipping insertion in model container [2018-12-30 22:31:47,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 10:31:47" (1/1) ... [2018-12-30 22:31:47,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 22:31:47,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 22:31:48,455 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 22:31:48,463 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 22:31:48,634 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 22:31:48,657 INFO L195 MainTranslator]: Completed translation [2018-12-30 22:31:48,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48 WrapperNode [2018-12-30 22:31:48,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 22:31:48,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 22:31:48,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 22:31:48,660 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 22:31:48,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:48,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:48,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 22:31:48,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 22:31:48,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 22:31:48,940 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 22:31:48,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:48,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:48,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:48,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:49,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:49,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:49,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (1/1) ... [2018-12-30 22:31:49,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 22:31:49,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 22:31:49,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 22:31:49,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 22:31:49,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (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 [2018-12-30 22:31:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 22:31:49,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 22:31:53,354 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 22:31:53,355 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 22:31:53,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:31:53 BoogieIcfgContainer [2018-12-30 22:31:53,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 22:31:53,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 22:31:53,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 22:31:53,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 22:31:53,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 10:31:47" (1/3) ... [2018-12-30 22:31:53,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a604bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 10:31:53, skipping insertion in model container [2018-12-30 22:31:53,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:31:48" (2/3) ... [2018-12-30 22:31:53,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a604bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 10:31:53, skipping insertion in model container [2018-12-30 22:31:53,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:31:53" (3/3) ... [2018-12-30 22:31:53,367 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label40_true-unreach-call.c [2018-12-30 22:31:53,378 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 22:31:53,388 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 22:31:53,407 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 22:31:53,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 22:31:53,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 22:31:53,449 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 22:31:53,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 22:31:53,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 22:31:53,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 22:31:53,450 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 22:31:53,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 22:31:53,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 22:31:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2018-12-30 22:31:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 22:31:53,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:53,487 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] [2018-12-30 22:31:53,490 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:53,496 INFO L82 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2018-12-30 22:31:53,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:53,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:53,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:53,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:31:54,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:31:54,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:31:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:54,027 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2018-12-30 22:31:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:31:57,744 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2018-12-30 22:31:57,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:31:57,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-30 22:31:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:31:57,772 INFO L225 Difference]: With dead ends: 951 [2018-12-30 22:31:57,772 INFO L226 Difference]: Without dead ends: 600 [2018-12-30 22:31:57,778 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 [2018-12-30 22:31:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-12-30 22:31:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2018-12-30 22:31:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-30 22:31:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2018-12-30 22:31:57,852 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 44 [2018-12-30 22:31:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:31:57,853 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2018-12-30 22:31:57,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:31:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2018-12-30 22:31:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-30 22:31:57,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:31:57,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:31:57,859 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:31:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:31:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1200539258, now seen corresponding path program 1 times [2018-12-30 22:31:57,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:31:57,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:31:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:57,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:31:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:31:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:31:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:31:58,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:31:58,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:31:58,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:31:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:31:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:31:58,104 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2018-12-30 22:32:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:00,864 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2018-12-30 22:32:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:32:00,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-30 22:32:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:00,875 INFO L225 Difference]: With dead ends: 1572 [2018-12-30 22:32:00,875 INFO L226 Difference]: Without dead ends: 1164 [2018-12-30 22:32:00,880 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 [2018-12-30 22:32:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-12-30 22:32:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2018-12-30 22:32:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-12-30 22:32:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1569 transitions. [2018-12-30 22:32:00,929 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1569 transitions. Word has length 112 [2018-12-30 22:32:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:00,929 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1569 transitions. [2018-12-30 22:32:00,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:32:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1569 transitions. [2018-12-30 22:32:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-30 22:32:00,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:00,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:00,935 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1996860134, now seen corresponding path program 1 times [2018-12-30 22:32:00,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:00,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:00,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:00,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:00,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:32:01,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:32:01,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:32:01,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:32:01,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:32:01,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:01,157 INFO L87 Difference]: Start difference. First operand 1150 states and 1569 transitions. Second operand 4 states. [2018-12-30 22:32:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:04,487 INFO L93 Difference]: Finished difference Result 3968 states and 5436 transitions. [2018-12-30 22:32:04,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:32:04,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-30 22:32:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:04,502 INFO L225 Difference]: With dead ends: 3968 [2018-12-30 22:32:04,503 INFO L226 Difference]: Without dead ends: 2820 [2018-12-30 22:32:04,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2018-12-30 22:32:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2255. [2018-12-30 22:32:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2018-12-30 22:32:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2826 transitions. [2018-12-30 22:32:04,560 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2826 transitions. Word has length 120 [2018-12-30 22:32:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:04,562 INFO L480 AbstractCegarLoop]: Abstraction has 2255 states and 2826 transitions. [2018-12-30 22:32:04,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:32:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2826 transitions. [2018-12-30 22:32:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-30 22:32:04,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:04,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:04,573 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1199532265, now seen corresponding path program 1 times [2018-12-30 22:32:04,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:04,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:04,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:32:04,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:32:04,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:32:04,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:32:04,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:32:04,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:04,886 INFO L87 Difference]: Start difference. First operand 2255 states and 2826 transitions. Second operand 4 states. [2018-12-30 22:32:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:06,652 INFO L93 Difference]: Finished difference Result 5077 states and 6434 transitions. [2018-12-30 22:32:06,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:32:06,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-12-30 22:32:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:06,666 INFO L225 Difference]: With dead ends: 5077 [2018-12-30 22:32:06,666 INFO L226 Difference]: Without dead ends: 3008 [2018-12-30 22:32:06,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2018-12-30 22:32:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2808. [2018-12-30 22:32:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2018-12-30 22:32:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 3477 transitions. [2018-12-30 22:32:06,723 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 3477 transitions. Word has length 171 [2018-12-30 22:32:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:06,724 INFO L480 AbstractCegarLoop]: Abstraction has 2808 states and 3477 transitions. [2018-12-30 22:32:06,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:32:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 3477 transitions. [2018-12-30 22:32:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-30 22:32:06,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:06,730 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 22:32:06,731 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash -25691425, now seen corresponding path program 1 times [2018-12-30 22:32:06,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:06,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:06,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:06,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:06,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:07,324 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-30 22:32:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 83 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:32:07,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:32:07,596 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 [2018-12-30 22:32:07,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:07,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:32:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-30 22:32:08,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:32:08,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-12-30 22:32:08,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 22:32:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 22:32:08,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:32:08,095 INFO L87 Difference]: Start difference. First operand 2808 states and 3477 transitions. Second operand 9 states. [2018-12-30 22:32:11,951 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-12-30 22:32:13,038 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-12-30 22:32:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:24,810 INFO L93 Difference]: Finished difference Result 12653 states and 15778 transitions. [2018-12-30 22:32:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-30 22:32:24,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 246 [2018-12-30 22:32:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:24,853 INFO L225 Difference]: With dead ends: 12653 [2018-12-30 22:32:24,853 INFO L226 Difference]: Without dead ends: 10031 [2018-12-30 22:32:24,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-12-30 22:32:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10031 states. [2018-12-30 22:32:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10031 to 8170. [2018-12-30 22:32:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8170 states. [2018-12-30 22:32:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8170 states to 8170 states and 9692 transitions. [2018-12-30 22:32:25,027 INFO L78 Accepts]: Start accepts. Automaton has 8170 states and 9692 transitions. Word has length 246 [2018-12-30 22:32:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:25,028 INFO L480 AbstractCegarLoop]: Abstraction has 8170 states and 9692 transitions. [2018-12-30 22:32:25,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 22:32:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8170 states and 9692 transitions. [2018-12-30 22:32:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-12-30 22:32:25,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:25,042 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 22:32:25,042 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:25,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1942644120, now seen corresponding path program 1 times [2018-12-30 22:32:25,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:25,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:25,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:25,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:32:25,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:32:25,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 22:32:25,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:32:25,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:32:25,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:32:25,396 INFO L87 Difference]: Start difference. First operand 8170 states and 9692 transitions. Second operand 3 states. [2018-12-30 22:32:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:26,608 INFO L93 Difference]: Finished difference Result 18174 states and 21759 transitions. [2018-12-30 22:32:26,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:32:26,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-12-30 22:32:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:26,646 INFO L225 Difference]: With dead ends: 18174 [2018-12-30 22:32:26,646 INFO L226 Difference]: Without dead ends: 9822 [2018-12-30 22:32:26,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:32:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9822 states. [2018-12-30 22:32:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9822 to 7429. [2018-12-30 22:32:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2018-12-30 22:32:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 8644 transitions. [2018-12-30 22:32:26,810 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 8644 transitions. Word has length 308 [2018-12-30 22:32:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:26,810 INFO L480 AbstractCegarLoop]: Abstraction has 7429 states and 8644 transitions. [2018-12-30 22:32:26,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:32:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 8644 transitions. [2018-12-30 22:32:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-12-30 22:32:26,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:26,822 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 22:32:26,822 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:26,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:26,824 INFO L82 PathProgramCache]: Analyzing trace with hash 14139960, now seen corresponding path program 1 times [2018-12-30 22:32:26,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:26,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:26,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:26,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:26,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:27,222 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-30 22:32:27,609 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-12-30 22:32:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 38 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:32:27,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:32:27,924 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 [2018-12-30 22:32:27,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:28,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:32:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-30 22:32:28,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:32:28,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-12-30 22:32:28,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 22:32:28,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 22:32:28,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:32:28,209 INFO L87 Difference]: Start difference. First operand 7429 states and 8644 transitions. Second operand 8 states. [2018-12-30 22:32:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:34,994 INFO L93 Difference]: Finished difference Result 22042 states and 25990 transitions. [2018-12-30 22:32:34,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 22:32:34,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 324 [2018-12-30 22:32:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:35,029 INFO L225 Difference]: With dead ends: 22042 [2018-12-30 22:32:35,029 INFO L226 Difference]: Without dead ends: 14799 [2018-12-30 22:32:35,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-30 22:32:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14799 states. [2018-12-30 22:32:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14799 to 9818. [2018-12-30 22:32:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9818 states. [2018-12-30 22:32:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9818 states to 9818 states and 11437 transitions. [2018-12-30 22:32:35,209 INFO L78 Accepts]: Start accepts. Automaton has 9818 states and 11437 transitions. Word has length 324 [2018-12-30 22:32:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:35,209 INFO L480 AbstractCegarLoop]: Abstraction has 9818 states and 11437 transitions. [2018-12-30 22:32:35,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 22:32:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9818 states and 11437 transitions. [2018-12-30 22:32:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-12-30 22:32:35,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:35,221 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:35,221 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:35,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash 160008569, now seen corresponding path program 1 times [2018-12-30 22:32:35,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:35,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:35,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:35,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:35,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-30 22:32:35,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:32:35,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:32:35,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:32:35,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:32:35,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:35,539 INFO L87 Difference]: Start difference. First operand 9818 states and 11437 transitions. Second operand 4 states. [2018-12-30 22:32:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:37,318 INFO L93 Difference]: Finished difference Result 21124 states and 24624 transitions. [2018-12-30 22:32:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:32:37,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2018-12-30 22:32:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:37,341 INFO L225 Difference]: With dead ends: 21124 [2018-12-30 22:32:37,342 INFO L226 Difference]: Without dead ends: 12230 [2018-12-30 22:32:37,352 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 [2018-12-30 22:32:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12230 states. [2018-12-30 22:32:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12230 to 10554. [2018-12-30 22:32:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10554 states. [2018-12-30 22:32:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 12181 transitions. [2018-12-30 22:32:37,519 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 12181 transitions. Word has length 326 [2018-12-30 22:32:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:37,520 INFO L480 AbstractCegarLoop]: Abstraction has 10554 states and 12181 transitions. [2018-12-30 22:32:37,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:32:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 12181 transitions. [2018-12-30 22:32:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-12-30 22:32:37,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:37,532 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:37,532 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1715676696, now seen corresponding path program 1 times [2018-12-30 22:32:37,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:37,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:37,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:37,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:37,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:32:38,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:32:38,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:32:38,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:32:38,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:32:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:38,034 INFO L87 Difference]: Start difference. First operand 10554 states and 12181 transitions. Second operand 4 states. [2018-12-30 22:32:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:39,393 INFO L93 Difference]: Finished difference Result 20576 states and 23875 transitions. [2018-12-30 22:32:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:32:39,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2018-12-30 22:32:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:39,413 INFO L225 Difference]: With dead ends: 20576 [2018-12-30 22:32:39,414 INFO L226 Difference]: Without dead ends: 11868 [2018-12-30 22:32:39,424 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 [2018-12-30 22:32:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2018-12-30 22:32:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 11112. [2018-12-30 22:32:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11112 states. [2018-12-30 22:32:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11112 states to 11112 states and 12759 transitions. [2018-12-30 22:32:39,589 INFO L78 Accepts]: Start accepts. Automaton has 11112 states and 12759 transitions. Word has length 330 [2018-12-30 22:32:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:39,590 INFO L480 AbstractCegarLoop]: Abstraction has 11112 states and 12759 transitions. [2018-12-30 22:32:39,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:32:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 11112 states and 12759 transitions. [2018-12-30 22:32:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-12-30 22:32:39,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:39,605 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:39,607 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash 283838804, now seen corresponding path program 1 times [2018-12-30 22:32:39,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:39,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:39,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:39,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:39,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:40,257 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-12-30 22:32:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 125 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 22:32:40,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:32:40,398 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 [2018-12-30 22:32:40,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:40,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:32:41,325 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 483 DAG size of output: 27 [2018-12-30 22:32:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 125 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 22:32:41,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:32:41,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-12-30 22:32:41,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 22:32:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 22:32:41,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-30 22:32:41,989 INFO L87 Difference]: Start difference. First operand 11112 states and 12759 transitions. Second operand 7 states. [2018-12-30 22:32:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:45,321 INFO L93 Difference]: Finished difference Result 23519 states and 27103 transitions. [2018-12-30 22:32:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 22:32:45,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2018-12-30 22:32:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:45,344 INFO L225 Difference]: With dead ends: 23519 [2018-12-30 22:32:45,344 INFO L226 Difference]: Without dead ends: 13516 [2018-12-30 22:32:45,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:32:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13516 states. [2018-12-30 22:32:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13516 to 11298. [2018-12-30 22:32:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2018-12-30 22:32:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 12762 transitions. [2018-12-30 22:32:45,517 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 12762 transitions. Word has length 353 [2018-12-30 22:32:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:45,518 INFO L480 AbstractCegarLoop]: Abstraction has 11298 states and 12762 transitions. [2018-12-30 22:32:45,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 22:32:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 12762 transitions. [2018-12-30 22:32:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-12-30 22:32:45,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:45,533 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:45,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2116616153, now seen corresponding path program 1 times [2018-12-30 22:32:45,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:45,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:45,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-30 22:32:45,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:32:45,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:32:45,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:32:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:32:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:32:45,941 INFO L87 Difference]: Start difference. First operand 11298 states and 12762 transitions. Second operand 4 states. [2018-12-30 22:32:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:32:47,393 INFO L93 Difference]: Finished difference Result 20563 states and 23294 transitions. [2018-12-30 22:32:47,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:32:47,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 363 [2018-12-30 22:32:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:32:47,407 INFO L225 Difference]: With dead ends: 20563 [2018-12-30 22:32:47,408 INFO L226 Difference]: Without dead ends: 11111 [2018-12-30 22:32:47,417 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 [2018-12-30 22:32:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11111 states. [2018-12-30 22:32:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11111 to 11108. [2018-12-30 22:32:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11108 states. [2018-12-30 22:32:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11108 states to 11108 states and 12383 transitions. [2018-12-30 22:32:47,567 INFO L78 Accepts]: Start accepts. Automaton has 11108 states and 12383 transitions. Word has length 363 [2018-12-30 22:32:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:32:47,568 INFO L480 AbstractCegarLoop]: Abstraction has 11108 states and 12383 transitions. [2018-12-30 22:32:47,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:32:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 11108 states and 12383 transitions. [2018-12-30 22:32:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-12-30 22:32:47,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:32:47,581 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:32:47,581 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:32:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:32:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1717603792, now seen corresponding path program 1 times [2018-12-30 22:32:47,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:32:47,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:32:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:47,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:32:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:48,116 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-30 22:32:48,410 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-12-30 22:32:48,750 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-12-30 22:32:49,175 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-30 22:32:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 305 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:32:49,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:32:49,493 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 [2018-12-30 22:32:49,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:32:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:32:49,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:32:49,834 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-30 22:32:50,270 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-12-30 22:32:50,652 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-30 22:32:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 241 proven. 68 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:32:50,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:32:50,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-12-30 22:32:50,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 22:32:50,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 22:32:50,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-30 22:32:50,959 INFO L87 Difference]: Start difference. First operand 11108 states and 12383 transitions. Second operand 10 states. [2018-12-30 22:32:53,863 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-12-30 22:33:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:01,798 INFO L93 Difference]: Finished difference Result 25962 states and 28789 transitions. [2018-12-30 22:33:01,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-30 22:33:01,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 370 [2018-12-30 22:33:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:01,822 INFO L225 Difference]: With dead ends: 25962 [2018-12-30 22:33:01,823 INFO L226 Difference]: Without dead ends: 15040 [2018-12-30 22:33:01,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-12-30 22:33:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15040 states. [2018-12-30 22:33:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15040 to 11105. [2018-12-30 22:33:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11105 states. [2018-12-30 22:33:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11105 states to 11105 states and 12328 transitions. [2018-12-30 22:33:02,011 INFO L78 Accepts]: Start accepts. Automaton has 11105 states and 12328 transitions. Word has length 370 [2018-12-30 22:33:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:02,011 INFO L480 AbstractCegarLoop]: Abstraction has 11105 states and 12328 transitions. [2018-12-30 22:33:02,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 22:33:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 11105 states and 12328 transitions. [2018-12-30 22:33:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-12-30 22:33:02,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:02,022 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:33:02,022 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1792377671, now seen corresponding path program 1 times [2018-12-30 22:33:02,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:02,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:02,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:02,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:33:02,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:33:02,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:33:02,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:33:02,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:33:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:33:02,531 INFO L87 Difference]: Start difference. First operand 11105 states and 12328 transitions. Second operand 5 states. [2018-12-30 22:33:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:04,726 INFO L93 Difference]: Finished difference Result 25708 states and 28517 transitions. [2018-12-30 22:33:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 22:33:04,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 370 [2018-12-30 22:33:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:04,745 INFO L225 Difference]: With dead ends: 25708 [2018-12-30 22:33:04,745 INFO L226 Difference]: Without dead ends: 14789 [2018-12-30 22:33:04,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:33:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14789 states. [2018-12-30 22:33:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14789 to 12759. [2018-12-30 22:33:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12759 states. [2018-12-30 22:33:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12759 states to 12759 states and 13991 transitions. [2018-12-30 22:33:04,943 INFO L78 Accepts]: Start accepts. Automaton has 12759 states and 13991 transitions. Word has length 370 [2018-12-30 22:33:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:04,944 INFO L480 AbstractCegarLoop]: Abstraction has 12759 states and 13991 transitions. [2018-12-30 22:33:04,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:33:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 12759 states and 13991 transitions. [2018-12-30 22:33:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-12-30 22:33:04,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:04,957 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:33:04,958 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:04,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1559812086, now seen corresponding path program 1 times [2018-12-30 22:33:04,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:04,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:04,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:04,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:04,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-30 22:33:05,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:33:05,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 22:33:05,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:33:05,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:33:05,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:33:05,283 INFO L87 Difference]: Start difference. First operand 12759 states and 13991 transitions. Second operand 3 states. [2018-12-30 22:33:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:05,861 INFO L93 Difference]: Finished difference Result 22372 states and 24570 transitions. [2018-12-30 22:33:05,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:33:05,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 416 [2018-12-30 22:33:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:05,873 INFO L225 Difference]: With dead ends: 22372 [2018-12-30 22:33:05,873 INFO L226 Difference]: Without dead ends: 11457 [2018-12-30 22:33:05,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:33:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11457 states. [2018-12-30 22:33:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11457 to 11454. [2018-12-30 22:33:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11454 states. [2018-12-30 22:33:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11454 states to 11454 states and 12498 transitions. [2018-12-30 22:33:06,030 INFO L78 Accepts]: Start accepts. Automaton has 11454 states and 12498 transitions. Word has length 416 [2018-12-30 22:33:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:06,030 INFO L480 AbstractCegarLoop]: Abstraction has 11454 states and 12498 transitions. [2018-12-30 22:33:06,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:33:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 11454 states and 12498 transitions. [2018-12-30 22:33:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-12-30 22:33:06,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:06,042 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:33:06,043 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:06,043 INFO L82 PathProgramCache]: Analyzing trace with hash -225925453, now seen corresponding path program 1 times [2018-12-30 22:33:06,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:06,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:06,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-30 22:33:06,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:33:06,916 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 [2018-12-30 22:33:06,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:07,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:33:22,571 WARN L181 SmtUtils]: Spent 15.23 s on a formula simplification. DAG size of input: 565 DAG size of output: 33 [2018-12-30 22:33:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 321 proven. 42 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-30 22:33:22,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:33:22,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-30 22:33:22,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 22:33:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 22:33:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:33:22,986 INFO L87 Difference]: Start difference. First operand 11454 states and 12498 transitions. Second operand 8 states. [2018-12-30 22:33:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:28,134 INFO L93 Difference]: Finished difference Result 27148 states and 29598 transitions. [2018-12-30 22:33:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 22:33:28,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 439 [2018-12-30 22:33:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:28,150 INFO L225 Difference]: With dead ends: 27148 [2018-12-30 22:33:28,150 INFO L226 Difference]: Without dead ends: 15325 [2018-12-30 22:33:28,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:33:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15325 states. [2018-12-30 22:33:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15325 to 11084. [2018-12-30 22:33:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11084 states. [2018-12-30 22:33:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11084 states to 11084 states and 11966 transitions. [2018-12-30 22:33:28,345 INFO L78 Accepts]: Start accepts. Automaton has 11084 states and 11966 transitions. Word has length 439 [2018-12-30 22:33:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:28,346 INFO L480 AbstractCegarLoop]: Abstraction has 11084 states and 11966 transitions. [2018-12-30 22:33:28,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 22:33:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11084 states and 11966 transitions. [2018-12-30 22:33:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-12-30 22:33:28,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:28,360 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:33:28,361 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash -883041383, now seen corresponding path program 1 times [2018-12-30 22:33:28,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:28,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:28,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-30 22:33:28,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:33:28,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:33:28,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:33:28,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:33:28,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:33:28,890 INFO L87 Difference]: Start difference. First operand 11084 states and 11966 transitions. Second operand 3 states. [2018-12-30 22:33:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:29,771 INFO L93 Difference]: Finished difference Result 22718 states and 24501 transitions. [2018-12-30 22:33:29,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:33:29,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2018-12-30 22:33:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:29,784 INFO L225 Difference]: With dead ends: 22718 [2018-12-30 22:33:29,784 INFO L226 Difference]: Without dead ends: 11822 [2018-12-30 22:33:29,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:33:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2018-12-30 22:33:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 10532. [2018-12-30 22:33:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10532 states. [2018-12-30 22:33:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10532 states to 10532 states and 11331 transitions. [2018-12-30 22:33:29,935 INFO L78 Accepts]: Start accepts. Automaton has 10532 states and 11331 transitions. Word has length 441 [2018-12-30 22:33:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:29,935 INFO L480 AbstractCegarLoop]: Abstraction has 10532 states and 11331 transitions. [2018-12-30 22:33:29,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:33:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 10532 states and 11331 transitions. [2018-12-30 22:33:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-12-30 22:33:29,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:29,944 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, 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, 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] [2018-12-30 22:33:29,945 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash -597325104, now seen corresponding path program 1 times [2018-12-30 22:33:29,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:29,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:29,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 436 proven. 78 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-12-30 22:33:30,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:33:30,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:33:30,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:30,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:33:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 436 proven. 78 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-12-30 22:33:30,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:33:30,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-30 22:33:30,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:33:30,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:33:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:33:30,720 INFO L87 Difference]: Start difference. First operand 10532 states and 11331 transitions. Second operand 5 states. [2018-12-30 22:33:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:33,550 INFO L93 Difference]: Finished difference Result 22357 states and 24052 transitions. [2018-12-30 22:33:33,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 22:33:33,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 449 [2018-12-30 22:33:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:33,563 INFO L225 Difference]: With dead ends: 22357 [2018-12-30 22:33:33,563 INFO L226 Difference]: Without dead ends: 12381 [2018-12-30 22:33:33,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-30 22:33:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12381 states. [2018-12-30 22:33:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12381 to 10716. [2018-12-30 22:33:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10716 states. [2018-12-30 22:33:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10716 states to 10716 states and 11493 transitions. [2018-12-30 22:33:33,773 INFO L78 Accepts]: Start accepts. Automaton has 10716 states and 11493 transitions. Word has length 449 [2018-12-30 22:33:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:33,773 INFO L480 AbstractCegarLoop]: Abstraction has 10716 states and 11493 transitions. [2018-12-30 22:33:33,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:33:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 10716 states and 11493 transitions. [2018-12-30 22:33:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-12-30 22:33:33,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:33,783 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, 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, 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] [2018-12-30 22:33:33,784 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1006159341, now seen corresponding path program 1 times [2018-12-30 22:33:33,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:33,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:33,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:33,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:33,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-30 22:33:34,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:33:34,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:33:34,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:33:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:33:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:33:34,385 INFO L87 Difference]: Start difference. First operand 10716 states and 11493 transitions. Second operand 4 states. [2018-12-30 22:33:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:36,399 INFO L93 Difference]: Finished difference Result 22359 states and 23935 transitions. [2018-12-30 22:33:36,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:33:36,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2018-12-30 22:33:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:36,411 INFO L225 Difference]: With dead ends: 22359 [2018-12-30 22:33:36,411 INFO L226 Difference]: Without dead ends: 12199 [2018-12-30 22:33:36,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:33:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12199 states. [2018-12-30 22:33:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12199 to 9790. [2018-12-30 22:33:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9790 states. [2018-12-30 22:33:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9790 states to 9790 states and 10472 transitions. [2018-12-30 22:33:36,547 INFO L78 Accepts]: Start accepts. Automaton has 9790 states and 10472 transitions. Word has length 496 [2018-12-30 22:33:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:36,548 INFO L480 AbstractCegarLoop]: Abstraction has 9790 states and 10472 transitions. [2018-12-30 22:33:36,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:33:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 9790 states and 10472 transitions. [2018-12-30 22:33:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-12-30 22:33:36,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:36,554 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, 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, 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] [2018-12-30 22:33:36,554 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1384310801, now seen corresponding path program 1 times [2018-12-30 22:33:36,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:36,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:36,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:37,047 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 22:33:37,583 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-12-30 22:33:38,036 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-12-30 22:33:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 499 proven. 230 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:33:38,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:33:38,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:33:38,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:38,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:33:39,230 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-30 22:33:39,453 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-30 22:33:39,766 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2018-12-30 22:33:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 499 proven. 230 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:33:40,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:33:40,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2018-12-30 22:33:40,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 22:33:40,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 22:33:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-12-30 22:33:40,760 INFO L87 Difference]: Start difference. First operand 9790 states and 10472 transitions. Second operand 14 states. [2018-12-30 22:33:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:47,195 INFO L93 Difference]: Finished difference Result 20592 states and 21994 transitions. [2018-12-30 22:33:47,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-30 22:33:47,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 501 [2018-12-30 22:33:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:47,205 INFO L225 Difference]: With dead ends: 20592 [2018-12-30 22:33:47,205 INFO L226 Difference]: Without dead ends: 11539 [2018-12-30 22:33:47,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 497 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2018-12-30 22:33:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11539 states. [2018-12-30 22:33:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11539 to 9235. [2018-12-30 22:33:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9235 states. [2018-12-30 22:33:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9235 states to 9235 states and 9881 transitions. [2018-12-30 22:33:47,341 INFO L78 Accepts]: Start accepts. Automaton has 9235 states and 9881 transitions. Word has length 501 [2018-12-30 22:33:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:47,341 INFO L480 AbstractCegarLoop]: Abstraction has 9235 states and 9881 transitions. [2018-12-30 22:33:47,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 22:33:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 9235 states and 9881 transitions. [2018-12-30 22:33:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-12-30 22:33:47,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:47,349 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 22:33:47,349 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:47,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash 789546173, now seen corresponding path program 1 times [2018-12-30 22:33:47,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:47,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:47,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:47,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:47,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:48,105 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-30 22:33:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 500 proven. 247 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:33:48,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:33:48,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:33:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:48,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:33:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 500 proven. 247 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-30 22:33:49,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:33:49,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-30 22:33:49,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 22:33:49,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 22:33:49,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:33:49,779 INFO L87 Difference]: Start difference. First operand 9235 states and 9881 transitions. Second operand 9 states. [2018-12-30 22:33:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:54,883 INFO L93 Difference]: Finished difference Result 19396 states and 20726 transitions. [2018-12-30 22:33:54,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 22:33:54,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 545 [2018-12-30 22:33:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:54,896 INFO L225 Difference]: With dead ends: 19396 [2018-12-30 22:33:54,896 INFO L226 Difference]: Without dead ends: 10715 [2018-12-30 22:33:54,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-12-30 22:33:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10715 states. [2018-12-30 22:33:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10715 to 9233. [2018-12-30 22:33:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9233 states. [2018-12-30 22:33:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9233 states to 9233 states and 9838 transitions. [2018-12-30 22:33:55,034 INFO L78 Accepts]: Start accepts. Automaton has 9233 states and 9838 transitions. Word has length 545 [2018-12-30 22:33:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:55,034 INFO L480 AbstractCegarLoop]: Abstraction has 9233 states and 9838 transitions. [2018-12-30 22:33:55,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 22:33:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9233 states and 9838 transitions. [2018-12-30 22:33:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2018-12-30 22:33:55,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:55,041 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 22:33:55,041 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash 27802822, now seen corresponding path program 1 times [2018-12-30 22:33:55,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:55,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:55,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-12-30 22:33:55,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:33:55,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 22:33:55,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:33:55,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:33:55,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:33:55,492 INFO L87 Difference]: Start difference. First operand 9233 states and 9838 transitions. Second operand 5 states. [2018-12-30 22:33:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:33:57,762 INFO L93 Difference]: Finished difference Result 17731 states and 18909 transitions. [2018-12-30 22:33:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 22:33:57,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 561 [2018-12-30 22:33:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:33:57,773 INFO L225 Difference]: With dead ends: 17731 [2018-12-30 22:33:57,773 INFO L226 Difference]: Without dead ends: 9420 [2018-12-30 22:33:57,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-30 22:33:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9420 states. [2018-12-30 22:33:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9420 to 7943. [2018-12-30 22:33:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7943 states. [2018-12-30 22:33:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 8436 transitions. [2018-12-30 22:33:57,886 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 8436 transitions. Word has length 561 [2018-12-30 22:33:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:33:57,887 INFO L480 AbstractCegarLoop]: Abstraction has 7943 states and 8436 transitions. [2018-12-30 22:33:57,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:33:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 8436 transitions. [2018-12-30 22:33:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2018-12-30 22:33:57,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:33:57,895 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:33:57,896 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:33:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:33:57,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1180727470, now seen corresponding path program 1 times [2018-12-30 22:33:57,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:33:57,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:33:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:57,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:33:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 132 proven. 1061 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-30 22:33:59,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:33:59,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:33:59,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:33:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:33:59,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:34:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 428 proven. 765 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-30 22:34:01,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:34:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-12-30 22:34:01,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 22:34:01,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 22:34:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-30 22:34:01,127 INFO L87 Difference]: Start difference. First operand 7943 states and 8436 transitions. Second operand 12 states. [2018-12-30 22:34:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:34:06,186 INFO L93 Difference]: Finished difference Result 23269 states and 24661 transitions. [2018-12-30 22:34:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 22:34:06,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 716 [2018-12-30 22:34:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:34:06,207 INFO L225 Difference]: With dead ends: 23269 [2018-12-30 22:34:06,207 INFO L226 Difference]: Without dead ends: 15696 [2018-12-30 22:34:06,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 711 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-30 22:34:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15696 states. [2018-12-30 22:34:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15696 to 10337. [2018-12-30 22:34:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10337 states. [2018-12-30 22:34:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10337 states to 10337 states and 10963 transitions. [2018-12-30 22:34:06,379 INFO L78 Accepts]: Start accepts. Automaton has 10337 states and 10963 transitions. Word has length 716 [2018-12-30 22:34:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:34:06,380 INFO L480 AbstractCegarLoop]: Abstraction has 10337 states and 10963 transitions. [2018-12-30 22:34:06,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 22:34:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 10337 states and 10963 transitions. [2018-12-30 22:34:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2018-12-30 22:34:06,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:34:06,390 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:34:06,391 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:34:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:34:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash -424076112, now seen corresponding path program 1 times [2018-12-30 22:34:06,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:34:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:34:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:34:06,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:34:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:34:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:34:06,995 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-12-30 22:34:07,183 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-12-30 22:34:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 1498 proven. 115 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-12-30 22:34:07,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:34:07,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:34:07,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:34:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:34:07,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:34:10,497 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 184 DAG size of output: 25 [2018-12-30 22:34:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 1387 proven. 84 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2018-12-30 22:34:12,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:34:12,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-30 22:34:12,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 22:34:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 22:34:12,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:34:12,209 INFO L87 Difference]: Start difference. First operand 10337 states and 10963 transitions. Second operand 8 states. [2018-12-30 22:34:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:34:21,036 INFO L93 Difference]: Finished difference Result 29889 states and 31675 transitions. [2018-12-30 22:34:21,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-30 22:34:21,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 810 [2018-12-30 22:34:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:34:21,059 INFO L225 Difference]: With dead ends: 29889 [2018-12-30 22:34:21,060 INFO L226 Difference]: Without dead ends: 20106 [2018-12-30 22:34:21,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 815 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-30 22:34:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20106 states. [2018-12-30 22:34:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20106 to 12365. [2018-12-30 22:34:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12365 states. [2018-12-30 22:34:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12365 states to 12365 states and 13123 transitions. [2018-12-30 22:34:21,298 INFO L78 Accepts]: Start accepts. Automaton has 12365 states and 13123 transitions. Word has length 810 [2018-12-30 22:34:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:34:21,298 INFO L480 AbstractCegarLoop]: Abstraction has 12365 states and 13123 transitions. [2018-12-30 22:34:21,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 22:34:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 12365 states and 13123 transitions. [2018-12-30 22:34:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2018-12-30 22:34:21,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:34:21,314 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2018-12-30 22:34:21,315 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:34:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:34:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash 974634076, now seen corresponding path program 2 times [2018-12-30 22:34:21,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:34:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:34:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:34:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:34:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:34:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:34:22,096 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-12-30 22:34:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 1461 proven. 42 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-12-30 22:34:22,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:34:22,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:34:22,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 22:34:22,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 22:34:22,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 22:34:22,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:34:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 1461 proven. 42 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-12-30 22:34:23,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:34:23,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-12-30 22:34:23,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 22:34:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 22:34:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 22:34:23,648 INFO L87 Difference]: Start difference. First operand 12365 states and 13123 transitions. Second operand 6 states. [2018-12-30 22:34:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:34:26,224 INFO L93 Difference]: Finished difference Result 28227 states and 29881 transitions. [2018-12-30 22:34:26,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 22:34:26,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 976 [2018-12-30 22:34:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:34:26,226 INFO L225 Difference]: With dead ends: 28227 [2018-12-30 22:34:26,226 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 22:34:26,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 975 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 22:34:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 22:34:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 22:34:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 22:34:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 22:34:26,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 976 [2018-12-30 22:34:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:34:26,237 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 22:34:26,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 22:34:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 22:34:26,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 22:34:26,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 22:34:26,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:26,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:26,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:26,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:26,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:26,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:26,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:26,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:27,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:27,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:27,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:28,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:28,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:28,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,418 WARN L181 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 983 DAG size of output: 859 [2018-12-30 22:34:29,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:29,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:30,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:30,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:30,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:30,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:31,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:34:31,635 WARN L181 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 983 DAG size of output: 859 [2018-12-30 22:34:45,475 WARN L181 SmtUtils]: Spent 13.83 s on a formula simplification. DAG size of input: 834 DAG size of output: 224 [2018-12-30 22:34:58,674 WARN L181 SmtUtils]: Spent 13.19 s on a formula simplification. DAG size of input: 834 DAG size of output: 224 [2018-12-30 22:34:58,679 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-30 22:34:58,679 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-12-30 22:34:58,679 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-12-30 22:34:58,679 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-12-30 22:34:58,679 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,679 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,679 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,680 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,681 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,681 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,681 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,681 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,681 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-30 22:34:58,681 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-12-30 22:34:58,681 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-30 22:34:58,681 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,682 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse4 (= ~a25~0 10)) (.cse7 (= ~a25~0 13))) (let ((.cse20 (< 140 ~a29~0)) (.cse52 (not .cse7)) (.cse38 (= ~a4~0 1)) (.cse51 (not .cse4)) (.cse41 (+ ~a23~0 43))) (let ((.cse15 (<= ~a29~0 140)) (.cse27 (= ~a25~0 12)) (.cse46 (< 0 .cse41)) (.cse47 (and .cse52 .cse38 .cse51)) (.cse0 (= ~a8~0 15)) (.cse28 (and .cse20 .cse38 .cse51)) (.cse14 (<= ~a23~0 138)) (.cse6 (= ~a25~0 11))) (let ((.cse37 (<= (+ ~a23~0 127600) 0)) (.cse1 (<= ~a4~0 0)) (.cse34 (not .cse6)) (.cse42 (<= ~a29~0 274)) (.cse13 (or (and .cse47 .cse0 .cse14) (and .cse0 .cse28 .cse14))) (.cse12 (= ~a25~0 9)) (.cse35 (< 306 ~a23~0)) (.cse5 (= ~a3~0 1)) (.cse29 (< 245 ~a29~0)) (.cse48 (and (and .cse46 .cse52 .cse51) .cse20)) (.cse43 (<= ~a29~0 277)) (.cse36 (<= ~a29~0 130)) (.cse49 (not .cse27)) (.cse18 (= 1 ~a4~0)) (.cse26 (and .cse52 .cse15))) (let ((.cse23 (let ((.cse50 (and .cse46 .cse26 .cse51))) (or (and .cse36 .cse50 .cse18) (and .cse50 .cse49 .cse18)))) (.cse21 (and .cse48 .cse49 .cse43 .cse18)) (.cse8 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse46 .cse20)) (.cse19 (<= ~a23~0 599997)) (.cse16 (<= ~a23~0 312)) (.cse17 (or .cse46 .cse20)) (.cse24 (and .cse29 (and .cse6 .cse28))) (.cse25 (and (or (and .cse48 .cse6) (and .cse0 .cse20 (and .cse27 .cse35) .cse5)) .cse43 .cse18)) (.cse30 (or (and .cse47 .cse12 .cse35 .cse5) (and .cse38 .cse4))) (.cse31 (<= 260 ~a29~0)) (.cse11 (<= ~a29~0 245)) (.cse22 (and (or (and .cse46 .cse4) (and .cse12 .cse0 .cse35)) .cse43 .cse18)) (.cse10 (and (or (and .cse37 .cse12 .cse0 .cse1 .cse26) (and .cse34 .cse42 .cse13)) .cse5)) (.cse3 (exists ((v_prenex_37 Int)) (let ((.cse44 (div v_prenex_37 5))) (let ((.cse45 (mod (+ (div (+ .cse44 (- 54477)) 5) 1) 90))) (and (<= (+ v_prenex_37 43) 0) (<= (+ v_prenex_37 599992) 0) (not (= (mod (+ .cse44 3) 5) 0)) (= (mod v_prenex_37 5) 0) (< .cse44 54477) (<= ~a23~0 (+ .cse45 119)) (= .cse45 0)))))) (.cse32 (= 15 ~a8~0)) (.cse2 (<= ~a29~0 599998))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse2 (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse5)) (let ((.cse9 (+ ~a23~0 599908))) (and (<= .cse9 0) .cse10 (<= 0 .cse9) .cse11)) (and .cse12 .cse13) (and .cse5 (and .cse0 .cse1 .cse14 (and .cse4 .cse15))) (and .cse6 .cse16 .cse0 .cse17 .cse18 .cse5) (and .cse19 (and .cse20 (and (or (and .cse12 .cse0 .cse21) (and .cse22 .cse0)) .cse5))) (and .cse23 .cse16 .cse12 .cse0) (and .cse23 .cse0 .cse14) (and .cse0 .cse24 .cse5) (and .cse19 (and (and .cse0 .cse25) .cse5)) (and .cse0 .cse21 .cse14) (and .cse12 (and .cse0 .cse1 .cse26) .cse14 .cse5) (and .cse27 .cse0 .cse1 .cse8 (<= (+ ~a29~0 22) 0) .cse5) (and (or (and .cse12 .cse0 (and .cse28 .cse29)) (and .cse30 .cse0 .cse31)) .cse5) (and .cse32 .cse18 .cse19 (exists ((v_prenex_63 Int)) (let ((.cse33 (+ v_prenex_63 69157))) (and (<= 130 v_prenex_63) (<= ~a29~0 (+ (mod .cse33 299861) 300138)) (<= 0 .cse33)))) .cse34 .cse35 .cse5) (and .cse7 (<= ~a23~0 306) .cse28) (and .cse7 .cse36 .cse18 (<= ~a23~0 262)) (and .cse37 .cse38 .cse4) (and .cse27 .cse16 .cse0 .cse38 .cse5 .cse17) (and .cse0 .cse3 .cse24) (and .cse0 .cse5 (and .cse25 .cse29)) (and .cse30 .cse0 .cse3 .cse31) (and (or (and .cse7 .cse0 .cse11 .cse18 .cse5) (and (and .cse0 (and .cse22 .cse29)) .cse5)) .cse20) (and .cse27 .cse10 (exists ((v_prenex_63 Int)) (let ((.cse39 (+ v_prenex_63 69157))) (and (<= 130 v_prenex_63) (<= (+ ~a29~0 299882) (mod .cse39 299861)) (<= 0 .cse39))))) (and (= 1 ~a3~0) .cse3 .cse32 .cse18 .cse4) (and (and (or (and .cse12 .cse0 .cse1 (exists ((v_prenex_58 Int)) (let ((.cse40 (mod v_prenex_58 299861))) (and (< 140 v_prenex_58) (<= (+ .cse40 10250) ~a29~0) (= 0 .cse40)))) .cse5 (<= .cse41 0)) (and (or (and .cse42 (and .cse0 .cse1 (and .cse27 .cse20))) (and .cse43 (and .cse0 (and .cse1 (and .cse37 .cse27) .cse29)))) .cse5)) .cse2) .cse14))))))) [2018-12-30 22:34:58,682 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,682 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,682 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,682 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,682 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,683 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-30 22:34:58,684 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,685 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,686 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-30 22:34:58,687 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,688 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,689 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,690 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,691 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,692 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,693 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,694 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,695 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-12-30 22:34:58,696 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 22:34:58,697 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,698 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-30 22:34:58,699 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,700 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,701 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,702 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,703 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,704 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse4 (= ~a25~0 10)) (.cse7 (= ~a25~0 13))) (let ((.cse20 (< 140 ~a29~0)) (.cse52 (not .cse7)) (.cse38 (= ~a4~0 1)) (.cse51 (not .cse4)) (.cse41 (+ ~a23~0 43))) (let ((.cse15 (<= ~a29~0 140)) (.cse27 (= ~a25~0 12)) (.cse46 (< 0 .cse41)) (.cse47 (and .cse52 .cse38 .cse51)) (.cse0 (= ~a8~0 15)) (.cse28 (and .cse20 .cse38 .cse51)) (.cse14 (<= ~a23~0 138)) (.cse6 (= ~a25~0 11))) (let ((.cse37 (<= (+ ~a23~0 127600) 0)) (.cse1 (<= ~a4~0 0)) (.cse34 (not .cse6)) (.cse42 (<= ~a29~0 274)) (.cse13 (or (and .cse47 .cse0 .cse14) (and .cse0 .cse28 .cse14))) (.cse12 (= ~a25~0 9)) (.cse35 (< 306 ~a23~0)) (.cse5 (= ~a3~0 1)) (.cse29 (< 245 ~a29~0)) (.cse48 (and (and .cse46 .cse52 .cse51) .cse20)) (.cse43 (<= ~a29~0 277)) (.cse36 (<= ~a29~0 130)) (.cse49 (not .cse27)) (.cse18 (= 1 ~a4~0)) (.cse26 (and .cse52 .cse15))) (let ((.cse23 (let ((.cse50 (and .cse46 .cse26 .cse51))) (or (and .cse36 .cse50 .cse18) (and .cse50 .cse49 .cse18)))) (.cse21 (and .cse48 .cse49 .cse43 .cse18)) (.cse8 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse46 .cse20)) (.cse19 (<= ~a23~0 599997)) (.cse16 (<= ~a23~0 312)) (.cse17 (or .cse46 .cse20)) (.cse24 (and .cse29 (and .cse6 .cse28))) (.cse25 (and (or (and .cse48 .cse6) (and .cse0 .cse20 (and .cse27 .cse35) .cse5)) .cse43 .cse18)) (.cse30 (or (and .cse47 .cse12 .cse35 .cse5) (and .cse38 .cse4))) (.cse31 (<= 260 ~a29~0)) (.cse11 (<= ~a29~0 245)) (.cse22 (and (or (and .cse46 .cse4) (and .cse12 .cse0 .cse35)) .cse43 .cse18)) (.cse10 (and (or (and .cse37 .cse12 .cse0 .cse1 .cse26) (and .cse34 .cse42 .cse13)) .cse5)) (.cse3 (exists ((v_prenex_37 Int)) (let ((.cse44 (div v_prenex_37 5))) (let ((.cse45 (mod (+ (div (+ .cse44 (- 54477)) 5) 1) 90))) (and (<= (+ v_prenex_37 43) 0) (<= (+ v_prenex_37 599992) 0) (not (= (mod (+ .cse44 3) 5) 0)) (= (mod v_prenex_37 5) 0) (< .cse44 54477) (<= ~a23~0 (+ .cse45 119)) (= .cse45 0)))))) (.cse32 (= 15 ~a8~0)) (.cse2 (<= ~a29~0 599998))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse2 (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse5)) (let ((.cse9 (+ ~a23~0 599908))) (and (<= .cse9 0) .cse10 (<= 0 .cse9) .cse11)) (and .cse12 .cse13) (and .cse5 (and .cse0 .cse1 .cse14 (and .cse4 .cse15))) (and .cse6 .cse16 .cse0 .cse17 .cse18 .cse5) (and .cse19 (and .cse20 (and (or (and .cse12 .cse0 .cse21) (and .cse22 .cse0)) .cse5))) (and .cse23 .cse16 .cse12 .cse0) (and .cse23 .cse0 .cse14) (and .cse0 .cse24 .cse5) (and .cse19 (and (and .cse0 .cse25) .cse5)) (and .cse0 .cse21 .cse14) (and .cse12 (and .cse0 .cse1 .cse26) .cse14 .cse5) (and .cse27 .cse0 .cse1 .cse8 (<= (+ ~a29~0 22) 0) .cse5) (and (or (and .cse12 .cse0 (and .cse28 .cse29)) (and .cse30 .cse0 .cse31)) .cse5) (and .cse32 .cse18 .cse19 (exists ((v_prenex_63 Int)) (let ((.cse33 (+ v_prenex_63 69157))) (and (<= 130 v_prenex_63) (<= ~a29~0 (+ (mod .cse33 299861) 300138)) (<= 0 .cse33)))) .cse34 .cse35 .cse5) (and .cse7 (<= ~a23~0 306) .cse28) (and .cse7 .cse36 .cse18 (<= ~a23~0 262)) (and .cse37 .cse38 .cse4) (and .cse27 .cse16 .cse0 .cse38 .cse5 .cse17) (and .cse0 .cse3 .cse24) (and .cse0 .cse5 (and .cse25 .cse29)) (and .cse30 .cse0 .cse3 .cse31) (and (or (and .cse7 .cse0 .cse11 .cse18 .cse5) (and (and .cse0 (and .cse22 .cse29)) .cse5)) .cse20) (and .cse27 .cse10 (exists ((v_prenex_63 Int)) (let ((.cse39 (+ v_prenex_63 69157))) (and (<= 130 v_prenex_63) (<= (+ ~a29~0 299882) (mod .cse39 299861)) (<= 0 .cse39))))) (and (= 1 ~a3~0) .cse3 .cse32 .cse18 .cse4) (and (and (or (and .cse12 .cse0 .cse1 (exists ((v_prenex_58 Int)) (let ((.cse40 (mod v_prenex_58 299861))) (and (< 140 v_prenex_58) (<= (+ .cse40 10250) ~a29~0) (= 0 .cse40)))) .cse5 (<= .cse41 0)) (and (or (and .cse42 (and .cse0 .cse1 (and .cse27 .cse20))) (and .cse43 (and .cse0 (and .cse1 (and .cse37 .cse27) .cse29)))) .cse5)) .cse2) .cse14))))))) [2018-12-30 22:34:58,704 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,705 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-12-30 22:34:58,705 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-12-30 22:34:58,705 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,705 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,705 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-12-30 22:34:58,705 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,705 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,705 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:34:58,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:58,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:58,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:58,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 10:34:58 BoogieIcfgContainer [2018-12-30 22:34:58,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 22:34:58,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 22:34:58,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 22:34:58,840 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 22:34:58,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:31:53" (3/4) ... [2018-12-30 22:34:58,857 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 22:34:58,909 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 22:34:58,913 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 22:34:58,956 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a25 == 10) && a3 == 1) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a25 == 11) && a3 == 1)) || (a29 <= 599998 && ((((a25 == 13 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a3 == 1)) || (((a23 + 599908 <= 0 && (((((a23 + 127600 <= 0 && a25 == 9) && a8 == 15) && a4 <= 0) && !(a25 == 13) && a29 <= 140) || ((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) && a3 == 1) && 0 <= a23 + 599908) && a29 <= 245)) || (a25 == 9 && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) || (a3 == 1 && ((a8 == 15 && a4 <= 0) && a23 <= 138) && a25 == 10 && a29 <= 140)) || (((((a25 == 11 && a23 <= 312) && a8 == 15) && (0 < a23 + 43 || 140 < a29)) && 1 == a4) && a3 == 1)) || (a23 <= 599997 && 140 < a29 && (((a25 == 9 && a8 == 15) && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) || (((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && a8 == 15)) && a3 == 1)) || ((((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a23 <= 312) && a25 == 9) && a8 == 15)) || (((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a8 == 15) && a23 <= 138)) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a3 == 1)) || (a23 <= 599997 && (a8 == 15 && ((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && a3 == 1)) || ((a8 == 15 && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) && a23 <= 138)) || (((a25 == 9 && (a8 == 15 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && a23 <= 138) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && a3 == 1)) || ((((a25 == 9 && a8 == 15) && ((140 < a29 && a4 == 1) && !(a25 == 10)) && 245 < a29) || ((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && 260 <= a29)) && a3 == 1)) || ((((((15 == a8 && 1 == a4) && a23 <= 599997) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 <= (v_prenex_63 + 69157) % 299861 + 300138) && 0 <= v_prenex_63 + 69157)) && !(a25 == 11)) && 306 < a23) && a3 == 1)) || ((a25 == 13 && a23 <= 306) && (140 < a29 && a4 == 1) && !(a25 == 10))) || (((a25 == 13 && a29 <= 130) && 1 == a4) && a23 <= 262)) || ((a23 + 127600 <= 0 && a4 == 1) && a25 == 10)) || (((((a25 == 12 && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1) && (0 < a23 + 43 || 140 < a29))) || ((a8 == 15 && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10))) || ((a8 == 15 && a3 == 1) && (((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && 245 < a29)) || (((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 260 <= a29)) || ((((((a25 == 13 && a8 == 15) && a29 <= 245) && 1 == a4) && a3 == 1) || ((a8 == 15 && ((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && 245 < a29) && a3 == 1)) && 140 < a29)) || ((a25 == 12 && (((((a23 + 127600 <= 0 && a25 == 9) && a8 == 15) && a4 <= 0) && !(a25 == 13) && a29 <= 140) || ((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) && a3 == 1) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 + 299882 <= (v_prenex_63 + 69157) % 299861) && 0 <= v_prenex_63 + 69157))) || ((((1 == a3 && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((((a25 == 9 && a8 == 15) && a4 <= 0) && (\exists v_prenex_58 : int :: (140 < v_prenex_58 && v_prenex_58 % 299861 + 10250 <= a29) && 0 == v_prenex_58 % 299861)) && a3 == 1) && a23 + 43 <= 0) || (((a29 <= 274 && (a8 == 15 && a4 <= 0) && a25 == 12 && 140 < a29) || (a29 <= 277 && a8 == 15 && (a4 <= 0 && a23 + 127600 <= 0 && a25 == 12) && 245 < a29)) && a3 == 1)) && a29 <= 599998) && a23 <= 138) [2018-12-30 22:34:58,960 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a25 == 10) && a3 == 1) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a25 == 11) && a3 == 1)) || (a29 <= 599998 && ((((a25 == 13 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a3 == 1)) || (((a23 + 599908 <= 0 && (((((a23 + 127600 <= 0 && a25 == 9) && a8 == 15) && a4 <= 0) && !(a25 == 13) && a29 <= 140) || ((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) && a3 == 1) && 0 <= a23 + 599908) && a29 <= 245)) || (a25 == 9 && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) || (a3 == 1 && ((a8 == 15 && a4 <= 0) && a23 <= 138) && a25 == 10 && a29 <= 140)) || (((((a25 == 11 && a23 <= 312) && a8 == 15) && (0 < a23 + 43 || 140 < a29)) && 1 == a4) && a3 == 1)) || (a23 <= 599997 && 140 < a29 && (((a25 == 9 && a8 == 15) && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) || (((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && a8 == 15)) && a3 == 1)) || ((((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a23 <= 312) && a25 == 9) && a8 == 15)) || (((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a8 == 15) && a23 <= 138)) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a3 == 1)) || (a23 <= 599997 && (a8 == 15 && ((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && a3 == 1)) || ((a8 == 15 && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) && a23 <= 138)) || (((a25 == 9 && (a8 == 15 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && a23 <= 138) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && a3 == 1)) || ((((a25 == 9 && a8 == 15) && ((140 < a29 && a4 == 1) && !(a25 == 10)) && 245 < a29) || ((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && 260 <= a29)) && a3 == 1)) || ((((((15 == a8 && 1 == a4) && a23 <= 599997) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 <= (v_prenex_63 + 69157) % 299861 + 300138) && 0 <= v_prenex_63 + 69157)) && !(a25 == 11)) && 306 < a23) && a3 == 1)) || ((a25 == 13 && a23 <= 306) && (140 < a29 && a4 == 1) && !(a25 == 10))) || (((a25 == 13 && a29 <= 130) && 1 == a4) && a23 <= 262)) || ((a23 + 127600 <= 0 && a4 == 1) && a25 == 10)) || (((((a25 == 12 && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1) && (0 < a23 + 43 || 140 < a29))) || ((a8 == 15 && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10))) || ((a8 == 15 && a3 == 1) && (((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && 245 < a29)) || (((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 260 <= a29)) || ((((((a25 == 13 && a8 == 15) && a29 <= 245) && 1 == a4) && a3 == 1) || ((a8 == 15 && ((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && 245 < a29) && a3 == 1)) && 140 < a29)) || ((a25 == 12 && (((((a23 + 127600 <= 0 && a25 == 9) && a8 == 15) && a4 <= 0) && !(a25 == 13) && a29 <= 140) || ((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) && a3 == 1) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 + 299882 <= (v_prenex_63 + 69157) % 299861) && 0 <= v_prenex_63 + 69157))) || ((((1 == a3 && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((((a25 == 9 && a8 == 15) && a4 <= 0) && (\exists v_prenex_58 : int :: (140 < v_prenex_58 && v_prenex_58 % 299861 + 10250 <= a29) && 0 == v_prenex_58 % 299861)) && a3 == 1) && a23 + 43 <= 0) || (((a29 <= 274 && (a8 == 15 && a4 <= 0) && a25 == 12 && 140 < a29) || (a29 <= 277 && a8 == 15 && (a4 <= 0 && a23 + 127600 <= 0 && a25 == 12) && 245 < a29)) && a3 == 1)) && a29 <= 599998) && a23 <= 138) [2018-12-30 22:34:59,147 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 22:34:59,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 22:34:59,148 INFO L168 Benchmark]: Toolchain (without parser) took 191448.75 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-30 22:34:59,148 INFO L168 Benchmark]: CDTParser took 0.34 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. [2018-12-30 22:34:59,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 957.97 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 896.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2018-12-30 22:34:59,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 279.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 896.3 MB in the beginning and 1.1 GB in the end (delta: -217.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-12-30 22:34:59,149 INFO L168 Benchmark]: Boogie Preprocessor took 125.11 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-30 22:34:59,153 INFO L168 Benchmark]: RCFGBuilder took 4291.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.4 MB in the end (delta: 177.2 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. [2018-12-30 22:34:59,154 INFO L168 Benchmark]: TraceAbstraction took 185482.16 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 929.4 MB in the beginning and 1.1 GB in the end (delta: -205.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-30 22:34:59,154 INFO L168 Benchmark]: Witness Printer took 307.32 ms. Allocated memory is still 3.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2018-12-30 22:34:59,159 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.34 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 957.97 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 896.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 279.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 896.3 MB in the beginning and 1.1 GB in the end (delta: -217.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.11 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4291.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.4 MB in the end (delta: 177.2 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 185482.16 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 929.4 MB in the beginning and 1.1 GB in the end (delta: -205.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 307.32 ms. Allocated memory is still 3.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 138]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-12-30 22:34:59,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a25 == 10) && a3 == 1) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a25 == 11) && a3 == 1)) || (a29 <= 599998 && ((((a25 == 13 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a3 == 1)) || (((a23 + 599908 <= 0 && (((((a23 + 127600 <= 0 && a25 == 9) && a8 == 15) && a4 <= 0) && !(a25 == 13) && a29 <= 140) || ((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) && a3 == 1) && 0 <= a23 + 599908) && a29 <= 245)) || (a25 == 9 && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) || (a3 == 1 && ((a8 == 15 && a4 <= 0) && a23 <= 138) && a25 == 10 && a29 <= 140)) || (((((a25 == 11 && a23 <= 312) && a8 == 15) && (0 < a23 + 43 || 140 < a29)) && 1 == a4) && a3 == 1)) || (a23 <= 599997 && 140 < a29 && (((a25 == 9 && a8 == 15) && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) || (((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && a8 == 15)) && a3 == 1)) || ((((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a23 <= 312) && a25 == 9) && a8 == 15)) || (((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a8 == 15) && a23 <= 138)) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a3 == 1)) || (a23 <= 599997 && (a8 == 15 && ((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && a3 == 1)) || ((a8 == 15 && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) && a23 <= 138)) || (((a25 == 9 && (a8 == 15 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && a23 <= 138) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && a3 == 1)) || ((((a25 == 9 && a8 == 15) && ((140 < a29 && a4 == 1) && !(a25 == 10)) && 245 < a29) || ((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && 260 <= a29)) && a3 == 1)) || ((((((15 == a8 && 1 == a4) && a23 <= 599997) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 <= (v_prenex_63 + 69157) % 299861 + 300138) && 0 <= v_prenex_63 + 69157)) && !(a25 == 11)) && 306 < a23) && a3 == 1)) || ((a25 == 13 && a23 <= 306) && (140 < a29 && a4 == 1) && !(a25 == 10))) || (((a25 == 13 && a29 <= 130) && 1 == a4) && a23 <= 262)) || ((a23 + 127600 <= 0 && a4 == 1) && a25 == 10)) || (((((a25 == 12 && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1) && (0 < a23 + 43 || 140 < a29))) || ((a8 == 15 && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10))) || ((a8 == 15 && a3 == 1) && (((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && 245 < a29)) || (((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 260 <= a29)) || ((((((a25 == 13 && a8 == 15) && a29 <= 245) && 1 == a4) && a3 == 1) || ((a8 == 15 && ((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && 245 < a29) && a3 == 1)) && 140 < a29)) || ((a25 == 12 && (((((a23 + 127600 <= 0 && a25 == 9) && a8 == 15) && a4 <= 0) && !(a25 == 13) && a29 <= 140) || ((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) && a3 == 1) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 + 299882 <= (v_prenex_63 + 69157) % 299861) && 0 <= v_prenex_63 + 69157))) || ((((1 == a3 && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((((a25 == 9 && a8 == 15) && a4 <= 0) && (\exists v_prenex_58 : int :: (140 < v_prenex_58 && v_prenex_58 % 299861 + 10250 <= a29) && 0 == v_prenex_58 % 299861)) && a3 == 1) && a23 + 43 <= 0) || (((a29 <= 274 && (a8 == 15 && a4 <= 0) && a25 == 12 && 140 < a29) || (a29 <= 277 && a8 == 15 && (a4 <= 0 && a23 + 127600 <= 0 && a25 == 12) && 245 < a29)) && a3 == 1)) && a29 <= 599998) && a23 <= 138) - InvariantResult [Line: 22]: Loop Invariant [2018-12-30 22:34:59,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,283 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,283 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,284 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,284 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,284 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2018-12-30 22:34:59,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2018-12-30 22:34:59,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 22:34:59,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a25 == 10) && a3 == 1) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a25 == 11) && a3 == 1)) || (a29 <= 599998 && ((((a25 == 13 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && a3 == 1)) || (((a23 + 599908 <= 0 && (((((a23 + 127600 <= 0 && a25 == 9) && a8 == 15) && a4 <= 0) && !(a25 == 13) && a29 <= 140) || ((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) && a3 == 1) && 0 <= a23 + 599908) && a29 <= 245)) || (a25 == 9 && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) || (a3 == 1 && ((a8 == 15 && a4 <= 0) && a23 <= 138) && a25 == 10 && a29 <= 140)) || (((((a25 == 11 && a23 <= 312) && a8 == 15) && (0 < a23 + 43 || 140 < a29)) && 1 == a4) && a3 == 1)) || (a23 <= 599997 && 140 < a29 && (((a25 == 9 && a8 == 15) && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) || (((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && a8 == 15)) && a3 == 1)) || ((((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a23 <= 312) && a25 == 9) && a8 == 15)) || (((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a8 == 15) && a23 <= 138)) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a3 == 1)) || (a23 <= 599997 && (a8 == 15 && ((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && a3 == 1)) || ((a8 == 15 && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) && a23 <= 138)) || (((a25 == 9 && (a8 == 15 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && a23 <= 138) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && a3 == 1)) || ((((a25 == 9 && a8 == 15) && ((140 < a29 && a4 == 1) && !(a25 == 10)) && 245 < a29) || ((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && 260 <= a29)) && a3 == 1)) || ((((((15 == a8 && 1 == a4) && a23 <= 599997) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 <= (v_prenex_63 + 69157) % 299861 + 300138) && 0 <= v_prenex_63 + 69157)) && !(a25 == 11)) && 306 < a23) && a3 == 1)) || ((a25 == 13 && a23 <= 306) && (140 < a29 && a4 == 1) && !(a25 == 10))) || (((a25 == 13 && a29 <= 130) && 1 == a4) && a23 <= 262)) || ((a23 + 127600 <= 0 && a4 == 1) && a25 == 10)) || (((((a25 == 12 && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1) && (0 < a23 + 43 || 140 < a29))) || ((a8 == 15 && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10))) || ((a8 == 15 && a3 == 1) && (((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && 245 < a29)) || (((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 260 <= a29)) || ((((((a25 == 13 && a8 == 15) && a29 <= 245) && 1 == a4) && a3 == 1) || ((a8 == 15 && ((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && 245 < a29) && a3 == 1)) && 140 < a29)) || ((a25 == 12 && (((((a23 + 127600 <= 0 && a25 == 9) && a8 == 15) && a4 <= 0) && !(a25 == 13) && a29 <= 140) || ((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) && a3 == 1) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 + 299882 <= (v_prenex_63 + 69157) % 299861) && 0 <= v_prenex_63 + 69157))) || ((((1 == a3 && (\exists v_prenex_37 : int :: (((((v_prenex_37 + 43 <= 0 && v_prenex_37 + 599992 <= 0) && !((v_prenex_37 / 5 + 3) % 5 == 0)) && v_prenex_37 % 5 == 0) && v_prenex_37 / 5 < 54477) && a23 <= ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 + 119) && ((v_prenex_37 / 5 + -54477) / 5 + 1) % 90 == 0)) && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((((a25 == 9 && a8 == 15) && a4 <= 0) && (\exists v_prenex_58 : int :: (140 < v_prenex_58 && v_prenex_58 % 299861 + 10250 <= a29) && 0 == v_prenex_58 % 299861)) && a3 == 1) && a23 + 43 <= 0) || (((a29 <= 274 && (a8 == 15 && a4 <= 0) && a25 == 12 && 140 < a29) || (a29 <= 277 && a8 == 15 && (a4 <= 0 && a23 + 127600 <= 0 && a25 == 12) && 245 < a29)) && a3 == 1)) && a29 <= 599998) && a23 <= 138) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 185.2s OverallTime, 24 OverallIterations, 8 TraceHistogramMax, 99.6s AutomataDifference, 0.0s DeadEndRemovalTime, 32.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2911 SDtfs, 20482 SDslu, 1618 SDs, 0 SdLazy, 53586 SolverSat, 6370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5915 GetRequests, 5739 SyntacticMatches, 13 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 32.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12759occurred 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: 3.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 48793 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 240 NumberOfFragments, 3055 HoareAnnotationTreeSize, 3 FomulaSimplifications, 27155224 FormulaSimplificationTreeSizeReduction, 5.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 12000042 FormulaSimplificationTreeSizeReductionInter, 27.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 15516 NumberOfCodeBlocks, 15516 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 15481 ConstructedInterpolants, 1206 QuantifiedInterpolants, 47346527 SizeOfPredicates, 14 NumberOfNonLiveVariables, 7367 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 35 InterpolantComputations, 14 PerfectInterpolantSequences, 19732/24139 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...