./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem17_label51_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem17_label51_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 44e865cb3b03c69d875149f8f77e9f4453d97c0d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 05:04:25,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 05:04:25,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 05:04:25,534 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 05:04:25,534 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 05:04:25,535 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 05:04:25,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 05:04:25,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 05:04:25,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 05:04:25,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 05:04:25,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 05:04:25,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 05:04:25,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 05:04:25,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 05:04:25,553 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 05:04:25,554 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 05:04:25,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 05:04:25,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 05:04:25,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 05:04:25,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 05:04:25,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 05:04:25,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 05:04:25,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 05:04:25,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 05:04:25,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 05:04:25,568 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 05:04:25,569 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 05:04:25,570 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 05:04:25,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 05:04:25,572 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 05:04:25,572 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 05:04:25,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 05:04:25,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 05:04:25,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 05:04:25,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 05:04:25,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 05:04:25,576 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 05:04:25,591 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 05:04:25,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 05:04:25,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 05:04:25,593 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 05:04:25,593 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 05:04:25,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 05:04:25,594 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 05:04:25,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 05:04:25,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 05:04:25,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 05:04:25,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 05:04:25,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 05:04:25,595 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 05:04:25,595 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 05:04:25,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 05:04:25,596 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 05:04:25,596 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 05:04:25,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 05:04:25,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 05:04:25,596 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 05:04:25,598 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 05:04:25,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 05:04:25,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 05:04:25,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 05:04:25,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 05:04:25,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 05:04:25,599 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 05:04:25,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 05:04:25,600 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 -> 44e865cb3b03c69d875149f8f77e9f4453d97c0d [2019-01-12 05:04:25,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 05:04:25,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 05:04:25,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 05:04:25,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 05:04:25,654 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 05:04:25,655 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem17_label51_true-unreach-call.c [2019-01-12 05:04:25,715 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81261b0f/017de38273c54e4ea8e8746cd39f0d5f/FLAG773316571 [2019-01-12 05:04:26,441 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 05:04:26,443 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem17_label51_true-unreach-call.c [2019-01-12 05:04:26,473 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81261b0f/017de38273c54e4ea8e8746cd39f0d5f/FLAG773316571 [2019-01-12 05:04:26,570 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81261b0f/017de38273c54e4ea8e8746cd39f0d5f [2019-01-12 05:04:26,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 05:04:26,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 05:04:26,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 05:04:26,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 05:04:26,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 05:04:26,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:04:26" (1/1) ... [2019-01-12 05:04:26,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:26, skipping insertion in model container [2019-01-12 05:04:26,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:04:26" (1/1) ... [2019-01-12 05:04:26,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 05:04:26,718 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 05:04:27,823 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 05:04:27,832 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 05:04:28,287 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 05:04:28,315 INFO L195 MainTranslator]: Completed translation [2019-01-12 05:04:28,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28 WrapperNode [2019-01-12 05:04:28,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 05:04:28,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 05:04:28,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 05:04:28,318 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 05:04:28,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:28,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:28,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 05:04:28,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 05:04:28,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 05:04:28,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 05:04:28,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:28,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:28,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:28,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:28,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:28,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:29,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... [2019-01-12 05:04:29,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 05:04:29,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 05:04:29,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 05:04:29,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 05:04:29,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 05:04:29,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 05:04:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 05:04:36,861 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 05:04:36,862 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 05:04:36,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:04:36 BoogieIcfgContainer [2019-01-12 05:04:36,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 05:04:36,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 05:04:36,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 05:04:36,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 05:04:36,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:04:26" (1/3) ... [2019-01-12 05:04:36,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc55a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:04:36, skipping insertion in model container [2019-01-12 05:04:36,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:04:28" (2/3) ... [2019-01-12 05:04:36,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc55a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:04:36, skipping insertion in model container [2019-01-12 05:04:36,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:04:36" (3/3) ... [2019-01-12 05:04:36,873 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label51_true-unreach-call.c [2019-01-12 05:04:36,883 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 05:04:36,891 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 05:04:36,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 05:04:36,945 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 05:04:36,946 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 05:04:36,946 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 05:04:36,946 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 05:04:36,946 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 05:04:36,946 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 05:04:36,946 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 05:04:36,947 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 05:04:36,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 05:04:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-01-12 05:04:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 05:04:36,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:04:36,989 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] [2019-01-12 05:04:36,992 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:04:37,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:04:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-01-12 05:04:37,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:04:37,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:04:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:04:37,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:04:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:04:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:04:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:04:37,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:04:37,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:04:37,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 05:04:37,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 05:04:37,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:04:37,493 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-01-12 05:04:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:04:45,010 INFO L93 Difference]: Finished difference Result 2120 states and 3947 transitions. [2019-01-12 05:04:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 05:04:45,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-12 05:04:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:04:45,046 INFO L225 Difference]: With dead ends: 2120 [2019-01-12 05:04:45,046 INFO L226 Difference]: Without dead ends: 1448 [2019-01-12 05:04:45,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:04:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-01-12 05:04:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 970. [2019-01-12 05:04:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-01-12 05:04:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1691 transitions. [2019-01-12 05:04:45,162 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1691 transitions. Word has length 37 [2019-01-12 05:04:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:04:45,162 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1691 transitions. [2019-01-12 05:04:45,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 05:04:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1691 transitions. [2019-01-12 05:04:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 05:04:45,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:04:45,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:04:45,168 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:04:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:04:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash -295103566, now seen corresponding path program 1 times [2019-01-12 05:04:45,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:04:45,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:04:45,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:04:45,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:04:45,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:04:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:04:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:04:45,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:04:45,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:04:45,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 05:04:45,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 05:04:45,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:04:45,428 INFO L87 Difference]: Start difference. First operand 970 states and 1691 transitions. Second operand 4 states. [2019-01-12 05:04:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:04:50,155 INFO L93 Difference]: Finished difference Result 2798 states and 4913 transitions. [2019-01-12 05:04:50,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:04:50,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-01-12 05:04:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:04:50,167 INFO L225 Difference]: With dead ends: 2798 [2019-01-12 05:04:50,167 INFO L226 Difference]: Without dead ends: 1830 [2019-01-12 05:04:50,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:04:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-01-12 05:04:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1830. [2019-01-12 05:04:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1830 states. [2019-01-12 05:04:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2564 transitions. [2019-01-12 05:04:50,221 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2564 transitions. Word has length 104 [2019-01-12 05:04:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:04:50,221 INFO L480 AbstractCegarLoop]: Abstraction has 1830 states and 2564 transitions. [2019-01-12 05:04:50,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 05:04:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2564 transitions. [2019-01-12 05:04:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 05:04:50,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:04:50,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:04:50,227 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:04:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:04:50,228 INFO L82 PathProgramCache]: Analyzing trace with hash 834662076, now seen corresponding path program 1 times [2019-01-12 05:04:50,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:04:50,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:04:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:04:50,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:04:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:04:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:04:50,604 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 05:04:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:04:50,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:04:50,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:04:50,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:04:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:04:50,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:04:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:04:51,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:04:51,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-12 05:04:51,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 05:04:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 05:04:51,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:04:51,083 INFO L87 Difference]: Start difference. First operand 1830 states and 2564 transitions. Second operand 6 states. [2019-01-12 05:05:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:05:07,943 INFO L93 Difference]: Finished difference Result 7504 states and 10355 transitions. [2019-01-12 05:05:07,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 05:05:07,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-01-12 05:05:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:05:07,965 INFO L225 Difference]: With dead ends: 7504 [2019-01-12 05:05:07,965 INFO L226 Difference]: Without dead ends: 3954 [2019-01-12 05:05:07,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:05:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2019-01-12 05:05:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3952. [2019-01-12 05:05:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-01-12 05:05:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4864 transitions. [2019-01-12 05:05:08,038 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4864 transitions. Word has length 107 [2019-01-12 05:05:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:05:08,039 INFO L480 AbstractCegarLoop]: Abstraction has 3952 states and 4864 transitions. [2019-01-12 05:05:08,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 05:05:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4864 transitions. [2019-01-12 05:05:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-12 05:05:08,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:05:08,048 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:05:08,048 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:05:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:05:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1572491215, now seen corresponding path program 1 times [2019-01-12 05:05:08,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:05:08,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:05:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:08,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:05:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:05:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-12 05:05:08,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:05:08,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:05:08,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:05:08,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:05:08,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:05:08,287 INFO L87 Difference]: Start difference. First operand 3952 states and 4864 transitions. Second operand 3 states. [2019-01-12 05:05:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:05:12,368 INFO L93 Difference]: Finished difference Result 10029 states and 12719 transitions. [2019-01-12 05:05:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:05:12,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-01-12 05:05:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:05:12,397 INFO L225 Difference]: With dead ends: 10029 [2019-01-12 05:05:12,397 INFO L226 Difference]: Without dead ends: 6504 [2019-01-12 05:05:12,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:05:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6504 states. [2019-01-12 05:05:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6504 to 6504. [2019-01-12 05:05:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2019-01-12 05:05:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 7873 transitions. [2019-01-12 05:05:12,522 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 7873 transitions. Word has length 255 [2019-01-12 05:05:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:05:12,523 INFO L480 AbstractCegarLoop]: Abstraction has 6504 states and 7873 transitions. [2019-01-12 05:05:12,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:05:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 7873 transitions. [2019-01-12 05:05:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-01-12 05:05:12,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:05:12,534 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 05:05:12,535 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:05:12,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:05:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash -469916585, now seen corresponding path program 1 times [2019-01-12 05:05:12,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:05:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:05:12,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:12,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:05:12,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:05:12,990 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 05:05:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 349 proven. 82 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-01-12 05:05:13,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:05:13,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:05:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:05:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:05:13,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:05:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 349 proven. 82 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-01-12 05:05:13,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:05:13,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2019-01-12 05:05:13,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 05:05:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 05:05:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 05:05:13,642 INFO L87 Difference]: Start difference. First operand 6504 states and 7873 transitions. Second operand 7 states. [2019-01-12 05:05:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:05:28,918 INFO L93 Difference]: Finished difference Result 26217 states and 31712 transitions. [2019-01-12 05:05:28,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 05:05:28,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 359 [2019-01-12 05:05:28,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:05:28,978 INFO L225 Difference]: With dead ends: 26217 [2019-01-12 05:05:28,978 INFO L226 Difference]: Without dead ends: 18425 [2019-01-12 05:05:28,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 05:05:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18425 states. [2019-01-12 05:05:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18425 to 17559. [2019-01-12 05:05:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17559 states. [2019-01-12 05:05:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17559 states to 17559 states and 20205 transitions. [2019-01-12 05:05:29,493 INFO L78 Accepts]: Start accepts. Automaton has 17559 states and 20205 transitions. Word has length 359 [2019-01-12 05:05:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:05:29,493 INFO L480 AbstractCegarLoop]: Abstraction has 17559 states and 20205 transitions. [2019-01-12 05:05:29,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 05:05:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17559 states and 20205 transitions. [2019-01-12 05:05:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-01-12 05:05:29,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:05:29,513 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 05:05:29,514 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:05:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:05:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash 786720517, now seen corresponding path program 1 times [2019-01-12 05:05:29,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:05:29,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:05:29,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:29,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:05:29,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:05:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-01-12 05:05:29,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:05:29,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:05:29,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:05:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:05:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:05:29,894 INFO L87 Difference]: Start difference. First operand 17559 states and 20205 transitions. Second operand 3 states. [2019-01-12 05:05:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:05:36,696 INFO L93 Difference]: Finished difference Result 41498 states and 47639 transitions. [2019-01-12 05:05:36,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:05:36,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 465 [2019-01-12 05:05:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:05:36,741 INFO L225 Difference]: With dead ends: 41498 [2019-01-12 05:05:36,741 INFO L226 Difference]: Without dead ends: 23941 [2019-01-12 05:05:36,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:05:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23941 states. [2019-01-12 05:05:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23941 to 18397. [2019-01-12 05:05:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18397 states. [2019-01-12 05:05:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18397 states to 18397 states and 21066 transitions. [2019-01-12 05:05:37,085 INFO L78 Accepts]: Start accepts. Automaton has 18397 states and 21066 transitions. Word has length 465 [2019-01-12 05:05:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:05:37,088 INFO L480 AbstractCegarLoop]: Abstraction has 18397 states and 21066 transitions. [2019-01-12 05:05:37,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:05:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 18397 states and 21066 transitions. [2019-01-12 05:05:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2019-01-12 05:05:37,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:05:37,121 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:05:37,121 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:05:37,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:05:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1041286932, now seen corresponding path program 1 times [2019-01-12 05:05:37,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:05:37,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:05:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:05:37,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:05:37,907 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-01-12 05:05:38,141 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-12 05:05:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 413 proven. 82 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-12 05:05:38,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:05:38,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:05:38,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:05:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:05:38,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:05:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 413 proven. 82 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-12 05:05:39,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:05:39,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-01-12 05:05:39,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 05:05:39,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 05:05:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 05:05:39,329 INFO L87 Difference]: Start difference. First operand 18397 states and 21066 transitions. Second operand 9 states. [2019-01-12 05:05:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:05:57,611 INFO L93 Difference]: Finished difference Result 38589 states and 44019 transitions. [2019-01-12 05:05:57,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 05:05:57,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 588 [2019-01-12 05:05:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:05:57,646 INFO L225 Difference]: With dead ends: 38589 [2019-01-12 05:05:57,646 INFO L226 Difference]: Without dead ends: 20619 [2019-01-12 05:05:57,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-12 05:05:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20619 states. [2019-01-12 05:05:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20619 to 20522. [2019-01-12 05:05:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20522 states. [2019-01-12 05:05:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20522 states to 20522 states and 23257 transitions. [2019-01-12 05:05:57,984 INFO L78 Accepts]: Start accepts. Automaton has 20522 states and 23257 transitions. Word has length 588 [2019-01-12 05:05:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:05:57,985 INFO L480 AbstractCegarLoop]: Abstraction has 20522 states and 23257 transitions. [2019-01-12 05:05:57,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 05:05:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 20522 states and 23257 transitions. [2019-01-12 05:05:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-01-12 05:05:58,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:05:58,038 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:05:58,038 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:05:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:05:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash -42748607, now seen corresponding path program 1 times [2019-01-12 05:05:58,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:05:58,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:05:58,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:05:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:05:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:05:58,854 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-12 05:05:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 480 proven. 384 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 05:05:59,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:05:59,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:05:59,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:06:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:06:00,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:06:00,446 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 20 [2019-01-12 05:06:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-01-12 05:06:00,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:06:00,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 05:06:00,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 05:06:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 05:06:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 05:06:00,862 INFO L87 Difference]: Start difference. First operand 20522 states and 23257 transitions. Second operand 7 states. [2019-01-12 05:07:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:07:47,493 INFO L93 Difference]: Finished difference Result 68297 states and 77664 transitions. [2019-01-12 05:07:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 05:07:47,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 663 [2019-01-12 05:07:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:07:47,568 INFO L225 Difference]: With dead ends: 68297 [2019-01-12 05:07:47,568 INFO L226 Difference]: Without dead ends: 48199 [2019-01-12 05:07:47,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 666 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 05:07:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48199 states. [2019-01-12 05:07:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48199 to 38385. [2019-01-12 05:07:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38385 states. [2019-01-12 05:07:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38385 states to 38385 states and 42282 transitions. [2019-01-12 05:07:48,112 INFO L78 Accepts]: Start accepts. Automaton has 38385 states and 42282 transitions. Word has length 663 [2019-01-12 05:07:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:07:48,113 INFO L480 AbstractCegarLoop]: Abstraction has 38385 states and 42282 transitions. [2019-01-12 05:07:48,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 05:07:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 38385 states and 42282 transitions. [2019-01-12 05:07:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2019-01-12 05:07:48,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:07:48,175 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 05:07:48,175 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:07:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:07:48,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1276740963, now seen corresponding path program 1 times [2019-01-12 05:07:48,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:07:48,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:07:48,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:07:48,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:07:48,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:07:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:07:48,596 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2019-01-12 05:07:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-01-12 05:07:49,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:07:49,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:07:49,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:07:49,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:07:49,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:07:49,231 INFO L87 Difference]: Start difference. First operand 38385 states and 42282 transitions. Second operand 3 states. [2019-01-12 05:07:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:07:55,241 INFO L93 Difference]: Finished difference Result 93367 states and 102955 transitions. [2019-01-12 05:07:55,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:07:55,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 760 [2019-01-12 05:07:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:07:55,291 INFO L225 Difference]: With dead ends: 93367 [2019-01-12 05:07:55,292 INFO L226 Difference]: Without dead ends: 57109 [2019-01-12 05:07:55,319 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 [2019-01-12 05:07:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57109 states. [2019-01-12 05:07:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57109 to 50290. [2019-01-12 05:07:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50290 states. [2019-01-12 05:07:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50290 states to 50290 states and 55512 transitions. [2019-01-12 05:07:55,819 INFO L78 Accepts]: Start accepts. Automaton has 50290 states and 55512 transitions. Word has length 760 [2019-01-12 05:07:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:07:55,820 INFO L480 AbstractCegarLoop]: Abstraction has 50290 states and 55512 transitions. [2019-01-12 05:07:55,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:07:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 50290 states and 55512 transitions. [2019-01-12 05:07:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-01-12 05:07:55,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:07:55,858 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:07:55,858 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:07:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:07:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash 46464743, now seen corresponding path program 1 times [2019-01-12 05:07:55,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:07:55,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:07:55,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:07:55,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:07:55,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:07:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:07:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-01-12 05:07:57,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:07:57,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 05:07:57,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 05:07:57,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 05:07:57,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 05:07:57,321 INFO L87 Difference]: Start difference. First operand 50290 states and 55512 transitions. Second operand 5 states. [2019-01-12 05:08:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:08:05,214 INFO L93 Difference]: Finished difference Result 109095 states and 121064 transitions. [2019-01-12 05:08:05,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 05:08:05,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 803 [2019-01-12 05:08:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:08:05,294 INFO L225 Difference]: With dead ends: 109095 [2019-01-12 05:08:05,294 INFO L226 Difference]: Without dead ends: 65192 [2019-01-12 05:08:05,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 05:08:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65192 states. [2019-01-12 05:08:06,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65192 to 54982. [2019-01-12 05:08:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54982 states. [2019-01-12 05:08:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54982 states to 54982 states and 60630 transitions. [2019-01-12 05:08:06,495 INFO L78 Accepts]: Start accepts. Automaton has 54982 states and 60630 transitions. Word has length 803 [2019-01-12 05:08:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:08:06,496 INFO L480 AbstractCegarLoop]: Abstraction has 54982 states and 60630 transitions. [2019-01-12 05:08:06,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 05:08:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 54982 states and 60630 transitions. [2019-01-12 05:08:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-01-12 05:08:06,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:08:06,536 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:08:06,537 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:08:06,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:08:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 131916225, now seen corresponding path program 1 times [2019-01-12 05:08:06,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:08:06,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:08:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:08:06,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:08:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:08:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:08:07,261 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-01-12 05:08:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 507 proven. 35 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2019-01-12 05:08:08,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:08:08,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:08:08,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:08:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:08:08,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:08:09,113 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 16 [2019-01-12 05:08:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2019-01-12 05:08:10,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:08:10,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-01-12 05:08:10,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 05:08:10,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 05:08:10,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 05:08:10,139 INFO L87 Difference]: Start difference. First operand 54982 states and 60630 transitions. Second operand 7 states. [2019-01-12 05:08:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:08:40,481 INFO L93 Difference]: Finished difference Result 136356 states and 150057 transitions. [2019-01-12 05:08:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 05:08:40,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 808 [2019-01-12 05:08:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:08:40,553 INFO L225 Difference]: With dead ends: 136356 [2019-01-12 05:08:40,554 INFO L226 Difference]: Without dead ends: 81376 [2019-01-12 05:08:40,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-12 05:08:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81376 states. [2019-01-12 05:08:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81376 to 54548. [2019-01-12 05:08:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54548 states. [2019-01-12 05:08:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54548 states to 54548 states and 58980 transitions. [2019-01-12 05:08:41,203 INFO L78 Accepts]: Start accepts. Automaton has 54548 states and 58980 transitions. Word has length 808 [2019-01-12 05:08:41,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:08:41,204 INFO L480 AbstractCegarLoop]: Abstraction has 54548 states and 58980 transitions. [2019-01-12 05:08:41,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 05:08:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 54548 states and 58980 transitions. [2019-01-12 05:08:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2019-01-12 05:08:41,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:08:41,240 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:08:41,240 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:08:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:08:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash -540579174, now seen corresponding path program 1 times [2019-01-12 05:08:41,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:08:41,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:08:41,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:08:41,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:08:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:08:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:08:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 931 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-12 05:08:41,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:08:41,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 05:08:41,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:08:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:08:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:08:41,894 INFO L87 Difference]: Start difference. First operand 54548 states and 58980 transitions. Second operand 3 states. [2019-01-12 05:08:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:08:43,474 INFO L93 Difference]: Finished difference Result 103125 states and 111534 transitions. [2019-01-12 05:08:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:08:43,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 950 [2019-01-12 05:08:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:08:43,528 INFO L225 Difference]: With dead ends: 103125 [2019-01-12 05:08:43,528 INFO L226 Difference]: Without dead ends: 52832 [2019-01-12 05:08:43,555 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 [2019-01-12 05:08:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52832 states. [2019-01-12 05:08:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52832 to 51979. [2019-01-12 05:08:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51979 states. [2019-01-12 05:08:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51979 states to 51979 states and 56067 transitions. [2019-01-12 05:08:44,622 INFO L78 Accepts]: Start accepts. Automaton has 51979 states and 56067 transitions. Word has length 950 [2019-01-12 05:08:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:08:44,623 INFO L480 AbstractCegarLoop]: Abstraction has 51979 states and 56067 transitions. [2019-01-12 05:08:44,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:08:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 51979 states and 56067 transitions. [2019-01-12 05:08:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2019-01-12 05:08:44,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:08:44,664 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:08:44,664 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:08:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:08:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash 614190168, now seen corresponding path program 1 times [2019-01-12 05:08:44,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:08:44,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:08:44,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:08:44,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:08:44,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:08:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:08:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 1164 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-01-12 05:08:45,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:08:45,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 05:08:45,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 05:08:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 05:08:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 05:08:45,848 INFO L87 Difference]: Start difference. First operand 51979 states and 56067 transitions. Second operand 5 states. [2019-01-12 05:08:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:08:53,651 INFO L93 Difference]: Finished difference Result 109064 states and 117638 transitions. [2019-01-12 05:08:53,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 05:08:53,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 950 [2019-01-12 05:08:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:08:53,709 INFO L225 Difference]: With dead ends: 109064 [2019-01-12 05:08:53,709 INFO L226 Difference]: Without dead ends: 62618 [2019-01-12 05:08:53,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:08:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62618 states. [2019-01-12 05:08:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62618 to 57081. [2019-01-12 05:08:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57081 states. [2019-01-12 05:08:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57081 states to 57081 states and 61273 transitions. [2019-01-12 05:08:54,261 INFO L78 Accepts]: Start accepts. Automaton has 57081 states and 61273 transitions. Word has length 950 [2019-01-12 05:08:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:08:54,262 INFO L480 AbstractCegarLoop]: Abstraction has 57081 states and 61273 transitions. [2019-01-12 05:08:54,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 05:08:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 57081 states and 61273 transitions. [2019-01-12 05:08:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1105 [2019-01-12 05:08:54,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:08:54,295 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:08:54,295 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:08:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:08:54,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1266275249, now seen corresponding path program 1 times [2019-01-12 05:08:54,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:08:54,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:08:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:08:54,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:08:54,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:08:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:08:55,084 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-12 05:08:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 1507 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-01-12 05:08:55,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:08:55,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 05:08:55,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 05:08:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 05:08:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:08:55,677 INFO L87 Difference]: Start difference. First operand 57081 states and 61273 transitions. Second operand 6 states. [2019-01-12 05:09:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:09:02,175 INFO L93 Difference]: Finished difference Result 125654 states and 135486 transitions. [2019-01-12 05:09:02,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 05:09:02,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1104 [2019-01-12 05:09:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:09:02,241 INFO L225 Difference]: With dead ends: 125654 [2019-01-12 05:09:02,241 INFO L226 Difference]: Without dead ends: 73681 [2019-01-12 05:09:02,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:09:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73681 states. [2019-01-12 05:09:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73681 to 53250. [2019-01-12 05:09:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53250 states. [2019-01-12 05:09:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53250 states to 53250 states and 56904 transitions. [2019-01-12 05:09:02,829 INFO L78 Accepts]: Start accepts. Automaton has 53250 states and 56904 transitions. Word has length 1104 [2019-01-12 05:09:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:09:02,830 INFO L480 AbstractCegarLoop]: Abstraction has 53250 states and 56904 transitions. [2019-01-12 05:09:02,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 05:09:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53250 states and 56904 transitions. [2019-01-12 05:09:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1245 [2019-01-12 05:09:02,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:09:02,865 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:09:02,865 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:09:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:09:02,865 INFO L82 PathProgramCache]: Analyzing trace with hash 796980562, now seen corresponding path program 1 times [2019-01-12 05:09:02,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:09:02,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:09:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:09:02,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:09:02,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:09:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:09:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 1748 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-01-12 05:09:04,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:09:04,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:09:04,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:09:04,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:09:04,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:09:04,606 INFO L87 Difference]: Start difference. First operand 53250 states and 56904 transitions. Second operand 3 states. [2019-01-12 05:09:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:09:06,846 INFO L93 Difference]: Finished difference Result 100540 states and 107541 transitions. [2019-01-12 05:09:06,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:09:06,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1244 [2019-01-12 05:09:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:09:06,936 INFO L225 Difference]: With dead ends: 100540 [2019-01-12 05:09:06,936 INFO L226 Difference]: Without dead ends: 54098 [2019-01-12 05:09:06,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:09:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54098 states. [2019-01-12 05:09:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54098 to 52398. [2019-01-12 05:09:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52398 states. [2019-01-12 05:09:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52398 states to 52398 states and 55757 transitions. [2019-01-12 05:09:07,569 INFO L78 Accepts]: Start accepts. Automaton has 52398 states and 55757 transitions. Word has length 1244 [2019-01-12 05:09:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:09:07,570 INFO L480 AbstractCegarLoop]: Abstraction has 52398 states and 55757 transitions. [2019-01-12 05:09:07,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:09:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 52398 states and 55757 transitions. [2019-01-12 05:09:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1291 [2019-01-12 05:09:07,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:09:07,609 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:09:07,610 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:09:07,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:09:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1099487151, now seen corresponding path program 1 times [2019-01-12 05:09:07,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:09:07,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:09:07,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:09:07,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:09:07,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:09:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:09:08,703 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 05:09:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 1333 proven. 343 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-01-12 05:09:11,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:09:11,380 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 [2019-01-12 05:09:11,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:09:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:09:11,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:09:12,749 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_17 Int)) (let ((.cse0 (mod v_prenex_17 299909))) (and (= .cse0 0) (<= .cse0 (+ c_~a14~0 300091)) (<= (+ v_prenex_17 182) 0)))) (exists ((v_prenex_16 Int)) (and (<= (+ v_prenex_16 182) 0) (<= 0 v_prenex_16) (<= (mod v_prenex_16 299909) (+ c_~a14~0 300091)))) (exists ((v_~a14~0_1227 Int)) (let ((.cse1 (mod v_~a14~0_1227 299909))) (and (not (= .cse1 0)) (<= .cse1 (+ c_~a14~0 600000)) (< v_~a14~0_1227 0) (<= (+ v_~a14~0_1227 182) 0))))) is different from true [2019-01-12 05:09:13,337 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-01-12 05:09:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 981 proven. 105 refuted. 0 times theorem prover too weak. 527 trivial. 497 not checked. [2019-01-12 05:09:17,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:09:17,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-01-12 05:09:17,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 05:09:17,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 05:09:17,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2019-01-12 05:09:17,454 INFO L87 Difference]: Start difference. First operand 52398 states and 55757 transitions. Second operand 9 states. [2019-01-12 05:09:36,710 WARN L181 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-01-12 05:09:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:09:56,900 INFO L93 Difference]: Finished difference Result 118606 states and 126208 transitions. [2019-01-12 05:09:56,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 05:09:56,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1290 [2019-01-12 05:09:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:09:56,989 INFO L225 Difference]: With dead ends: 118606 [2019-01-12 05:09:56,989 INFO L226 Difference]: Without dead ends: 67057 [2019-01-12 05:09:57,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1306 GetRequests, 1293 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=45, Invalid=138, Unknown=3, NotChecked=24, Total=210 [2019-01-12 05:09:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67057 states. [2019-01-12 05:09:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67057 to 57943. [2019-01-12 05:09:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57943 states. [2019-01-12 05:09:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57943 states to 57943 states and 60953 transitions. [2019-01-12 05:09:57,662 INFO L78 Accepts]: Start accepts. Automaton has 57943 states and 60953 transitions. Word has length 1290 [2019-01-12 05:09:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:09:57,663 INFO L480 AbstractCegarLoop]: Abstraction has 57943 states and 60953 transitions. [2019-01-12 05:09:57,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 05:09:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 57943 states and 60953 transitions. [2019-01-12 05:09:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1424 [2019-01-12 05:09:57,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:09:57,710 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 05:09:57,710 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:09:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:09:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash -655251552, now seen corresponding path program 1 times [2019-01-12 05:09:57,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:09:57,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:09:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:09:57,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:09:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:09:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:09:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3902 backedges. 2228 proven. 348 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-12 05:09:59,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:09:59,779 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 [2019-01-12 05:09:59,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:10:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:10:00,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:10:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3902 backedges. 1265 proven. 0 refuted. 0 times theorem prover too weak. 2637 trivial. 0 not checked. [2019-01-12 05:10:01,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:10:01,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-01-12 05:10:01,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 05:10:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 05:10:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 05:10:01,839 INFO L87 Difference]: Start difference. First operand 57943 states and 60953 transitions. Second operand 7 states. [2019-01-12 05:10:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:10:18,116 INFO L93 Difference]: Finished difference Result 151095 states and 159517 transitions. [2019-01-12 05:10:18,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 05:10:18,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1423 [2019-01-12 05:10:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:10:18,214 INFO L225 Difference]: With dead ends: 151095 [2019-01-12 05:10:18,214 INFO L226 Difference]: Without dead ends: 94004 [2019-01-12 05:10:18,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1440 GetRequests, 1429 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-12 05:10:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94004 states. [2019-01-12 05:10:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94004 to 82882. [2019-01-12 05:10:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82882 states. [2019-01-12 05:10:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82882 states to 82882 states and 86781 transitions. [2019-01-12 05:10:19,184 INFO L78 Accepts]: Start accepts. Automaton has 82882 states and 86781 transitions. Word has length 1423 [2019-01-12 05:10:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:10:19,186 INFO L480 AbstractCegarLoop]: Abstraction has 82882 states and 86781 transitions. [2019-01-12 05:10:19,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 05:10:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 82882 states and 86781 transitions. [2019-01-12 05:10:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2019-01-12 05:10:19,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:10:19,251 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:10:19,251 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:10:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:10:19,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2593517, now seen corresponding path program 1 times [2019-01-12 05:10:19,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:10:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:10:19,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:10:19,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:10:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:10:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:10:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3318 backedges. 2298 proven. 508 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-01-12 05:10:21,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:10:21,681 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 [2019-01-12 05:10:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:10:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:10:22,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:10:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3318 backedges. 2360 proven. 446 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-01-12 05:10:23,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:10:23,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2019-01-12 05:10:23,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 05:10:23,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 05:10:23,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:10:23,717 INFO L87 Difference]: Start difference. First operand 82882 states and 86781 transitions. Second operand 8 states. [2019-01-12 05:10:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:10:31,638 INFO L93 Difference]: Finished difference Result 214247 states and 224342 transitions. [2019-01-12 05:10:31,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 05:10:31,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1431 [2019-01-12 05:10:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:10:31,759 INFO L225 Difference]: With dead ends: 214247 [2019-01-12 05:10:31,760 INFO L226 Difference]: Without dead ends: 132217 [2019-01-12 05:10:31,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1438 GetRequests, 1430 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:10:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132217 states. [2019-01-12 05:10:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132217 to 103849. [2019-01-12 05:10:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103849 states. [2019-01-12 05:10:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103849 states to 103849 states and 108753 transitions. [2019-01-12 05:10:32,911 INFO L78 Accepts]: Start accepts. Automaton has 103849 states and 108753 transitions. Word has length 1431 [2019-01-12 05:10:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:10:32,912 INFO L480 AbstractCegarLoop]: Abstraction has 103849 states and 108753 transitions. [2019-01-12 05:10:32,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 05:10:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 103849 states and 108753 transitions. [2019-01-12 05:10:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1522 [2019-01-12 05:10:32,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:10:32,981 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:10:32,981 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:10:32,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:10:32,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1684361728, now seen corresponding path program 1 times [2019-01-12 05:10:32,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:10:32,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:10:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:10:32,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:10:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:10:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:10:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 2287 proven. 0 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2019-01-12 05:10:34,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:10:34,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 05:10:34,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 05:10:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 05:10:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 05:10:34,970 INFO L87 Difference]: Start difference. First operand 103849 states and 108753 transitions. Second operand 5 states. [2019-01-12 05:10:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:10:41,385 INFO L93 Difference]: Finished difference Result 228316 states and 239393 transitions. [2019-01-12 05:10:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 05:10:41,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1521 [2019-01-12 05:10:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:10:41,500 INFO L225 Difference]: With dead ends: 228316 [2019-01-12 05:10:41,500 INFO L226 Difference]: Without dead ends: 125319 [2019-01-12 05:10:41,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 05:10:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125319 states. [2019-01-12 05:10:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125319 to 95659. [2019-01-12 05:10:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95659 states. [2019-01-12 05:10:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95659 states to 95659 states and 100065 transitions. [2019-01-12 05:10:42,573 INFO L78 Accepts]: Start accepts. Automaton has 95659 states and 100065 transitions. Word has length 1521 [2019-01-12 05:10:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:10:42,574 INFO L480 AbstractCegarLoop]: Abstraction has 95659 states and 100065 transitions. [2019-01-12 05:10:42,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 05:10:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 95659 states and 100065 transitions. [2019-01-12 05:10:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1702 [2019-01-12 05:10:42,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:10:42,645 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:10:42,645 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:10:42,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:10:42,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2143063942, now seen corresponding path program 1 times [2019-01-12 05:10:42,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:10:42,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:10:42,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:10:42,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:10:42,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:10:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:10:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4770 backedges. 2695 proven. 1563 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-01-12 05:10:46,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:10:46,383 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 [2019-01-12 05:10:46,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:10:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:10:46,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:10:47,517 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 534 DAG size of output: 25 [2019-01-12 05:10:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4770 backedges. 2305 proven. 350 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2019-01-12 05:10:53,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:10:53,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-01-12 05:10:53,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 05:10:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 05:10:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-12 05:10:53,580 INFO L87 Difference]: Start difference. First operand 95659 states and 100065 transitions. Second operand 14 states. [2019-01-12 05:11:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:11:25,402 INFO L93 Difference]: Finished difference Result 268215 states and 280311 transitions. [2019-01-12 05:11:25,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 05:11:25,403 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1701 [2019-01-12 05:11:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:11:25,616 INFO L225 Difference]: With dead ends: 268215 [2019-01-12 05:11:25,617 INFO L226 Difference]: Without dead ends: 173408 [2019-01-12 05:11:25,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1731 GetRequests, 1708 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2019-01-12 05:11:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173408 states. [2019-01-12 05:11:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173408 to 113974. [2019-01-12 05:11:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113974 states. [2019-01-12 05:11:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113974 states to 113974 states and 119097 transitions. [2019-01-12 05:11:27,275 INFO L78 Accepts]: Start accepts. Automaton has 113974 states and 119097 transitions. Word has length 1701 [2019-01-12 05:11:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:11:27,276 INFO L480 AbstractCegarLoop]: Abstraction has 113974 states and 119097 transitions. [2019-01-12 05:11:27,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 05:11:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 113974 states and 119097 transitions. [2019-01-12 05:11:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1829 [2019-01-12 05:11:27,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:11:27,364 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:11:27,365 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:11:27,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:11:27,365 INFO L82 PathProgramCache]: Analyzing trace with hash -308261852, now seen corresponding path program 1 times [2019-01-12 05:11:27,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:11:27,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:11:27,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:11:27,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:11:27,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:11:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:11:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 3462 proven. 31 refuted. 0 times theorem prover too weak. 1733 trivial. 0 not checked. [2019-01-12 05:11:30,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:11:30,070 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 [2019-01-12 05:11:30,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:11:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:11:30,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:11:31,025 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 28 [2019-01-12 05:11:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 2881 proven. 0 refuted. 0 times theorem prover too weak. 2345 trivial. 0 not checked. [2019-01-12 05:11:36,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:11:36,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-01-12 05:11:36,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 05:11:36,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 05:11:36,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 05:11:36,830 INFO L87 Difference]: Start difference. First operand 113974 states and 119097 transitions. Second operand 7 states. [2019-01-12 05:11:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:11:44,142 INFO L93 Difference]: Finished difference Result 240971 states and 251498 transitions. [2019-01-12 05:11:44,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 05:11:44,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1828 [2019-01-12 05:11:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:11:44,145 INFO L225 Difference]: With dead ends: 240971 [2019-01-12 05:11:44,145 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 05:11:44,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1835 GetRequests, 1829 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:11:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 05:11:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 05:11:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 05:11:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 05:11:44,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1828 [2019-01-12 05:11:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:11:44,212 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 05:11:44,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 05:11:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 05:11:44,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 05:11:44,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 05:11:44,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:44,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:45,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:46,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:47,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:48,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:49,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,617 WARN L181 SmtUtils]: Spent 6.39 s on a formula simplification. DAG size of input: 1800 DAG size of output: 1297 [2019-01-12 05:11:50,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:50,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:51,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:52,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:52,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:52,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:52,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:52,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:52,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:52,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:52,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:53,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:53,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:53,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:53,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:53,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:53,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,681 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 1708 DAG size of output: 1223 [2019-01-12 05:11:54,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:54,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:55,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:56,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:57,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:58,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:58,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:58,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:58,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:58,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:58,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:58,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:58,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:59,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:11:59,145 WARN L181 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 1800 DAG size of output: 1297 [2019-01-12 05:12:16,181 WARN L181 SmtUtils]: Spent 17.02 s on a formula simplification. DAG size of input: 1214 DAG size of output: 171 [2019-01-12 05:12:35,267 WARN L181 SmtUtils]: Spent 19.08 s on a formula simplification. DAG size of input: 1144 DAG size of output: 173 [2019-01-12 05:12:51,311 WARN L181 SmtUtils]: Spent 16.03 s on a formula simplification. DAG size of input: 1214 DAG size of output: 171 [2019-01-12 05:12:51,314 INFO L448 ceAbstractionStarter]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-01-12 05:12:51,314 INFO L448 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-01-12 05:12:51,314 INFO L448 ceAbstractionStarter]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-01-12 05:12:51,314 INFO L448 ceAbstractionStarter]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,315 INFO L448 ceAbstractionStarter]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-01-12 05:12:51,316 INFO L448 ceAbstractionStarter]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,317 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,318 INFO L448 ceAbstractionStarter]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,319 INFO L448 ceAbstractionStarter]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,320 INFO L448 ceAbstractionStarter]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-01-12 05:12:51,321 INFO L448 ceAbstractionStarter]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,322 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-01-12 05:12:51,323 INFO L448 ceAbstractionStarter]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,324 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,325 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,326 INFO L448 ceAbstractionStarter]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-01-12 05:12:51,327 INFO L448 ceAbstractionStarter]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-01-12 05:12:51,328 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-01-12 05:12:51,329 INFO L448 ceAbstractionStarter]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,330 INFO L448 ceAbstractionStarter]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,331 INFO L448 ceAbstractionStarter]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,332 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,333 INFO L448 ceAbstractionStarter]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,334 INFO L448 ceAbstractionStarter]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-01-12 05:12:51,335 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,336 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,337 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,338 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-01-12 05:12:51,339 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,340 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,341 INFO L448 ceAbstractionStarter]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,342 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,343 INFO L448 ceAbstractionStarter]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-01-12 05:12:51,344 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 05:12:51,345 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,346 INFO L448 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-01-12 05:12:51,346 INFO L448 ceAbstractionStarter]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,346 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,346 INFO L448 ceAbstractionStarter]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,346 INFO L448 ceAbstractionStarter]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,346 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-01-12 05:12:51,346 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-01-12 05:12:51,347 INFO L444 ceAbstractionStarter]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse27 (+ ~a14~0 182))) (let ((.cse13 (< 217 ~a26~0)) (.cse21 (exists ((v_~a14~0_1227 Int)) (let ((.cse33 (mod v_~a14~0_1227 299909))) (and (not (= .cse33 0)) (< v_~a14~0_1227 0) (<= .cse33 (+ ~a14~0 9)) (<= (+ v_~a14~0_1227 182) 0))))) (.cse7 (exists ((v_prenex_57 Int)) (let ((.cse31 (* 9 v_prenex_57))) (let ((.cse32 (div .cse31 10))) (let ((.cse30 (mod (+ .cse32 31) 48))) (and (not (= 0 .cse30)) (< .cse31 0) (< .cse32 11297) (<= (+ .cse30 74) ~a28~0) (not (= 0 (mod .cse31 10))))))))) (.cse10 (<= .cse27 0)) (.cse18 (<= ~a26~0 559736)) (.cse25 (<= 303 ~a28~0)) (.cse2 (= ~a24~0 1)) (.cse15 (< 37 ~a28~0)) (.cse20 (<= 137 ~a26~0)) (.cse3 (<= (+ ~a14~0 300092) 0)) (.cse16 (<= ~a26~0 217)) (.cse5 (<= ~a26~0 599998)) (.cse11 (exists ((v_prenex_15 Int)) (let ((.cse29 (mod v_prenex_15 14))) (and (not (= .cse29 0)) (< v_prenex_15 0) (<= (+ v_prenex_15 182) 0) (<= .cse29 (+ ~a14~0 112)))))) (.cse8 (<= ~a28~0 300)) (.cse19 (exists ((v_prenex_21 Int)) (let ((.cse28 (mod (+ v_prenex_21 6) 82))) (and (<= (+ .cse28 137) ~a28~0) (not (= 0 .cse28)) (< v_prenex_21 89948))))) (.cse26 (< 0 (+ ~a14~0 114))) (.cse4 (<= ~a26~0 124)) (.cse6 (<= 0 (+ ~a14~0 600000))) (.cse23 (< 300 ~a28~0)) (.cse24 (<= (+ ~a26~0 40337) 0)) (.cse14 (<= ~a26~0 599553)) (.cse17 (< 0 .cse27)) (.cse9 (= 2 ~a24~0)) (.cse12 (<= (+ ~a14~0 84) 0)) (.cse1 (<= ~a21~0 124))) (or (let ((.cse0 (+ ~a14~0 79))) (and (<= .cse0 0) (<= 222 ~a26~0) .cse1 (<= ~a26~0 222) .cse2 (<= ~a28~0 111) (<= 0 .cse0) (<= 111 ~a28~0))) (and (<= (+ ~a28~0 588903) 0) .cse3 .cse4 .cse1) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse1) (and .cse11 (and .cse2 .cse12)) (and .cse2 .cse10) (and .cse13 .cse8 .cse9 .cse14 .cse1 .cse12) (and (and .cse15 .cse16 .cse9) .cse1) (and (and .cse17 (< 124 ~a26~0)) .cse16 .cse12 .cse1) (and .cse6 .cse18 .cse12 .cse1 .cse8 .cse19 .cse20) (and .cse5 .cse21 .cse13 .cse9 .cse1) (and (let ((.cse22 (and .cse2 .cse18 .cse1))) (or (and .cse21 .cse22) (and .cse23 .cse22))) .cse7) (and .cse9 .cse24 .cse1) (and (and .cse15 .cse17 .cse16) .cse1 .cse12) (and .cse6 .cse25 .cse9 .cse1 .cse14 .cse10) (and .cse25 .cse9 .cse18 .cse1) (and .cse25 .cse4 .cse1) (and .cse9 .cse6 .cse16 .cse12 .cse1) (and .cse2 .cse16) (and .cse5 .cse8 .cse15 .cse26 .cse9 .cse1) (and .cse2 .cse15 .cse12) (and .cse6 (or (and .cse8 .cse15 .cse20 .cse1) (and .cse3 .cse8 .cse1)) (<= 125 ~a26~0) .cse16 .cse12) (and .cse5 (and .cse11 .cse9) .cse12 .cse1) (and .cse6 .cse8 .cse19 .cse4 .cse1) (and .cse26 .cse4 .cse1) (and (<= (+ ~a26~0 75) 0) (and .cse23 .cse1) .cse6) (and .cse23 .cse24 .cse1) (and .cse14 (and .cse17 .cse9) .cse12 .cse1)))) [2019-01-12 05:12:51,347 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 05:12:51,347 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,347 INFO L448 ceAbstractionStarter]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,347 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,347 INFO L448 ceAbstractionStarter]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,347 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,347 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,347 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-01-12 05:12:51,348 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2019-01-12 05:12:51,348 INFO L448 ceAbstractionStarter]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,348 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,348 INFO L444 ceAbstractionStarter]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse27 (+ ~a14~0 182))) (let ((.cse5 (<= (+ ~a14~0 300092) 0)) (.cse9 (<= 137 ~a26~0)) (.cse16 (< 217 ~a26~0)) (.cse20 (exists ((v_~a14~0_1227 Int)) (let ((.cse33 (mod v_~a14~0_1227 299909))) (and (not (= .cse33 0)) (< v_~a14~0_1227 0) (<= .cse33 (+ ~a14~0 9)) (<= (+ v_~a14~0_1227 182) 0))))) (.cse13 (exists ((v_prenex_57 Int)) (let ((.cse31 (* 9 v_prenex_57))) (let ((.cse32 (div .cse31 10))) (let ((.cse30 (mod (+ .cse32 31) 48))) (and (not (= 0 .cse30)) (< .cse31 0) (< .cse32 11297) (<= (+ .cse30 74) ~a28~0) (not (= 0 (mod .cse31 10))))))))) (.cse15 (<= .cse27 0)) (.cse0 (<= 303 ~a28~0)) (.cse18 (<= ~a26~0 559736)) (.cse22 (< 300 ~a28~0)) (.cse4 (= ~a24~0 1)) (.cse12 (<= ~a26~0 599998)) (.cse24 (exists ((v_prenex_15 Int)) (let ((.cse29 (mod v_prenex_15 14))) (and (not (= .cse29 0)) (< v_prenex_15 0) (<= (+ v_prenex_15 182) 0) (<= .cse29 (+ ~a14~0 112)))))) (.cse6 (<= 0 (+ ~a14~0 600000))) (.cse7 (<= ~a28~0 300)) (.cse19 (exists ((v_prenex_21 Int)) (let ((.cse28 (mod (+ v_prenex_21 6) 82))) (and (<= (+ .cse28 137) ~a28~0) (not (= 0 .cse28)) (< v_prenex_21 89948))))) (.cse8 (< 37 ~a28~0)) (.cse10 (<= ~a26~0 217)) (.cse26 (< 0 (+ ~a14~0 114))) (.cse1 (<= ~a26~0 124)) (.cse23 (<= (+ ~a26~0 40337) 0)) (.cse17 (<= ~a26~0 599553)) (.cse25 (< 0 .cse27)) (.cse14 (= 2 ~a24~0)) (.cse11 (<= (+ ~a14~0 84) 0)) (.cse2 (<= ~a21~0 124))) (or (and .cse0 .cse1 .cse2) (let ((.cse3 (+ ~a14~0 79))) (and (<= .cse3 0) (<= 222 ~a26~0) .cse2 (<= ~a26~0 222) .cse4 (<= ~a28~0 111) (<= 0 .cse3) (<= 111 ~a28~0))) (and (<= (+ ~a28~0 588903) 0) .cse5 .cse1 .cse2) (and .cse6 (or (and .cse7 .cse8 .cse9 .cse2) (and (and (< 124 ~a26~0) .cse5) .cse7 .cse2)) .cse10 .cse11) (and .cse12 .cse6 .cse13 .cse7 .cse14 .cse15 .cse2) (and .cse4 .cse15) (and .cse16 .cse7 .cse14 .cse17 .cse2 .cse11) (and .cse6 .cse18 .cse11 .cse2 .cse7 .cse19 .cse9) (and .cse12 .cse20 .cse16 .cse14 .cse2) (and (let ((.cse21 (and .cse4 .cse18 .cse2))) (or (and .cse20 .cse21) (and .cse22 .cse21))) .cse13) (and (and (and .cse8 .cse14) .cse10) .cse2) (and .cse6 .cse0 .cse14 .cse2 .cse17 .cse15) (and .cse0 .cse14 .cse18 .cse2) (and .cse22 (and .cse23 .cse2)) (and .cse14 .cse6 .cse10 .cse11 .cse2) (and .cse4 .cse10) (and .cse24 (and .cse4 .cse11)) (and .cse25 (<= 125 ~a26~0) .cse10 .cse11 .cse2) (and .cse12 .cse7 .cse8 .cse26 .cse14 .cse2) (and (<= (+ ~a26~0 75) 0) .cse6 (and .cse22 .cse2)) (and .cse4 .cse8 .cse11) (and .cse12 (and .cse24 .cse14) .cse11 .cse2) (and .cse6 .cse7 .cse19 .cse1 .cse2) (and (and .cse8 .cse25) .cse10 .cse11 .cse2) (and .cse26 .cse1 .cse2) (and .cse14 .cse23 .cse2) (and .cse17 (and .cse25 .cse14) .cse11 .cse2)))) [2019-01-12 05:12:51,348 INFO L448 ceAbstractionStarter]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,348 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,349 INFO L451 ceAbstractionStarter]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-01-12 05:12:51,349 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,350 INFO L448 ceAbstractionStarter]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 05:12:51,351 INFO L448 ceAbstractionStarter]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,352 INFO L448 ceAbstractionStarter]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,352 INFO L444 ceAbstractionStarter]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse27 (+ ~a14~0 182))) (let ((.cse13 (< 217 ~a26~0)) (.cse21 (exists ((v_~a14~0_1227 Int)) (let ((.cse33 (mod v_~a14~0_1227 299909))) (and (not (= .cse33 0)) (< v_~a14~0_1227 0) (<= .cse33 (+ ~a14~0 9)) (<= (+ v_~a14~0_1227 182) 0))))) (.cse7 (exists ((v_prenex_57 Int)) (let ((.cse31 (* 9 v_prenex_57))) (let ((.cse32 (div .cse31 10))) (let ((.cse30 (mod (+ .cse32 31) 48))) (and (not (= 0 .cse30)) (< .cse31 0) (< .cse32 11297) (<= (+ .cse30 74) ~a28~0) (not (= 0 (mod .cse31 10))))))))) (.cse10 (<= .cse27 0)) (.cse18 (<= ~a26~0 559736)) (.cse25 (<= 303 ~a28~0)) (.cse2 (= ~a24~0 1)) (.cse15 (< 37 ~a28~0)) (.cse20 (<= 137 ~a26~0)) (.cse3 (<= (+ ~a14~0 300092) 0)) (.cse16 (<= ~a26~0 217)) (.cse5 (<= ~a26~0 599998)) (.cse11 (exists ((v_prenex_15 Int)) (let ((.cse29 (mod v_prenex_15 14))) (and (not (= .cse29 0)) (< v_prenex_15 0) (<= (+ v_prenex_15 182) 0) (<= .cse29 (+ ~a14~0 112)))))) (.cse8 (<= ~a28~0 300)) (.cse19 (exists ((v_prenex_21 Int)) (let ((.cse28 (mod (+ v_prenex_21 6) 82))) (and (<= (+ .cse28 137) ~a28~0) (not (= 0 .cse28)) (< v_prenex_21 89948))))) (.cse26 (< 0 (+ ~a14~0 114))) (.cse4 (<= ~a26~0 124)) (.cse6 (<= 0 (+ ~a14~0 600000))) (.cse23 (< 300 ~a28~0)) (.cse24 (<= (+ ~a26~0 40337) 0)) (.cse14 (<= ~a26~0 599553)) (.cse17 (< 0 .cse27)) (.cse9 (= 2 ~a24~0)) (.cse12 (<= (+ ~a14~0 84) 0)) (.cse1 (<= ~a21~0 124))) (or (let ((.cse0 (+ ~a14~0 79))) (and (<= .cse0 0) (<= 222 ~a26~0) .cse1 (<= ~a26~0 222) .cse2 (<= ~a28~0 111) (<= 0 .cse0) (<= 111 ~a28~0))) (and (<= (+ ~a28~0 588903) 0) .cse3 .cse4 .cse1) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse1) (and .cse11 (and .cse2 .cse12)) (and .cse2 .cse10) (and .cse13 .cse8 .cse9 .cse14 .cse1 .cse12) (and (and .cse15 .cse16 .cse9) .cse1) (and (and .cse17 (< 124 ~a26~0)) .cse16 .cse12 .cse1) (and .cse6 .cse18 .cse12 .cse1 .cse8 .cse19 .cse20) (and .cse5 .cse21 .cse13 .cse9 .cse1) (and (let ((.cse22 (and .cse2 .cse18 .cse1))) (or (and .cse21 .cse22) (and .cse23 .cse22))) .cse7) (and .cse9 .cse24 .cse1) (and (and .cse15 .cse17 .cse16) .cse1 .cse12) (and .cse6 .cse25 .cse9 .cse1 .cse14 .cse10) (and .cse25 .cse9 .cse18 .cse1) (and .cse25 .cse4 .cse1) (and .cse9 .cse6 .cse16 .cse12 .cse1) (and .cse2 .cse16) (and .cse5 .cse8 .cse15 .cse26 .cse9 .cse1) (and .cse2 .cse15 .cse12) (and .cse6 (or (and .cse8 .cse15 .cse20 .cse1) (and .cse3 .cse8 .cse1)) (<= 125 ~a26~0) .cse16 .cse12) (and .cse5 (and .cse11 .cse9) .cse12 .cse1) (and .cse6 .cse8 .cse19 .cse4 .cse1) (and .cse26 .cse4 .cse1) (and (<= (+ ~a26~0 75) 0) (and .cse23 .cse1) .cse6) (and .cse23 .cse24 .cse1) (and .cse14 (and .cse17 .cse9) .cse12 .cse1)))) [2019-01-12 05:12:51,352 INFO L448 ceAbstractionStarter]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,352 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,352 INFO L448 ceAbstractionStarter]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-01-12 05:12:51,353 INFO L448 ceAbstractionStarter]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,354 INFO L448 ceAbstractionStarter]: For program point L206(line 206) no Hoare annotation was computed. [2019-01-12 05:12:51,355 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-01-12 05:12:51,355 INFO L448 ceAbstractionStarter]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,355 INFO L448 ceAbstractionStarter]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-01-12 05:12:51,355 INFO L448 ceAbstractionStarter]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,359 INFO L448 ceAbstractionStarter]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,360 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,361 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,361 INFO L448 ceAbstractionStarter]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,361 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,361 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,361 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,361 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,373 INFO L448 ceAbstractionStarter]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,374 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,375 INFO L448 ceAbstractionStarter]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-01-12 05:12:51,375 INFO L448 ceAbstractionStarter]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-01-12 05:12:51,375 INFO L448 ceAbstractionStarter]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,375 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,375 INFO L448 ceAbstractionStarter]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,375 INFO L448 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2019-01-12 05:12:51,375 INFO L448 ceAbstractionStarter]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,382 INFO L448 ceAbstractionStarter]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,382 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,382 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,382 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-01-12 05:12:51,383 INFO L448 ceAbstractionStarter]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-01-12 05:12:51,384 INFO L448 ceAbstractionStarter]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-01-12 05:12:51,384 INFO L448 ceAbstractionStarter]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-01-12 05:12:51,384 INFO L448 ceAbstractionStarter]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,385 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,390 INFO L448 ceAbstractionStarter]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,390 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-01-12 05:12:51,390 INFO L448 ceAbstractionStarter]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,390 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,390 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,390 INFO L448 ceAbstractionStarter]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-01-12 05:12:51,390 INFO L448 ceAbstractionStarter]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-01-12 05:12:51,390 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:12:51,391 INFO L448 ceAbstractionStarter]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,392 INFO L448 ceAbstractionStarter]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,392 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,392 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-01-12 05:12:51,392 INFO L448 ceAbstractionStarter]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-01-12 05:12:51,392 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-01-12 05:12:51,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,538 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:51,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:51,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:51,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:51,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:12:51 BoogieIcfgContainer [2019-01-12 05:12:51,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 05:12:51,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 05:12:51,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 05:12:51,565 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 05:12:51,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:04:36" (3/4) ... [2019-01-12 05:12:51,573 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 05:12:51,661 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 05:12:51,672 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 05:12:51,744 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28) || (((a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 <= 124) && a21 <= 124)) || ((((((a26 <= 599998 && 0 <= a14 + 600000) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10))) && a28 <= 300) && 2 == a24) && a14 + 182 <= 0) && a21 <= 124)) || ((\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && a24 == 1 && a14 + 84 <= 0)) || (a24 == 1 && a14 + 182 <= 0)) || (((((217 < a26 && a28 <= 300) && 2 == a24) && a26 <= 599553) && a21 <= 124) && a14 + 84 <= 0)) || (((37 < a28 && a26 <= 217) && 2 == a24) && a21 <= 124)) || ((((0 < a14 + 182 && 124 < a26) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((((0 <= a14 + 600000 && a26 <= 559736) && a14 + 84 <= 0) && a21 <= 124) && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && 137 <= a26)) || ((((a26 <= 599998 && (\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0)) && 217 < a26) && 2 == a24) && a21 <= 124)) || ((((\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0) && (a24 == 1 && a26 <= 559736) && a21 <= 124) || (300 < a28 && (a24 == 1 && a26 <= 559736) && a21 <= 124)) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10)))) || ((2 == a24 && a26 + 40337 <= 0) && a21 <= 124)) || ((((37 < a28 && 0 < a14 + 182) && a26 <= 217) && a21 <= 124) && a14 + 84 <= 0)) || (((((0 <= a14 + 600000 && 303 <= a28) && 2 == a24) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((303 <= a28 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((303 <= a28 && a26 <= 124) && a21 <= 124)) || ((((2 == a24 && 0 <= a14 + 600000) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || (a24 == 1 && a26 <= 217)) || (((((a26 <= 599998 && a28 <= 300) && 37 < a28) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a14 + 84 <= 0)) || ((((0 <= a14 + 600000 && ((((a28 <= 300 && 37 < a28) && 137 <= a26) && a21 <= 124) || ((a14 + 300092 <= 0 && a28 <= 300) && a21 <= 124))) && 125 <= a26) && a26 <= 217) && a14 + 84 <= 0)) || (((a26 <= 599998 && (\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && 2 == a24) && a14 + 84 <= 0) && a21 <= 124)) || ((((0 <= a14 + 600000 && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && a26 <= 124) && a21 <= 124)) || ((0 < a14 + 114 && a26 <= 124) && a21 <= 124)) || ((a26 + 75 <= 0 && 300 < a28 && a21 <= 124) && 0 <= a14 + 600000)) || ((300 < a28 && a26 + 40337 <= 0) && a21 <= 124)) || (((a26 <= 599553 && 0 < a14 + 182 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) [2019-01-12 05:12:51,756 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28) || (((a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 <= 124) && a21 <= 124)) || ((((((a26 <= 599998 && 0 <= a14 + 600000) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10))) && a28 <= 300) && 2 == a24) && a14 + 182 <= 0) && a21 <= 124)) || ((\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && a24 == 1 && a14 + 84 <= 0)) || (a24 == 1 && a14 + 182 <= 0)) || (((((217 < a26 && a28 <= 300) && 2 == a24) && a26 <= 599553) && a21 <= 124) && a14 + 84 <= 0)) || (((37 < a28 && a26 <= 217) && 2 == a24) && a21 <= 124)) || ((((0 < a14 + 182 && 124 < a26) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((((0 <= a14 + 600000 && a26 <= 559736) && a14 + 84 <= 0) && a21 <= 124) && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && 137 <= a26)) || ((((a26 <= 599998 && (\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0)) && 217 < a26) && 2 == a24) && a21 <= 124)) || ((((\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0) && (a24 == 1 && a26 <= 559736) && a21 <= 124) || (300 < a28 && (a24 == 1 && a26 <= 559736) && a21 <= 124)) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10)))) || ((2 == a24 && a26 + 40337 <= 0) && a21 <= 124)) || ((((37 < a28 && 0 < a14 + 182) && a26 <= 217) && a21 <= 124) && a14 + 84 <= 0)) || (((((0 <= a14 + 600000 && 303 <= a28) && 2 == a24) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((303 <= a28 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((303 <= a28 && a26 <= 124) && a21 <= 124)) || ((((2 == a24 && 0 <= a14 + 600000) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || (a24 == 1 && a26 <= 217)) || (((((a26 <= 599998 && a28 <= 300) && 37 < a28) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a14 + 84 <= 0)) || ((((0 <= a14 + 600000 && ((((a28 <= 300 && 37 < a28) && 137 <= a26) && a21 <= 124) || ((a14 + 300092 <= 0 && a28 <= 300) && a21 <= 124))) && 125 <= a26) && a26 <= 217) && a14 + 84 <= 0)) || (((a26 <= 599998 && (\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && 2 == a24) && a14 + 84 <= 0) && a21 <= 124)) || ((((0 <= a14 + 600000 && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && a26 <= 124) && a21 <= 124)) || ((0 < a14 + 114 && a26 <= 124) && a21 <= 124)) || ((a26 + 75 <= 0 && 300 < a28 && a21 <= 124) && 0 <= a14 + 600000)) || ((300 < a28 && a26 + 40337 <= 0) && a21 <= 124)) || (((a26 <= 599553 && 0 < a14 + 182 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) [2019-01-12 05:12:51,777 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((303 <= a28 && a26 <= 124) && a21 <= 124) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || (((a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 <= 124) && a21 <= 124)) || (((0 <= a14 + 600000 && ((((a28 <= 300 && 37 < a28) && 137 <= a26) && a21 <= 124) || (((124 < a26 && a14 + 300092 <= 0) && a28 <= 300) && a21 <= 124))) && a26 <= 217) && a14 + 84 <= 0)) || ((((((a26 <= 599998 && 0 <= a14 + 600000) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10))) && a28 <= 300) && 2 == a24) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && a14 + 182 <= 0)) || (((((217 < a26 && a28 <= 300) && 2 == a24) && a26 <= 599553) && a21 <= 124) && a14 + 84 <= 0)) || ((((((0 <= a14 + 600000 && a26 <= 559736) && a14 + 84 <= 0) && a21 <= 124) && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && 137 <= a26)) || ((((a26 <= 599998 && (\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0)) && 217 < a26) && 2 == a24) && a21 <= 124)) || ((((\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0) && (a24 == 1 && a26 <= 559736) && a21 <= 124) || (300 < a28 && (a24 == 1 && a26 <= 559736) && a21 <= 124)) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10)))) || (((37 < a28 && 2 == a24) && a26 <= 217) && a21 <= 124)) || (((((0 <= a14 + 600000 && 303 <= a28) && 2 == a24) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((303 <= a28 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || (300 < a28 && a26 + 40337 <= 0 && a21 <= 124)) || ((((2 == a24 && 0 <= a14 + 600000) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || (a24 == 1 && a26 <= 217)) || ((\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && a24 == 1 && a14 + 84 <= 0)) || ((((0 < a14 + 182 && 125 <= a26) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || (((((a26 <= 599998 && a28 <= 300) && 37 < a28) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || ((a26 + 75 <= 0 && 0 <= a14 + 600000) && 300 < a28 && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a14 + 84 <= 0)) || (((a26 <= 599998 && (\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && 2 == a24) && a14 + 84 <= 0) && a21 <= 124)) || ((((0 <= a14 + 600000 && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && a26 <= 124) && a21 <= 124)) || ((((37 < a28 && 0 < a14 + 182) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((0 < a14 + 114 && a26 <= 124) && a21 <= 124)) || ((2 == a24 && a26 + 40337 <= 0) && a21 <= 124)) || (((a26 <= 599553 && 0 < a14 + 182 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) [2019-01-12 05:12:52,078 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 05:12:52,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 05:12:52,080 INFO L168 Benchmark]: Toolchain (without parser) took 505504.58 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 941.8 MB in the beginning and 942.7 MB in the end (delta: -898.0 kB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-01-12 05:12:52,081 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 05:12:52,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1739.78 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 802.2 MB in the end (delta: 139.6 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. [2019-01-12 05:12:52,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 464.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 802.2 MB in the beginning and 1.1 GB in the end (delta: -297.0 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2019-01-12 05:12:52,082 INFO L168 Benchmark]: Boogie Preprocessor took 262.45 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2019-01-12 05:12:52,085 INFO L168 Benchmark]: RCFGBuilder took 7817.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.2 MB). Peak memory consumption was 282.0 MB. Max. memory is 11.5 GB. [2019-01-12 05:12:52,086 INFO L168 Benchmark]: TraceAbstraction took 494699.10 ms. Allocated memory was 1.3 GB in the beginning and 5.4 GB in the end (delta: 4.0 GB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.2 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2019-01-12 05:12:52,087 INFO L168 Benchmark]: Witness Printer took 514.17 ms. Allocated memory is still 5.4 GB. Free memory was 1.0 GB in the beginning and 942.7 MB in the end (delta: 74.9 MB). Peak memory consumption was 74.9 MB. Max. memory is 11.5 GB. [2019-01-12 05:12:52,092 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.59 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 1739.78 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 802.2 MB in the end (delta: 139.6 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 464.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 802.2 MB in the beginning and 1.1 GB in the end (delta: -297.0 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 262.45 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7817.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.2 MB). Peak memory consumption was 282.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 494699.10 ms. Allocated memory was 1.3 GB in the beginning and 5.4 GB in the end (delta: 4.0 GB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.2 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 514.17 ms. Allocated memory is still 5.4 GB. Free memory was 1.0 GB in the beginning and 942.7 MB in the end (delta: 74.9 MB). Peak memory consumption was 74.9 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_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-01-12 05:12:52,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,115 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28) || (((a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 <= 124) && a21 <= 124)) || ((((((a26 <= 599998 && 0 <= a14 + 600000) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10))) && a28 <= 300) && 2 == a24) && a14 + 182 <= 0) && a21 <= 124)) || ((\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && a24 == 1 && a14 + 84 <= 0)) || (a24 == 1 && a14 + 182 <= 0)) || (((((217 < a26 && a28 <= 300) && 2 == a24) && a26 <= 599553) && a21 <= 124) && a14 + 84 <= 0)) || (((37 < a28 && a26 <= 217) && 2 == a24) && a21 <= 124)) || ((((0 < a14 + 182 && 124 < a26) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((((0 <= a14 + 600000 && a26 <= 559736) && a14 + 84 <= 0) && a21 <= 124) && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && 137 <= a26)) || ((((a26 <= 599998 && (\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0)) && 217 < a26) && 2 == a24) && a21 <= 124)) || ((((\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0) && (a24 == 1 && a26 <= 559736) && a21 <= 124) || (300 < a28 && (a24 == 1 && a26 <= 559736) && a21 <= 124)) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10)))) || ((2 == a24 && a26 + 40337 <= 0) && a21 <= 124)) || ((((37 < a28 && 0 < a14 + 182) && a26 <= 217) && a21 <= 124) && a14 + 84 <= 0)) || (((((0 <= a14 + 600000 && 303 <= a28) && 2 == a24) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((303 <= a28 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((303 <= a28 && a26 <= 124) && a21 <= 124)) || ((((2 == a24 && 0 <= a14 + 600000) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || (a24 == 1 && a26 <= 217)) || (((((a26 <= 599998 && a28 <= 300) && 37 < a28) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a14 + 84 <= 0)) || ((((0 <= a14 + 600000 && ((((a28 <= 300 && 37 < a28) && 137 <= a26) && a21 <= 124) || ((a14 + 300092 <= 0 && a28 <= 300) && a21 <= 124))) && 125 <= a26) && a26 <= 217) && a14 + 84 <= 0)) || (((a26 <= 599998 && (\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && 2 == a24) && a14 + 84 <= 0) && a21 <= 124)) || ((((0 <= a14 + 600000 && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && a26 <= 124) && a21 <= 124)) || ((0 < a14 + 114 && a26 <= 124) && a21 <= 124)) || ((a26 + 75 <= 0 && 300 < a28 && a21 <= 124) && 0 <= a14 + 600000)) || ((300 < a28 && a26 + 40337 <= 0) && a21 <= 124)) || (((a26 <= 599553 && 0 < a14 + 182 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) - InvariantResult [Line: 1646]: Loop Invariant [2019-01-12 05:12:52,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((303 <= a28 && a26 <= 124) && a21 <= 124) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || (((a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 <= 124) && a21 <= 124)) || (((0 <= a14 + 600000 && ((((a28 <= 300 && 37 < a28) && 137 <= a26) && a21 <= 124) || (((124 < a26 && a14 + 300092 <= 0) && a28 <= 300) && a21 <= 124))) && a26 <= 217) && a14 + 84 <= 0)) || ((((((a26 <= 599998 && 0 <= a14 + 600000) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10))) && a28 <= 300) && 2 == a24) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && a14 + 182 <= 0)) || (((((217 < a26 && a28 <= 300) && 2 == a24) && a26 <= 599553) && a21 <= 124) && a14 + 84 <= 0)) || ((((((0 <= a14 + 600000 && a26 <= 559736) && a14 + 84 <= 0) && a21 <= 124) && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && 137 <= a26)) || ((((a26 <= 599998 && (\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0)) && 217 < a26) && 2 == a24) && a21 <= 124)) || ((((\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0) && (a24 == 1 && a26 <= 559736) && a21 <= 124) || (300 < a28 && (a24 == 1 && a26 <= 559736) && a21 <= 124)) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10)))) || (((37 < a28 && 2 == a24) && a26 <= 217) && a21 <= 124)) || (((((0 <= a14 + 600000 && 303 <= a28) && 2 == a24) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((303 <= a28 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || (300 < a28 && a26 + 40337 <= 0 && a21 <= 124)) || ((((2 == a24 && 0 <= a14 + 600000) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || (a24 == 1 && a26 <= 217)) || ((\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && a24 == 1 && a14 + 84 <= 0)) || ((((0 < a14 + 182 && 125 <= a26) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || (((((a26 <= 599998 && a28 <= 300) && 37 < a28) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || ((a26 + 75 <= 0 && 0 <= a14 + 600000) && 300 < a28 && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a14 + 84 <= 0)) || (((a26 <= 599998 && (\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && 2 == a24) && a14 + 84 <= 0) && a21 <= 124)) || ((((0 <= a14 + 600000 && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && a26 <= 124) && a21 <= 124)) || ((((37 < a28 && 0 < a14 + 182) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((0 < a14 + 114 && a26 <= 124) && a21 <= 124)) || ((2 == a24 && a26 + 40337 <= 0) && a21 <= 124)) || (((a26 <= 599553 && 0 < a14 + 182 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) - InvariantResult [Line: 24]: Loop Invariant [2019-01-12 05:12:52,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-01-12 05:12:52,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2019-01-12 05:12:52,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 05:12:52,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 05:12:52,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28) || (((a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 <= 124) && a21 <= 124)) || ((((((a26 <= 599998 && 0 <= a14 + 600000) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10))) && a28 <= 300) && 2 == a24) && a14 + 182 <= 0) && a21 <= 124)) || ((\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && a24 == 1 && a14 + 84 <= 0)) || (a24 == 1 && a14 + 182 <= 0)) || (((((217 < a26 && a28 <= 300) && 2 == a24) && a26 <= 599553) && a21 <= 124) && a14 + 84 <= 0)) || (((37 < a28 && a26 <= 217) && 2 == a24) && a21 <= 124)) || ((((0 < a14 + 182 && 124 < a26) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((((0 <= a14 + 600000 && a26 <= 559736) && a14 + 84 <= 0) && a21 <= 124) && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && 137 <= a26)) || ((((a26 <= 599998 && (\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0)) && 217 < a26) && 2 == a24) && a21 <= 124)) || ((((\exists v_~a14~0_1227 : int :: ((!(v_~a14~0_1227 % 299909 == 0) && v_~a14~0_1227 < 0) && v_~a14~0_1227 % 299909 <= a14 + 9) && v_~a14~0_1227 + 182 <= 0) && (a24 == 1 && a26 <= 559736) && a21 <= 124) || (300 < a28 && (a24 == 1 && a26 <= 559736) && a21 <= 124)) && (\exists v_prenex_57 : int :: (((!(0 == (9 * v_prenex_57 / 10 + 31) % 48) && 9 * v_prenex_57 < 0) && 9 * v_prenex_57 / 10 < 11297) && (9 * v_prenex_57 / 10 + 31) % 48 + 74 <= a28) && !(0 == 9 * v_prenex_57 % 10)))) || ((2 == a24 && a26 + 40337 <= 0) && a21 <= 124)) || ((((37 < a28 && 0 < a14 + 182) && a26 <= 217) && a21 <= 124) && a14 + 84 <= 0)) || (((((0 <= a14 + 600000 && 303 <= a28) && 2 == a24) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((303 <= a28 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((303 <= a28 && a26 <= 124) && a21 <= 124)) || ((((2 == a24 && 0 <= a14 + 600000) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || (a24 == 1 && a26 <= 217)) || (((((a26 <= 599998 && a28 <= 300) && 37 < a28) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a14 + 84 <= 0)) || ((((0 <= a14 + 600000 && ((((a28 <= 300 && 37 < a28) && 137 <= a26) && a21 <= 124) || ((a14 + 300092 <= 0 && a28 <= 300) && a21 <= 124))) && 125 <= a26) && a26 <= 217) && a14 + 84 <= 0)) || (((a26 <= 599998 && (\exists v_prenex_15 : int :: ((!(v_prenex_15 % 14 == 0) && v_prenex_15 < 0) && v_prenex_15 + 182 <= 0) && v_prenex_15 % 14 <= a14 + 112) && 2 == a24) && a14 + 84 <= 0) && a21 <= 124)) || ((((0 <= a14 + 600000 && a28 <= 300) && (\exists v_prenex_21 : int :: ((v_prenex_21 + 6) % 82 + 137 <= a28 && !(0 == (v_prenex_21 + 6) % 82)) && v_prenex_21 < 89948)) && a26 <= 124) && a21 <= 124)) || ((0 < a14 + 114 && a26 <= 124) && a21 <= 124)) || ((a26 + 75 <= 0 && 300 < a28 && a21 <= 124) && 0 <= a14 + 600000)) || ((300 < a28 && a26 + 40337 <= 0) && a21 <= 124)) || (((a26 <= 599553 && 0 < a14 + 182 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. SAFE Result, 494.4s OverallTime, 21 OverallIterations, 10 TraceHistogramMax, 353.7s AutomataDifference, 0.0s DeadEndRemovalTime, 67.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4966 SDtfs, 35991 SDslu, 3197 SDs, 0 SdLazy, 114419 SolverSat, 11439 SolverUnsat, 72 SolverUnknown, 0 SolverNotchecked, 309.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10366 GetRequests, 10236 SyntacticMatches, 7 SemanticMatches, 123 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113974occurred in iteration=20, 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: 12.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 226877 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 958 NumberOfFragments, 2145 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3749024 FormulaSimplificationTreeSizeReduction, 14.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 941932 FormulaSimplificationTreeSizeReductionInter, 52.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 37.3s InterpolantComputationTime, 28589 NumberOfCodeBlocks, 28589 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 28558 ConstructedInterpolants, 1134 QuantifiedInterpolants, 163651802 SizeOfPredicates, 7 NumberOfNonLiveVariables, 12163 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 56087/61059 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...