./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label19_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem15_label19_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 edeea1f74999e0c407ee107c2e6c77e98295c642 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:32:11,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:32:11,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:32:11,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:32:11,072 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:32:11,074 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:32:11,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:32:11,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:32:11,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:32:11,081 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:32:11,082 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:32:11,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:32:11,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:32:11,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:32:11,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:32:11,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:32:11,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:32:11,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:32:11,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:32:11,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:32:11,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:32:11,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:32:11,100 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:32:11,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:32:11,101 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:32:11,102 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:32:11,103 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:32:11,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:32:11,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:32:11,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:32:11,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:32:11,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:32:11,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:32:11,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:32:11,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:32:11,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:32:11,111 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:32:11,129 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:32:11,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:32:11,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:32:11,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:32:11,131 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:32:11,131 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:32:11,132 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:32:11,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:32:11,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:32:11,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:32:11,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:32:11,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:32:11,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:32:11,133 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:32:11,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:32:11,133 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:32:11,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:32:11,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:32:11,136 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:32:11,136 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:32:11,136 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:32:11,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:32:11,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:32:11,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:32:11,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:32:11,138 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:32:11,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:32:11,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:32:11,138 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 -> edeea1f74999e0c407ee107c2e6c77e98295c642 [2019-01-12 04:32:11,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:32:11,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:32:11,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:32:11,194 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:32:11,195 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:32:11,196 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label19_true-unreach-call.c [2019-01-12 04:32:11,255 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4f54a19/ff834f91cc184c4a8e9cc7490b80d141/FLAG24294cea4 [2019-01-12 04:32:11,915 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:32:11,916 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label19_true-unreach-call.c [2019-01-12 04:32:11,938 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4f54a19/ff834f91cc184c4a8e9cc7490b80d141/FLAG24294cea4 [2019-01-12 04:32:12,087 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4f54a19/ff834f91cc184c4a8e9cc7490b80d141 [2019-01-12 04:32:12,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:32:12,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:32:12,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:32:12,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:32:12,100 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:32:12,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:32:12" (1/1) ... [2019-01-12 04:32:12,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5636bad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:12, skipping insertion in model container [2019-01-12 04:32:12,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:32:12" (1/1) ... [2019-01-12 04:32:12,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:32:12,210 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:32:13,122 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:32:13,133 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:32:13,460 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:32:13,648 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:32:13,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13 WrapperNode [2019-01-12 04:32:13,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:32:13,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:32:13,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:32:13,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:32:13,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:13,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:13,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:32:13,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:32:13,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:32:13,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:32:13,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:13,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:13,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:13,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:14,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:14,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:14,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... [2019-01-12 04:32:14,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:32:14,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:32:14,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:32:14,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:32:14,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:32:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:32:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:32:20,450 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:32:20,451 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:32:20,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:32:20 BoogieIcfgContainer [2019-01-12 04:32:20,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:32:20,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:32:20,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:32:20,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:32:20,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:32:12" (1/3) ... [2019-01-12 04:32:20,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea39124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:32:20, skipping insertion in model container [2019-01-12 04:32:20,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:32:13" (2/3) ... [2019-01-12 04:32:20,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea39124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:32:20, skipping insertion in model container [2019-01-12 04:32:20,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:32:20" (3/3) ... [2019-01-12 04:32:20,462 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label19_true-unreach-call.c [2019-01-12 04:32:20,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:32:20,481 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:32:20,498 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:32:20,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:32:20,534 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:32:20,535 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:32:20,535 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:32:20,535 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:32:20,535 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:32:20,535 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:32:20,535 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:32:20,535 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:32:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:32:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 04:32:20,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:20,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:32:20,582 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-01-12 04:32:20,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:20,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:20,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:21,043 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:32:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:32:21,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:32:21,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:32:21,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:32:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:32:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:32:21,084 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:32:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:26,550 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-01-12 04:32:26,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:32:26,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-12 04:32:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:26,599 INFO L225 Difference]: With dead ends: 1514 [2019-01-12 04:32:26,599 INFO L226 Difference]: Without dead ends: 1008 [2019-01-12 04:32:26,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:32:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-01-12 04:32:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-01-12 04:32:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-01-12 04:32:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-01-12 04:32:26,804 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 45 [2019-01-12 04:32:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:26,805 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-01-12 04:32:26,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:32:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-01-12 04:32:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 04:32:26,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:26,810 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:32:26,811 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:26,812 INFO L82 PathProgramCache]: Analyzing trace with hash 416619247, now seen corresponding path program 1 times [2019-01-12 04:32:26,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:26,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:26,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:26,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:26,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:32:27,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:32:27,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:32:27,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:32:27,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:32:27,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:32:27,220 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 5 states. [2019-01-12 04:32:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:36,363 INFO L93 Difference]: Finished difference Result 2303 states and 3981 transitions. [2019-01-12 04:32:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:32:36,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-01-12 04:32:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:36,378 INFO L225 Difference]: With dead ends: 2303 [2019-01-12 04:32:36,379 INFO L226 Difference]: Without dead ends: 1628 [2019-01-12 04:32:36,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:32:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-01-12 04:32:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 989. [2019-01-12 04:32:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-01-12 04:32:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1597 transitions. [2019-01-12 04:32:36,424 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1597 transitions. Word has length 110 [2019-01-12 04:32:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:36,424 INFO L480 AbstractCegarLoop]: Abstraction has 989 states and 1597 transitions. [2019-01-12 04:32:36,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:32:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1597 transitions. [2019-01-12 04:32:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 04:32:36,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:36,430 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:32:36,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1808654100, now seen corresponding path program 1 times [2019-01-12 04:32:36,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:36,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:36,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:36,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:32:36,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:32:36,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:32:36,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:32:36,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:32:36,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:32:36,724 INFO L87 Difference]: Start difference. First operand 989 states and 1597 transitions. Second operand 4 states. [2019-01-12 04:32:40,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:40,644 INFO L93 Difference]: Finished difference Result 3777 states and 6149 transitions. [2019-01-12 04:32:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:32:40,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-01-12 04:32:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:40,668 INFO L225 Difference]: With dead ends: 3777 [2019-01-12 04:32:40,668 INFO L226 Difference]: Without dead ends: 2790 [2019-01-12 04:32:40,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:32:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-01-12 04:32:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1886. [2019-01-12 04:32:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-01-12 04:32:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2633 transitions. [2019-01-12 04:32:40,731 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2633 transitions. Word has length 111 [2019-01-12 04:32:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:40,733 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 2633 transitions. [2019-01-12 04:32:40,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:32:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2633 transitions. [2019-01-12 04:32:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 04:32:40,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:40,742 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:32:40,742 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:40,743 INFO L82 PathProgramCache]: Analyzing trace with hash 399406558, now seen corresponding path program 1 times [2019-01-12 04:32:40,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:40,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:40,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:32:41,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:32:41,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:32:41,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:32:41,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:32:41,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:32:41,071 INFO L87 Difference]: Start difference. First operand 1886 states and 2633 transitions. Second operand 4 states. [2019-01-12 04:32:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:45,051 INFO L93 Difference]: Finished difference Result 7368 states and 10298 transitions. [2019-01-12 04:32:45,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:32:45,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-01-12 04:32:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:45,088 INFO L225 Difference]: With dead ends: 7368 [2019-01-12 04:32:45,088 INFO L226 Difference]: Without dead ends: 5484 [2019-01-12 04:32:45,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:32:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2019-01-12 04:32:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5180. [2019-01-12 04:32:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-01-12 04:32:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6692 transitions. [2019-01-12 04:32:45,201 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6692 transitions. Word has length 115 [2019-01-12 04:32:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:45,202 INFO L480 AbstractCegarLoop]: Abstraction has 5180 states and 6692 transitions. [2019-01-12 04:32:45,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:32:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6692 transitions. [2019-01-12 04:32:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-12 04:32:45,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:45,205 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:32:45,206 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:45,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:45,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1837727490, now seen corresponding path program 1 times [2019-01-12 04:32:45,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:45,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:45,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:45,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:45,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:32:45,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:32:45,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:32:45,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:45,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:32:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:32:46,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:32:46,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:32:46,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:32:46,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:32:46,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:32:46,175 INFO L87 Difference]: Start difference. First operand 5180 states and 6692 transitions. Second operand 7 states. [2019-01-12 04:32:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:57,293 INFO L93 Difference]: Finished difference Result 26544 states and 34459 transitions. [2019-01-12 04:32:57,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:32:57,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-01-12 04:32:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:57,352 INFO L225 Difference]: With dead ends: 26544 [2019-01-12 04:32:57,352 INFO L226 Difference]: Without dead ends: 15386 [2019-01-12 04:32:57,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:32:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15386 states. [2019-01-12 04:32:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15386 to 11764. [2019-01-12 04:32:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11764 states. [2019-01-12 04:32:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11764 states to 11764 states and 13451 transitions. [2019-01-12 04:32:57,646 INFO L78 Accepts]: Start accepts. Automaton has 11764 states and 13451 transitions. Word has length 136 [2019-01-12 04:32:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:57,647 INFO L480 AbstractCegarLoop]: Abstraction has 11764 states and 13451 transitions. [2019-01-12 04:32:57,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:32:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 11764 states and 13451 transitions. [2019-01-12 04:32:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-01-12 04:32:57,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:57,653 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:32:57,654 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1938559075, now seen corresponding path program 1 times [2019-01-12 04:32:57,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:57,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:57,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:57,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-01-12 04:32:58,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:32:58,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:32:58,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:32:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:32:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:32:58,201 INFO L87 Difference]: Start difference. First operand 11764 states and 13451 transitions. Second operand 5 states. [2019-01-12 04:33:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:00,824 INFO L93 Difference]: Finished difference Result 24126 states and 27541 transitions. [2019-01-12 04:33:00,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:33:00,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 363 [2019-01-12 04:33:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:00,854 INFO L225 Difference]: With dead ends: 24126 [2019-01-12 04:33:00,854 INFO L226 Difference]: Without dead ends: 12663 [2019-01-12 04:33:00,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:33:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12663 states. [2019-01-12 04:33:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12663 to 12661. [2019-01-12 04:33:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12661 states. [2019-01-12 04:33:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 14355 transitions. [2019-01-12 04:33:01,096 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 14355 transitions. Word has length 363 [2019-01-12 04:33:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:01,096 INFO L480 AbstractCegarLoop]: Abstraction has 12661 states and 14355 transitions. [2019-01-12 04:33:01,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:33:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 14355 transitions. [2019-01-12 04:33:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-01-12 04:33:01,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:01,106 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:33:01,106 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1680735344, now seen corresponding path program 1 times [2019-01-12 04:33:01,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:01,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:01,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:33:01,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:33:01,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:33:01,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:33:01,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:33:01,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:01,569 INFO L87 Difference]: Start difference. First operand 12661 states and 14355 transitions. Second operand 4 states. [2019-01-12 04:33:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:05,751 INFO L93 Difference]: Finished difference Result 25025 states and 28417 transitions. [2019-01-12 04:33:05,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:33:05,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-01-12 04:33:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:05,778 INFO L225 Difference]: With dead ends: 25025 [2019-01-12 04:33:05,779 INFO L226 Difference]: Without dead ends: 12665 [2019-01-12 04:33:05,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12665 states. [2019-01-12 04:33:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12665 to 10264. [2019-01-12 04:33:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-01-12 04:33:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 11172 transitions. [2019-01-12 04:33:05,949 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 11172 transitions. Word has length 422 [2019-01-12 04:33:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:05,950 INFO L480 AbstractCegarLoop]: Abstraction has 10264 states and 11172 transitions. [2019-01-12 04:33:05,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:33:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 11172 transitions. [2019-01-12 04:33:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-01-12 04:33:05,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:05,971 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:33:05,971 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash 81446721, now seen corresponding path program 1 times [2019-01-12 04:33:05,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:05,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:05,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:05,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:06,584 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:33:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 285 proven. 70 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-01-12 04:33:07,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:33:07,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:33:07,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:07,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:33:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-01-12 04:33:07,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:33:07,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:33:07,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:33:07,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:33:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:33:07,542 INFO L87 Difference]: Start difference. First operand 10264 states and 11172 transitions. Second operand 9 states. [2019-01-12 04:33:08,831 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 7 [2019-01-12 04:33:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:16,058 INFO L93 Difference]: Finished difference Result 30272 states and 33384 transitions. [2019-01-12 04:33:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 04:33:16,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 506 [2019-01-12 04:33:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:16,097 INFO L225 Difference]: With dead ends: 30272 [2019-01-12 04:33:16,098 INFO L226 Difference]: Without dead ends: 20010 [2019-01-12 04:33:16,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 513 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-01-12 04:33:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states. [2019-01-12 04:33:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 17139. [2019-01-12 04:33:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17139 states. [2019-01-12 04:33:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17139 states to 17139 states and 18572 transitions. [2019-01-12 04:33:16,425 INFO L78 Accepts]: Start accepts. Automaton has 17139 states and 18572 transitions. Word has length 506 [2019-01-12 04:33:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:16,426 INFO L480 AbstractCegarLoop]: Abstraction has 17139 states and 18572 transitions. [2019-01-12 04:33:16,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:33:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17139 states and 18572 transitions. [2019-01-12 04:33:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-01-12 04:33:16,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:16,466 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:33:16,467 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash 335196122, now seen corresponding path program 1 times [2019-01-12 04:33:16,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:16,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:16,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:16,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 646 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-12 04:33:17,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:33:17,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:33:17,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:33:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:33:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:33:17,419 INFO L87 Difference]: Start difference. First operand 17139 states and 18572 transitions. Second operand 3 states. [2019-01-12 04:33:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:19,735 INFO L93 Difference]: Finished difference Result 36367 states and 39314 transitions. [2019-01-12 04:33:19,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:33:19,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 661 [2019-01-12 04:33:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:19,770 INFO L225 Difference]: With dead ends: 36367 [2019-01-12 04:33:19,770 INFO L226 Difference]: Without dead ends: 19230 [2019-01-12 04:33:19,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 04:33:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19230 states. [2019-01-12 04:33:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19230 to 17735. [2019-01-12 04:33:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17735 states. [2019-01-12 04:33:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 18979 transitions. [2019-01-12 04:33:20,064 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 18979 transitions. Word has length 661 [2019-01-12 04:33:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:20,065 INFO L480 AbstractCegarLoop]: Abstraction has 17735 states and 18979 transitions. [2019-01-12 04:33:20,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:33:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 18979 transitions. [2019-01-12 04:33:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-01-12 04:33:20,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:20,095 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:33:20,096 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash 378264636, now seen corresponding path program 1 times [2019-01-12 04:33:20,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:20,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:20,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:20,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:20,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-01-12 04:33:20,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:33:20,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:33:20,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:33:20,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:33:20,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:20,812 INFO L87 Difference]: Start difference. First operand 17735 states and 18979 transitions. Second operand 4 states. [2019-01-12 04:33:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:23,398 INFO L93 Difference]: Finished difference Result 45059 states and 48106 transitions. [2019-01-12 04:33:23,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:33:23,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 689 [2019-01-12 04:33:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:23,431 INFO L225 Difference]: With dead ends: 45059 [2019-01-12 04:33:23,431 INFO L226 Difference]: Without dead ends: 27326 [2019-01-12 04:33:23,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:33:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27326 states. [2019-01-12 04:33:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27326 to 19827. [2019-01-12 04:33:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-01-12 04:33:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 21056 transitions. [2019-01-12 04:33:23,714 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 21056 transitions. Word has length 689 [2019-01-12 04:33:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:23,715 INFO L480 AbstractCegarLoop]: Abstraction has 19827 states and 21056 transitions. [2019-01-12 04:33:23,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:33:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 21056 transitions. [2019-01-12 04:33:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-01-12 04:33:23,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:23,730 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 04:33:23,730 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash 151347988, now seen corresponding path program 1 times [2019-01-12 04:33:23,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:23,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:23,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:23,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 704 proven. 86 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:33:25,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:33:25,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:33:25,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:25,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:33:27,576 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_41 Int)) (let ((.cse1 (div (* (- 250) v_prenex_41) 9))) (let ((.cse0 (div .cse1 5))) (and (< 0 (+ v_prenex_41 147)) (<= c_~a0~0 (div (+ .cse0 (- 278887)) 5)) (<= (+ v_prenex_41 98) 0) (<= 278887 .cse0) (<= 278886 .cse0) (= (mod .cse1 5) 0) (<= (* 250 v_prenex_41) 0))))) (exists ((v_prenex_49 Int)) (let ((.cse3 (div (* (- 250) v_prenex_49) 9))) (let ((.cse2 (div .cse3 5))) (and (< 0 (+ v_prenex_49 147)) (not (= 0 (mod (+ .cse2 3) 5))) (not (= 0 (mod (+ .cse2 4) 5))) (< .cse2 278886) (< .cse2 278887) (<= c_~a0~0 (+ (div (+ .cse2 (- 278887)) 5) 1)) (<= (* 250 v_prenex_49) 0) (<= (+ v_prenex_49 98) 0) (= 0 (mod .cse3 5)))))) (exists ((v_prenex_47 Int)) (let ((.cse5 (div (* (- 250) v_prenex_47) 9))) (let ((.cse4 (div .cse5 5))) (and (< .cse4 278887) (<= (* 250 v_prenex_47) 0) (not (= 0 (mod (+ .cse4 4) 5))) (< 0 (+ v_prenex_47 147)) (<= (+ v_prenex_47 98) 0) (not (= (mod (+ .cse4 3) 5) 0)) (<= c_~a0~0 (+ (div (+ .cse4 (- 278887)) 5) 1)) (< .cse4 278886) (<= 0 .cse5))))) (exists ((v_prenex_12 Int)) (let ((.cse6 (div (* (- 250) v_prenex_12) 9))) (let ((.cse7 (div .cse6 5))) (and (< .cse6 0) (<= (* 250 v_prenex_12) 0) (= (mod (+ .cse7 4) 5) 0) (<= c_~a0~0 (div (+ .cse7 (- 278886)) 5)) (< 0 (+ v_prenex_12 147)) (not (= 0 (mod .cse6 5))) (= (mod (+ .cse7 3) 5) 0) (<= (+ v_prenex_12 98) 0))))) (exists ((v_prenex_52 Int)) (let ((.cse9 (div (* (- 250) v_prenex_52) 9))) (let ((.cse8 (div .cse9 5))) (and (<= (* 250 v_prenex_52) 0) (<= (+ v_prenex_52 98) 0) (< 0 (+ v_prenex_52 147)) (<= 278887 .cse8) (< .cse8 278886) (= (mod .cse9 5) 0) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (not (= 0 (mod (+ .cse8 4) 5))))))) (exists ((v_prenex_14 Int)) (let ((.cse10 (div (* (- 250) v_prenex_14) 9))) (let ((.cse11 (div .cse10 5))) (and (<= 0 .cse10) (= 0 (mod (+ .cse11 4) 5)) (<= (+ v_prenex_14 98) 0) (<= c_~a0~0 (div (+ .cse11 (- 278887)) 5)) (< 0 (+ v_prenex_14 147)) (<= (* 250 v_prenex_14) 0) (= 0 (mod (+ .cse11 3) 5)))))) (exists ((v_prenex_56 Int)) (let ((.cse13 (div (* (- 250) v_prenex_56) 9))) (let ((.cse12 (div .cse13 5))) (and (<= (+ v_prenex_56 98) 0) (<= c_~a0~0 (div (+ .cse12 (- 278887)) 5)) (<= 278887 .cse12) (not (= 0 (mod (+ .cse12 4) 5))) (< .cse12 278886) (<= 0 .cse13) (< 0 (+ v_prenex_56 147)) (<= (* 250 v_prenex_56) 0))))) (exists ((v_prenex_26 Int)) (let ((.cse14 (div (* (- 250) v_prenex_26) 9))) (let ((.cse15 (div .cse14 5))) (and (< 0 (+ v_prenex_26 147)) (<= 0 .cse14) (<= c_~a0~0 (div (+ .cse15 (- 278887)) 5)) (<= (+ v_prenex_26 98) 0) (<= (* 250 v_prenex_26) 0) (not (= (mod (+ .cse15 4) 5) 0)) (< .cse15 278886) (= (mod (+ .cse15 3) 5) 0))))) (exists ((v_prenex_3 Int)) (let ((.cse17 (div (* (- 250) v_prenex_3) 9))) (let ((.cse16 (div .cse17 5))) (and (<= (* 250 v_prenex_3) 0) (<= 278886 .cse16) (<= (+ v_prenex_3 98) 0) (< 0 (+ v_prenex_3 147)) (= (mod .cse17 5) 0) (= 0 (mod (+ .cse16 3) 5)) (<= c_~a0~0 (div (+ .cse16 (- 278887)) 5)))))) (exists ((v_prenex_43 Int)) (let ((.cse18 (div (* (- 250) v_prenex_43) 9))) (let ((.cse19 (div .cse18 5))) (and (< .cse18 0) (<= c_~a0~0 (div (+ .cse19 (- 278886)) 5)) (<= (* 250 v_prenex_43) 0) (<= 278886 .cse19) (< .cse19 278887) (not (= (mod .cse18 5) 0)) (<= (+ v_prenex_43 98) 0) (< 0 (+ v_prenex_43 147)) (not (= (mod (+ .cse19 3) 5) 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse20 (div (* (- 250) v_prenex_10) 9))) (let ((.cse21 (div .cse20 5))) (and (<= (* 250 v_prenex_10) 0) (= 0 (mod .cse20 5)) (<= (+ v_prenex_10 98) 0) (< .cse21 278887) (< 0 (+ v_prenex_10 147)) (not (= (mod (+ .cse21 3) 5) 0)) (= 0 (mod (+ .cse21 4) 5)) (<= c_~a0~0 (+ (div (+ .cse21 (- 278887)) 5) 1)))))) (exists ((v_prenex_16 Int)) (let ((.cse22 (div (* (- 250) v_prenex_16) 9))) (let ((.cse23 (div .cse22 5))) (and (= 0 (mod .cse22 5)) (<= c_~a0~0 (div (+ .cse23 (- 278887)) 5)) (< 0 (+ v_prenex_16 147)) (<= 278887 .cse23) (= 0 (mod (+ .cse23 4) 5)) (<= (+ v_prenex_16 98) 0) (<= (* 250 v_prenex_16) 0))))) (exists ((v_prenex_35 Int)) (let ((.cse25 (div (* (- 250) v_prenex_35) 9))) (let ((.cse24 (div .cse25 5))) (and (not (= (mod (+ .cse24 3) 5) 0)) (< .cse24 278886) (not (= 0 (mod (+ .cse24 4) 5))) (< 0 (+ v_prenex_35 147)) (not (= (mod .cse25 5) 0)) (<= c_~a0~0 (+ (div (+ .cse24 (- 278886)) 5) 1)) (< .cse24 278887) (< .cse25 0) (<= (* 250 v_prenex_35) 0) (<= (+ v_prenex_35 98) 0))))) (exists ((v_prenex_22 Int)) (let ((.cse27 (div (* (- 250) v_prenex_22) 9))) (let ((.cse26 (div .cse27 5))) (and (<= (* 250 v_prenex_22) 0) (= (mod (+ .cse26 4) 5) 0) (not (= 0 (mod .cse27 5))) (< 0 (+ v_prenex_22 147)) (<= 278887 .cse26) (< .cse27 0) (<= (+ v_prenex_22 98) 0) (<= c_~a0~0 (div (+ .cse26 (- 278886)) 5)))))) (exists ((v_prenex_18 Int)) (let ((.cse29 (div (* (- 250) v_prenex_18) 9))) (let ((.cse28 (div .cse29 5))) (and (< 0 (+ v_prenex_18 147)) (<= 278887 .cse28) (< .cse29 0) (<= 278886 .cse28) (<= (* 250 v_prenex_18) 0) (not (= 0 (mod .cse29 5))) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)) (<= (+ v_prenex_18 98) 0))))) (exists ((v_prenex_54 Int)) (let ((.cse30 (div (* (- 250) v_prenex_54) 9))) (let ((.cse31 (div .cse30 5))) (and (not (= (mod .cse30 5) 0)) (< .cse30 0) (<= (* 250 v_prenex_54) 0) (<= (+ v_prenex_54 98) 0) (<= 278886 .cse31) (< 0 (+ v_prenex_54 147)) (= 0 (mod (+ .cse31 3) 5)) (<= c_~a0~0 (div (+ .cse31 (- 278886)) 5)))))) (exists ((v_prenex_29 Int)) (let ((.cse33 (div (* (- 250) v_prenex_29) 9))) (let ((.cse32 (div .cse33 5))) (and (<= 278887 .cse32) (<= (+ v_prenex_29 98) 0) (< 0 (+ v_prenex_29 147)) (<= 278886 .cse32) (<= c_~a0~0 (div (+ .cse32 (- 278887)) 5)) (<= 0 .cse33) (<= (* 250 v_prenex_29) 0))))) (exists ((v_prenex_20 Int)) (let ((.cse35 (div (* (- 250) v_prenex_20) 9))) (let ((.cse34 (div .cse35 5))) (and (<= (+ v_prenex_20 98) 0) (not (= 0 (mod (+ .cse34 3) 5))) (< 0 (+ v_prenex_20 147)) (< .cse34 278887) (<= (* 250 v_prenex_20) 0) (<= c_~a0~0 (+ (div (+ .cse34 (- 278887)) 5) 1)) (<= 278886 .cse34) (<= 0 .cse35))))) (exists ((v_prenex_27 Int)) (let ((.cse37 (div (* (- 250) v_prenex_27) 9))) (let ((.cse36 (div .cse37 5))) (and (<= c_~a0~0 (+ (div (+ .cse36 (- 278887)) 5) 1)) (= (mod (+ .cse36 4) 5) 0) (not (= (mod (+ .cse36 3) 5) 0)) (< 0 (+ v_prenex_27 147)) (<= (+ v_prenex_27 98) 0) (< .cse36 278887) (<= (* 250 v_prenex_27) 0) (<= 0 .cse37))))) (exists ((v_prenex_33 Int)) (let ((.cse39 (div (* (- 250) v_prenex_33) 9))) (let ((.cse38 (div .cse39 5))) (and (= (mod (+ .cse38 4) 5) 0) (<= c_~a0~0 (div (+ .cse38 (- 278886)) 5)) (not (= (mod (+ .cse38 3) 5) 0)) (not (= 0 (mod .cse39 5))) (<= (+ v_prenex_33 98) 0) (< 0 (+ v_prenex_33 147)) (< .cse38 278887) (<= (* 250 v_prenex_33) 0) (< .cse39 0))))) (exists ((v_prenex_24 Int)) (let ((.cse40 (div (* (- 250) v_prenex_24) 9))) (let ((.cse41 (div .cse40 5))) (and (< .cse40 0) (< .cse41 278886) (< 0 (+ v_prenex_24 147)) (not (= 0 (mod .cse40 5))) (<= 278887 .cse41) (<= (+ v_prenex_24 98) 0) (<= c_~a0~0 (+ (div (+ .cse41 (- 278886)) 5) 1)) (<= (* 250 v_prenex_24) 0) (not (= (mod (+ .cse41 4) 5) 0)))))) (exists ((v_prenex_31 Int)) (let ((.cse43 (div (* (- 250) v_prenex_31) 9))) (let ((.cse42 (div .cse43 5))) (and (<= (* 250 v_prenex_31) 0) (<= c_~a0~0 (+ (div (+ .cse42 (- 278887)) 5) 1)) (= (mod .cse43 5) 0) (<= (+ v_prenex_31 98) 0) (< 0 (+ v_prenex_31 147)) (<= 278886 .cse42) (not (= (mod (+ .cse42 3) 5) 0)) (< .cse42 278887))))) (exists ((v_prenex_8 Int)) (let ((.cse45 (div (* (- 250) v_prenex_8) 9))) (let ((.cse44 (div .cse45 5))) (and (<= (* 250 v_prenex_8) 0) (<= c_~a0~0 (div (+ .cse44 (- 278887)) 5)) (<= 0 .cse45) (<= (+ v_prenex_8 98) 0) (= 0 (mod (+ .cse44 3) 5)) (< 0 (+ v_prenex_8 147)) (<= 278886 .cse44))))) (exists ((v_prenex_39 Int)) (let ((.cse47 (div (* (- 250) v_prenex_39) 9))) (let ((.cse46 (div .cse47 5))) (and (< 0 (+ v_prenex_39 147)) (= (mod (+ .cse46 3) 5) 0) (not (= 0 (mod .cse47 5))) (not (= 0 (mod (+ .cse46 4) 5))) (< .cse47 0) (<= (+ v_prenex_39 98) 0) (< .cse46 278886) (<= c_~a0~0 (+ (div (+ .cse46 (- 278886)) 5) 1)) (<= (* 250 v_prenex_39) 0))))) (exists ((v_prenex_6 Int)) (let ((.cse49 (div (* (- 250) v_prenex_6) 9))) (let ((.cse48 (div .cse49 5))) (and (< 0 (+ v_prenex_6 147)) (<= (+ v_prenex_6 98) 0) (= 0 (mod (+ .cse48 4) 5)) (<= 0 .cse49) (<= c_~a0~0 (div (+ .cse48 (- 278887)) 5)) (<= (* 250 v_prenex_6) 0) (<= 278887 .cse48))))) (exists ((v_prenex_45 Int)) (let ((.cse51 (div (* (- 250) v_prenex_45) 9))) (let ((.cse50 (div .cse51 5))) (and (= (mod (+ .cse50 4) 5) 0) (= 0 (mod .cse51 5)) (<= (+ v_prenex_45 98) 0) (< 0 (+ v_prenex_45 147)) (<= (* 250 v_prenex_45) 0) (= 0 (mod (+ .cse50 3) 5)) (<= c_~a0~0 (div (+ .cse50 (- 278887)) 5)))))) (exists ((v_prenex_37 Int)) (let ((.cse53 (div (* (- 250) v_prenex_37) 9))) (let ((.cse52 (div .cse53 5))) (and (<= c_~a0~0 (div (+ .cse52 (- 278887)) 5)) (<= (+ v_prenex_37 98) 0) (< 0 (+ v_prenex_37 147)) (< .cse52 278886) (= 0 (mod (+ .cse52 3) 5)) (= (mod .cse53 5) 0) (not (= (mod (+ .cse52 4) 5) 0)) (<= (* 250 v_prenex_37) 0)))))) is different from false [2019-01-12 04:33:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 43 not checked. [2019-01-12 04:33:37,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:33:37,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-12 04:33:37,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:33:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:33:37,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2019-01-12 04:33:37,671 INFO L87 Difference]: Start difference. First operand 19827 states and 21056 transitions. Second operand 7 states. [2019-01-12 04:33:41,943 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ c_~a0~0 147) 0) (or (exists ((v_prenex_41 Int)) (let ((.cse1 (div (* (- 250) v_prenex_41) 9))) (let ((.cse0 (div .cse1 5))) (and (< 0 (+ v_prenex_41 147)) (<= c_~a0~0 (div (+ .cse0 (- 278887)) 5)) (<= (+ v_prenex_41 98) 0) (<= 278887 .cse0) (<= 278886 .cse0) (= (mod .cse1 5) 0) (<= (* 250 v_prenex_41) 0))))) (exists ((v_prenex_49 Int)) (let ((.cse3 (div (* (- 250) v_prenex_49) 9))) (let ((.cse2 (div .cse3 5))) (and (< 0 (+ v_prenex_49 147)) (not (= 0 (mod (+ .cse2 3) 5))) (not (= 0 (mod (+ .cse2 4) 5))) (< .cse2 278886) (< .cse2 278887) (<= c_~a0~0 (+ (div (+ .cse2 (- 278887)) 5) 1)) (<= (* 250 v_prenex_49) 0) (<= (+ v_prenex_49 98) 0) (= 0 (mod .cse3 5)))))) (exists ((v_prenex_47 Int)) (let ((.cse5 (div (* (- 250) v_prenex_47) 9))) (let ((.cse4 (div .cse5 5))) (and (< .cse4 278887) (<= (* 250 v_prenex_47) 0) (not (= 0 (mod (+ .cse4 4) 5))) (< 0 (+ v_prenex_47 147)) (<= (+ v_prenex_47 98) 0) (not (= (mod (+ .cse4 3) 5) 0)) (<= c_~a0~0 (+ (div (+ .cse4 (- 278887)) 5) 1)) (< .cse4 278886) (<= 0 .cse5))))) (exists ((v_prenex_12 Int)) (let ((.cse6 (div (* (- 250) v_prenex_12) 9))) (let ((.cse7 (div .cse6 5))) (and (< .cse6 0) (<= (* 250 v_prenex_12) 0) (= (mod (+ .cse7 4) 5) 0) (<= c_~a0~0 (div (+ .cse7 (- 278886)) 5)) (< 0 (+ v_prenex_12 147)) (not (= 0 (mod .cse6 5))) (= (mod (+ .cse7 3) 5) 0) (<= (+ v_prenex_12 98) 0))))) (exists ((v_prenex_52 Int)) (let ((.cse9 (div (* (- 250) v_prenex_52) 9))) (let ((.cse8 (div .cse9 5))) (and (<= (* 250 v_prenex_52) 0) (<= (+ v_prenex_52 98) 0) (< 0 (+ v_prenex_52 147)) (<= 278887 .cse8) (< .cse8 278886) (= (mod .cse9 5) 0) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (not (= 0 (mod (+ .cse8 4) 5))))))) (exists ((v_prenex_14 Int)) (let ((.cse10 (div (* (- 250) v_prenex_14) 9))) (let ((.cse11 (div .cse10 5))) (and (<= 0 .cse10) (= 0 (mod (+ .cse11 4) 5)) (<= (+ v_prenex_14 98) 0) (<= c_~a0~0 (div (+ .cse11 (- 278887)) 5)) (< 0 (+ v_prenex_14 147)) (<= (* 250 v_prenex_14) 0) (= 0 (mod (+ .cse11 3) 5)))))) (exists ((v_prenex_56 Int)) (let ((.cse13 (div (* (- 250) v_prenex_56) 9))) (let ((.cse12 (div .cse13 5))) (and (<= (+ v_prenex_56 98) 0) (<= c_~a0~0 (div (+ .cse12 (- 278887)) 5)) (<= 278887 .cse12) (not (= 0 (mod (+ .cse12 4) 5))) (< .cse12 278886) (<= 0 .cse13) (< 0 (+ v_prenex_56 147)) (<= (* 250 v_prenex_56) 0))))) (exists ((v_prenex_26 Int)) (let ((.cse14 (div (* (- 250) v_prenex_26) 9))) (let ((.cse15 (div .cse14 5))) (and (< 0 (+ v_prenex_26 147)) (<= 0 .cse14) (<= c_~a0~0 (div (+ .cse15 (- 278887)) 5)) (<= (+ v_prenex_26 98) 0) (<= (* 250 v_prenex_26) 0) (not (= (mod (+ .cse15 4) 5) 0)) (< .cse15 278886) (= (mod (+ .cse15 3) 5) 0))))) (exists ((v_prenex_3 Int)) (let ((.cse17 (div (* (- 250) v_prenex_3) 9))) (let ((.cse16 (div .cse17 5))) (and (<= (* 250 v_prenex_3) 0) (<= 278886 .cse16) (<= (+ v_prenex_3 98) 0) (< 0 (+ v_prenex_3 147)) (= (mod .cse17 5) 0) (= 0 (mod (+ .cse16 3) 5)) (<= c_~a0~0 (div (+ .cse16 (- 278887)) 5)))))) (exists ((v_prenex_43 Int)) (let ((.cse18 (div (* (- 250) v_prenex_43) 9))) (let ((.cse19 (div .cse18 5))) (and (< .cse18 0) (<= c_~a0~0 (div (+ .cse19 (- 278886)) 5)) (<= (* 250 v_prenex_43) 0) (<= 278886 .cse19) (< .cse19 278887) (not (= (mod .cse18 5) 0)) (<= (+ v_prenex_43 98) 0) (< 0 (+ v_prenex_43 147)) (not (= (mod (+ .cse19 3) 5) 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse20 (div (* (- 250) v_prenex_10) 9))) (let ((.cse21 (div .cse20 5))) (and (<= (* 250 v_prenex_10) 0) (= 0 (mod .cse20 5)) (<= (+ v_prenex_10 98) 0) (< .cse21 278887) (< 0 (+ v_prenex_10 147)) (not (= (mod (+ .cse21 3) 5) 0)) (= 0 (mod (+ .cse21 4) 5)) (<= c_~a0~0 (+ (div (+ .cse21 (- 278887)) 5) 1)))))) (exists ((v_prenex_16 Int)) (let ((.cse22 (div (* (- 250) v_prenex_16) 9))) (let ((.cse23 (div .cse22 5))) (and (= 0 (mod .cse22 5)) (<= c_~a0~0 (div (+ .cse23 (- 278887)) 5)) (< 0 (+ v_prenex_16 147)) (<= 278887 .cse23) (= 0 (mod (+ .cse23 4) 5)) (<= (+ v_prenex_16 98) 0) (<= (* 250 v_prenex_16) 0))))) (exists ((v_prenex_35 Int)) (let ((.cse25 (div (* (- 250) v_prenex_35) 9))) (let ((.cse24 (div .cse25 5))) (and (not (= (mod (+ .cse24 3) 5) 0)) (< .cse24 278886) (not (= 0 (mod (+ .cse24 4) 5))) (< 0 (+ v_prenex_35 147)) (not (= (mod .cse25 5) 0)) (<= c_~a0~0 (+ (div (+ .cse24 (- 278886)) 5) 1)) (< .cse24 278887) (< .cse25 0) (<= (* 250 v_prenex_35) 0) (<= (+ v_prenex_35 98) 0))))) (exists ((v_prenex_22 Int)) (let ((.cse27 (div (* (- 250) v_prenex_22) 9))) (let ((.cse26 (div .cse27 5))) (and (<= (* 250 v_prenex_22) 0) (= (mod (+ .cse26 4) 5) 0) (not (= 0 (mod .cse27 5))) (< 0 (+ v_prenex_22 147)) (<= 278887 .cse26) (< .cse27 0) (<= (+ v_prenex_22 98) 0) (<= c_~a0~0 (div (+ .cse26 (- 278886)) 5)))))) (exists ((v_prenex_18 Int)) (let ((.cse29 (div (* (- 250) v_prenex_18) 9))) (let ((.cse28 (div .cse29 5))) (and (< 0 (+ v_prenex_18 147)) (<= 278887 .cse28) (< .cse29 0) (<= 278886 .cse28) (<= (* 250 v_prenex_18) 0) (not (= 0 (mod .cse29 5))) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)) (<= (+ v_prenex_18 98) 0))))) (exists ((v_prenex_54 Int)) (let ((.cse30 (div (* (- 250) v_prenex_54) 9))) (let ((.cse31 (div .cse30 5))) (and (not (= (mod .cse30 5) 0)) (< .cse30 0) (<= (* 250 v_prenex_54) 0) (<= (+ v_prenex_54 98) 0) (<= 278886 .cse31) (< 0 (+ v_prenex_54 147)) (= 0 (mod (+ .cse31 3) 5)) (<= c_~a0~0 (div (+ .cse31 (- 278886)) 5)))))) (exists ((v_prenex_29 Int)) (let ((.cse33 (div (* (- 250) v_prenex_29) 9))) (let ((.cse32 (div .cse33 5))) (and (<= 278887 .cse32) (<= (+ v_prenex_29 98) 0) (< 0 (+ v_prenex_29 147)) (<= 278886 .cse32) (<= c_~a0~0 (div (+ .cse32 (- 278887)) 5)) (<= 0 .cse33) (<= (* 250 v_prenex_29) 0))))) (exists ((v_prenex_20 Int)) (let ((.cse35 (div (* (- 250) v_prenex_20) 9))) (let ((.cse34 (div .cse35 5))) (and (<= (+ v_prenex_20 98) 0) (not (= 0 (mod (+ .cse34 3) 5))) (< 0 (+ v_prenex_20 147)) (< .cse34 278887) (<= (* 250 v_prenex_20) 0) (<= c_~a0~0 (+ (div (+ .cse34 (- 278887)) 5) 1)) (<= 278886 .cse34) (<= 0 .cse35))))) (exists ((v_prenex_27 Int)) (let ((.cse37 (div (* (- 250) v_prenex_27) 9))) (let ((.cse36 (div .cse37 5))) (and (<= c_~a0~0 (+ (div (+ .cse36 (- 278887)) 5) 1)) (= (mod (+ .cse36 4) 5) 0) (not (= (mod (+ .cse36 3) 5) 0)) (< 0 (+ v_prenex_27 147)) (<= (+ v_prenex_27 98) 0) (< .cse36 278887) (<= (* 250 v_prenex_27) 0) (<= 0 .cse37))))) (exists ((v_prenex_33 Int)) (let ((.cse39 (div (* (- 250) v_prenex_33) 9))) (let ((.cse38 (div .cse39 5))) (and (= (mod (+ .cse38 4) 5) 0) (<= c_~a0~0 (div (+ .cse38 (- 278886)) 5)) (not (= (mod (+ .cse38 3) 5) 0)) (not (= 0 (mod .cse39 5))) (<= (+ v_prenex_33 98) 0) (< 0 (+ v_prenex_33 147)) (< .cse38 278887) (<= (* 250 v_prenex_33) 0) (< .cse39 0))))) (exists ((v_prenex_24 Int)) (let ((.cse40 (div (* (- 250) v_prenex_24) 9))) (let ((.cse41 (div .cse40 5))) (and (< .cse40 0) (< .cse41 278886) (< 0 (+ v_prenex_24 147)) (not (= 0 (mod .cse40 5))) (<= 278887 .cse41) (<= (+ v_prenex_24 98) 0) (<= c_~a0~0 (+ (div (+ .cse41 (- 278886)) 5) 1)) (<= (* 250 v_prenex_24) 0) (not (= (mod (+ .cse41 4) 5) 0)))))) (exists ((v_prenex_31 Int)) (let ((.cse43 (div (* (- 250) v_prenex_31) 9))) (let ((.cse42 (div .cse43 5))) (and (<= (* 250 v_prenex_31) 0) (<= c_~a0~0 (+ (div (+ .cse42 (- 278887)) 5) 1)) (= (mod .cse43 5) 0) (<= (+ v_prenex_31 98) 0) (< 0 (+ v_prenex_31 147)) (<= 278886 .cse42) (not (= (mod (+ .cse42 3) 5) 0)) (< .cse42 278887))))) (exists ((v_prenex_8 Int)) (let ((.cse45 (div (* (- 250) v_prenex_8) 9))) (let ((.cse44 (div .cse45 5))) (and (<= (* 250 v_prenex_8) 0) (<= c_~a0~0 (div (+ .cse44 (- 278887)) 5)) (<= 0 .cse45) (<= (+ v_prenex_8 98) 0) (= 0 (mod (+ .cse44 3) 5)) (< 0 (+ v_prenex_8 147)) (<= 278886 .cse44))))) (exists ((v_prenex_39 Int)) (let ((.cse47 (div (* (- 250) v_prenex_39) 9))) (let ((.cse46 (div .cse47 5))) (and (< 0 (+ v_prenex_39 147)) (= (mod (+ .cse46 3) 5) 0) (not (= 0 (mod .cse47 5))) (not (= 0 (mod (+ .cse46 4) 5))) (< .cse47 0) (<= (+ v_prenex_39 98) 0) (< .cse46 278886) (<= c_~a0~0 (+ (div (+ .cse46 (- 278886)) 5) 1)) (<= (* 250 v_prenex_39) 0))))) (exists ((v_prenex_6 Int)) (let ((.cse49 (div (* (- 250) v_prenex_6) 9))) (let ((.cse48 (div .cse49 5))) (and (< 0 (+ v_prenex_6 147)) (<= (+ v_prenex_6 98) 0) (= 0 (mod (+ .cse48 4) 5)) (<= 0 .cse49) (<= c_~a0~0 (div (+ .cse48 (- 278887)) 5)) (<= (* 250 v_prenex_6) 0) (<= 278887 .cse48))))) (exists ((v_prenex_45 Int)) (let ((.cse51 (div (* (- 250) v_prenex_45) 9))) (let ((.cse50 (div .cse51 5))) (and (= (mod (+ .cse50 4) 5) 0) (= 0 (mod .cse51 5)) (<= (+ v_prenex_45 98) 0) (< 0 (+ v_prenex_45 147)) (<= (* 250 v_prenex_45) 0) (= 0 (mod (+ .cse50 3) 5)) (<= c_~a0~0 (div (+ .cse50 (- 278887)) 5)))))) (exists ((v_prenex_37 Int)) (let ((.cse53 (div (* (- 250) v_prenex_37) 9))) (let ((.cse52 (div .cse53 5))) (and (<= c_~a0~0 (div (+ .cse52 (- 278887)) 5)) (<= (+ v_prenex_37 98) 0) (< 0 (+ v_prenex_37 147)) (< .cse52 278886) (= 0 (mod (+ .cse52 3) 5)) (= (mod .cse53 5) 0) (not (= (mod (+ .cse52 4) 5) 0)) (<= (* 250 v_prenex_37) 0))))))) is different from false [2019-01-12 04:33:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:44,755 INFO L93 Difference]: Finished difference Result 44782 states and 47425 transitions. [2019-01-12 04:33:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:33:44,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 697 [2019-01-12 04:33:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:44,781 INFO L225 Difference]: With dead ends: 44782 [2019-01-12 04:33:44,781 INFO L226 Difference]: Without dead ends: 24658 [2019-01-12 04:33:44,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 697 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=16, Invalid=20, Unknown=2, NotChecked=18, Total=56 [2019-01-12 04:33:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24658 states. [2019-01-12 04:33:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24658 to 20769. [2019-01-12 04:33:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20769 states. [2019-01-12 04:33:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20769 states to 20769 states and 22006 transitions. [2019-01-12 04:33:45,076 INFO L78 Accepts]: Start accepts. Automaton has 20769 states and 22006 transitions. Word has length 697 [2019-01-12 04:33:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:45,077 INFO L480 AbstractCegarLoop]: Abstraction has 20769 states and 22006 transitions. [2019-01-12 04:33:45,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:33:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20769 states and 22006 transitions. [2019-01-12 04:33:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2019-01-12 04:33:45,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:45,099 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:33:45,099 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash 328792131, now seen corresponding path program 1 times [2019-01-12 04:33:45,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:45,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:45,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:45,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:45,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 768 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-01-12 04:33:45,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:33:45,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:33:45,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:33:45,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:33:45,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:33:45,651 INFO L87 Difference]: Start difference. First operand 20769 states and 22006 transitions. Second operand 3 states. [2019-01-12 04:33:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:47,519 INFO L93 Difference]: Finished difference Result 41534 states and 43977 transitions. [2019-01-12 04:33:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:33:47,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 785 [2019-01-12 04:33:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:47,535 INFO L225 Difference]: With dead ends: 41534 [2019-01-12 04:33:47,536 INFO L226 Difference]: Without dead ends: 20767 [2019-01-12 04:33:47,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:33:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20767 states. [2019-01-12 04:33:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20767 to 20468. [2019-01-12 04:33:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20468 states. [2019-01-12 04:33:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20468 states to 20468 states and 21666 transitions. [2019-01-12 04:33:47,747 INFO L78 Accepts]: Start accepts. Automaton has 20468 states and 21666 transitions. Word has length 785 [2019-01-12 04:33:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:47,748 INFO L480 AbstractCegarLoop]: Abstraction has 20468 states and 21666 transitions. [2019-01-12 04:33:47,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:33:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 20468 states and 21666 transitions. [2019-01-12 04:33:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-01-12 04:33:47,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:33:47,768 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:33:47,769 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:33:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:33:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash 469290797, now seen corresponding path program 1 times [2019-01-12 04:33:47,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:33:47,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:33:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:47,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:33:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:48,366 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-01-12 04:33:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 842 proven. 87 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-12 04:33:49,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:33:49,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:33:49,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:33:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:33:49,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:33:49,847 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2019-01-12 04:33:50,176 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 04:33:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 1035 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-12 04:33:51,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:33:51,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-01-12 04:33:51,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:33:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:33:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:33:51,075 INFO L87 Difference]: Start difference. First operand 20468 states and 21666 transitions. Second operand 9 states. [2019-01-12 04:34:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:01,995 INFO L93 Difference]: Finished difference Result 49619 states and 52379 transitions. [2019-01-12 04:34:01,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 04:34:01,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 819 [2019-01-12 04:34:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:02,022 INFO L225 Difference]: With dead ends: 49619 [2019-01-12 04:34:02,022 INFO L226 Difference]: Without dead ends: 29153 [2019-01-12 04:34:02,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2019-01-12 04:34:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29153 states. [2019-01-12 04:34:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29153 to 24699. [2019-01-12 04:34:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24699 states. [2019-01-12 04:34:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24699 states to 24699 states and 25831 transitions. [2019-01-12 04:34:02,284 INFO L78 Accepts]: Start accepts. Automaton has 24699 states and 25831 transitions. Word has length 819 [2019-01-12 04:34:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:02,284 INFO L480 AbstractCegarLoop]: Abstraction has 24699 states and 25831 transitions. [2019-01-12 04:34:02,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:34:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24699 states and 25831 transitions. [2019-01-12 04:34:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2019-01-12 04:34:02,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:02,300 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:02,300 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2074746964, now seen corresponding path program 1 times [2019-01-12 04:34:02,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:02,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 726 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2019-01-12 04:34:03,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:03,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:03,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:34:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:34:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:03,413 INFO L87 Difference]: Start difference. First operand 24699 states and 25831 transitions. Second operand 3 states. [2019-01-12 04:34:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:05,348 INFO L93 Difference]: Finished difference Result 43662 states and 45498 transitions. [2019-01-12 04:34:05,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:34:05,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 840 [2019-01-12 04:34:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:05,363 INFO L225 Difference]: With dead ends: 43662 [2019-01-12 04:34:05,363 INFO L226 Difference]: Without dead ends: 16274 [2019-01-12 04:34:05,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16274 states. [2019-01-12 04:34:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16274 to 15676. [2019-01-12 04:34:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15676 states. [2019-01-12 04:34:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15676 states to 15676 states and 16112 transitions. [2019-01-12 04:34:05,520 INFO L78 Accepts]: Start accepts. Automaton has 15676 states and 16112 transitions. Word has length 840 [2019-01-12 04:34:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:05,521 INFO L480 AbstractCegarLoop]: Abstraction has 15676 states and 16112 transitions. [2019-01-12 04:34:05,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:34:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15676 states and 16112 transitions. [2019-01-12 04:34:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2019-01-12 04:34:05,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:05,534 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:05,534 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1893035906, now seen corresponding path program 1 times [2019-01-12 04:34:05,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:05,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:05,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:05,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-01-12 04:34:06,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:06,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:34:06,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:06,476 INFO L87 Difference]: Start difference. First operand 15676 states and 16112 transitions. Second operand 4 states. [2019-01-12 04:34:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:08,614 INFO L93 Difference]: Finished difference Result 34942 states and 35920 transitions. [2019-01-12 04:34:08,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:08,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 881 [2019-01-12 04:34:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:08,635 INFO L225 Difference]: With dead ends: 34942 [2019-01-12 04:34:08,635 INFO L226 Difference]: Without dead ends: 18584 [2019-01-12 04:34:08,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18584 states. [2019-01-12 04:34:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18584 to 13495. [2019-01-12 04:34:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13495 states. [2019-01-12 04:34:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13495 states to 13495 states and 13870 transitions. [2019-01-12 04:34:08,802 INFO L78 Accepts]: Start accepts. Automaton has 13495 states and 13870 transitions. Word has length 881 [2019-01-12 04:34:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:08,802 INFO L480 AbstractCegarLoop]: Abstraction has 13495 states and 13870 transitions. [2019-01-12 04:34:08,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13495 states and 13870 transitions. [2019-01-12 04:34:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2019-01-12 04:34:08,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:08,820 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:08,820 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1673407389, now seen corresponding path program 1 times [2019-01-12 04:34:08,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:08,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:08,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 694 proven. 43 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-01-12 04:34:09,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:34:09,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:34:09,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:09,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:34:14,527 WARN L181 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 135 DAG size of output: 23 [2019-01-12 04:34:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-01-12 04:34:15,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:34:15,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-01-12 04:34:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:34:15,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:34:15,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:34:15,108 INFO L87 Difference]: Start difference. First operand 13495 states and 13870 transitions. Second operand 7 states. [2019-01-12 04:34:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:21,761 INFO L93 Difference]: Finished difference Result 39869 states and 40989 transitions. [2019-01-12 04:34:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:34:21,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 910 [2019-01-12 04:34:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:21,789 INFO L225 Difference]: With dead ends: 39869 [2019-01-12 04:34:21,789 INFO L226 Difference]: Without dead ends: 25778 [2019-01-12 04:34:21,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 913 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:34:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25778 states. [2019-01-12 04:34:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25778 to 16192. [2019-01-12 04:34:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16192 states. [2019-01-12 04:34:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16192 states to 16192 states and 16664 transitions. [2019-01-12 04:34:21,997 INFO L78 Accepts]: Start accepts. Automaton has 16192 states and 16664 transitions. Word has length 910 [2019-01-12 04:34:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:21,997 INFO L480 AbstractCegarLoop]: Abstraction has 16192 states and 16664 transitions. [2019-01-12 04:34:21,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:34:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 16192 states and 16664 transitions. [2019-01-12 04:34:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2019-01-12 04:34:22,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:22,009 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:34:22,009 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1581881062, now seen corresponding path program 1 times [2019-01-12 04:34:22,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2019-01-12 04:34:22,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:22,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:34:22,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:34:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:34:22,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:34:22,729 INFO L87 Difference]: Start difference. First operand 16192 states and 16664 transitions. Second operand 5 states. [2019-01-12 04:34:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:25,697 INFO L93 Difference]: Finished difference Result 40471 states and 41643 transitions. [2019-01-12 04:34:25,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:34:25,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 993 [2019-01-12 04:34:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:25,717 INFO L225 Difference]: With dead ends: 40471 [2019-01-12 04:34:25,717 INFO L226 Difference]: Without dead ends: 23085 [2019-01-12 04:34:25,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:34:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23085 states. [2019-01-12 04:34:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23085 to 18586. [2019-01-12 04:34:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18586 states. [2019-01-12 04:34:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18586 states to 18586 states and 19145 transitions. [2019-01-12 04:34:26,093 INFO L78 Accepts]: Start accepts. Automaton has 18586 states and 19145 transitions. Word has length 993 [2019-01-12 04:34:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:26,094 INFO L480 AbstractCegarLoop]: Abstraction has 18586 states and 19145 transitions. [2019-01-12 04:34:26,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:34:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 18586 states and 19145 transitions. [2019-01-12 04:34:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2019-01-12 04:34:26,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:26,107 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:26,108 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash -312954913, now seen corresponding path program 1 times [2019-01-12 04:34:26,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:26,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:26,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:26,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:26,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 1110 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2019-01-12 04:34:26,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:26,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:26,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:34:26,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:34:26,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:26,747 INFO L87 Difference]: Start difference. First operand 18586 states and 19145 transitions. Second operand 3 states. [2019-01-12 04:34:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:27,966 INFO L93 Difference]: Finished difference Result 37468 states and 38599 transitions. [2019-01-12 04:34:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:34:27,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1060 [2019-01-12 04:34:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:27,983 INFO L225 Difference]: With dead ends: 37468 [2019-01-12 04:34:27,983 INFO L226 Difference]: Without dead ends: 18884 [2019-01-12 04:34:27,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18884 states. [2019-01-12 04:34:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18884 to 18585. [2019-01-12 04:34:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18585 states. [2019-01-12 04:34:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18585 states to 18585 states and 19143 transitions. [2019-01-12 04:34:28,181 INFO L78 Accepts]: Start accepts. Automaton has 18585 states and 19143 transitions. Word has length 1060 [2019-01-12 04:34:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:28,182 INFO L480 AbstractCegarLoop]: Abstraction has 18585 states and 19143 transitions. [2019-01-12 04:34:28,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:34:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 18585 states and 19143 transitions. [2019-01-12 04:34:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2019-01-12 04:34:28,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:28,198 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:28,198 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:28,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1386744063, now seen corresponding path program 1 times [2019-01-12 04:34:28,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:28,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:28,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 1403 proven. 102 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-01-12 04:34:30,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:34:30,443 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 04:34:30,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:30,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:34:33,741 WARN L181 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 135 DAG size of output: 23 [2019-01-12 04:34:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2019-01-12 04:34:34,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:34:34,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-01-12 04:34:34,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 04:34:34,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 04:34:34,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:34:34,514 INFO L87 Difference]: Start difference. First operand 18585 states and 19143 transitions. Second operand 12 states. [2019-01-12 04:34:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:50,815 INFO L93 Difference]: Finished difference Result 44108 states and 45388 transitions. [2019-01-12 04:34:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 04:34:50,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1081 [2019-01-12 04:34:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:50,844 INFO L225 Difference]: With dead ends: 44108 [2019-01-12 04:34:50,844 INFO L226 Difference]: Without dead ends: 24927 [2019-01-12 04:34:50,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1091 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-01-12 04:34:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24927 states. [2019-01-12 04:34:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24927 to 15593. [2019-01-12 04:34:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15593 states. [2019-01-12 04:34:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15593 states to 15593 states and 15839 transitions. [2019-01-12 04:34:51,103 INFO L78 Accepts]: Start accepts. Automaton has 15593 states and 15839 transitions. Word has length 1081 [2019-01-12 04:34:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:51,104 INFO L480 AbstractCegarLoop]: Abstraction has 15593 states and 15839 transitions. [2019-01-12 04:34:51,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 04:34:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 15593 states and 15839 transitions. [2019-01-12 04:34:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1613 [2019-01-12 04:34:51,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:51,137 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:51,138 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:51,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1134681110, now seen corresponding path program 1 times [2019-01-12 04:34:51,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:51,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:51,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4176 backedges. 2805 proven. 0 refuted. 0 times theorem prover too weak. 1371 trivial. 0 not checked. [2019-01-12 04:34:52,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:52,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:34:52,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:52,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:52,472 INFO L87 Difference]: Start difference. First operand 15593 states and 15839 transitions. Second operand 4 states. [2019-01-12 04:34:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:54,293 INFO L93 Difference]: Finished difference Result 30586 states and 31073 transitions. [2019-01-12 04:34:54,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:54,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1612 [2019-01-12 04:34:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:54,295 INFO L225 Difference]: With dead ends: 30586 [2019-01-12 04:34:54,295 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:34:54,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:34:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:34:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:34:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:34:54,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1612 [2019-01-12 04:34:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:54,304 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:34:54,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:34:54,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:34:54,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:34:54,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:54,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:55,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:55,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:55,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:55,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:55,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:55,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:56,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:56,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:56,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:56,807 WARN L181 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 1558 DAG size of output: 768 [2019-01-12 04:34:56,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:56,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:56,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:56,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:57,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,192 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 1558 DAG size of output: 768 [2019-01-12 04:34:58,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:34:58,870 WARN L181 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 667 DAG size of output: 566 [2019-01-12 04:35:07,894 WARN L181 SmtUtils]: Spent 9.02 s on a formula simplification. DAG size of input: 725 DAG size of output: 159 [2019-01-12 04:35:16,502 WARN L181 SmtUtils]: Spent 8.60 s on a formula simplification. DAG size of input: 725 DAG size of output: 159 [2019-01-12 04:35:22,049 WARN L181 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 543 DAG size of output: 155 [2019-01-12 04:35:22,056 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,056 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,056 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,056 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,056 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:35:22,056 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,056 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,056 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:35:22,057 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,058 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,059 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,060 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:35:22,061 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,062 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,063 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,064 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,065 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,066 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,067 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,068 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,069 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:35:22,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:35:22,071 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,072 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,073 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:35:22,074 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:35:22,074 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:35:22,074 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:35:22,074 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,074 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,074 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,074 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,075 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse37 (+ ~a4~0 86))) (let ((.cse11 (<= .cse37 0)) (.cse2 (< 0 (+ ~a29~0 144)))) (let ((.cse17 (= ~a2~0 3)) (.cse35 (+ ~a4~0 42)) (.cse22 (and .cse11 .cse2)) (.cse1 (= ~a2~0 1)) (.cse31 (+ ~a0~0 98))) (let ((.cse10 (not (= 1 ~a2~0))) (.cse3 (< 0 .cse31)) (.cse27 (and .cse22 .cse1)) (.cse5 (<= (+ ~a0~0 44) 0)) (.cse12 (= ~a2~0 5)) (.cse33 (+ ~a29~0 16)) (.cse24 (<= ~a29~0 43)) (.cse0 (<= .cse35 0)) (.cse23 (= ~a2~0 4)) (.cse30 (< 0 .cse37)) (.cse7 (<= (+ ~a0~0 147) 0)) (.cse32 (not .cse17))) (let ((.cse8 (and .cse2 .cse7 .cse32)) (.cse14 (exists ((v_prenex_65 Int)) (let ((.cse36 (div v_prenex_65 5))) (and (< .cse36 278887) (<= 0 v_prenex_65) (<= ~a0~0 (+ (div (+ .cse36 (- 278887)) 5) 1)) (<= v_prenex_65 599946) (not (= (mod (+ .cse36 3) 5) 0)))))) (.cse18 (<= ~a0~0 599920)) (.cse25 (and (let ((.cse34 (or .cse11 (< 0 .cse35) (not (= 1 ULTIMATE.start_calculate_output_~input))))) (or (and .cse0 .cse34 .cse23 .cse24) (and .cse0 .cse34 .cse23 .cse30))) .cse7)) (.cse4 (or .cse12 (<= .cse33 0))) (.cse21 (or (and .cse1 .cse11 .cse3 .cse5) (and .cse27 .cse5))) (.cse26 (< 43 ~a29~0)) (.cse6 (= ~a2~0 2)) (.cse13 (<= 38763 ~a29~0)) (.cse16 (<= (+ ~a29~0 145) 0)) (.cse19 (<= ~a0~0 599946)) (.cse15 (< 0 .cse33)) (.cse20 (and .cse22 .cse32 .cse10)) (.cse9 (<= .cse31 0)) (.cse29 (<= 0 (+ ~a0~0 146)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7) (and .cse6 .cse8) (and .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse7 (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse13) (and (and .cse0 .cse14 .cse1) .cse15) (and .cse16 .cse17 .cse11 .cse18) (and .cse8 .cse0 .cse12 .cse14) (and .cse12 (and .cse19 .cse20) .cse13) (and .cse9 .cse15 .cse0 .cse6) (and .cse9 .cse0 .cse17) (and .cse16 .cse21) (and (and .cse22 .cse23 .cse24) (<= ~a0~0 599999)) (and .cse7 .cse11) (and .cse0 .cse1 .cse2 (<= (+ ~a0~0 300073) 0)) (and .cse25 .cse26) (and (and .cse16 .cse23 .cse11) .cse18) (and .cse24 .cse27 .cse5) (and (exists ((v_prenex_69 Int)) (let ((.cse28 (div v_prenex_69 5))) (and (< .cse28 278887) (<= ~a0~0 (+ (div (+ .cse28 (- 278887)) 5) 1)) (<= v_prenex_69 599999) (not (= 0 (mod (+ .cse28 3) 5))) (<= 0 v_prenex_69)))) .cse25 .cse4) (and .cse22 .cse17 .cse5) (and .cse9 .cse21) (and .cse0 (and .cse1 .cse7) .cse26) (and (and .cse6 .cse11) .cse19) (and .cse9 .cse0 .cse12 .cse29 .cse13) (and .cse15 (and .cse17 .cse19 .cse11)) (and .cse1 .cse16 .cse19 (<= 0 ~a0~0) .cse11) (and .cse15 (and .cse12 (<= ~a0~0 599976) (and .cse24 .cse20))) (and .cse9 .cse24 .cse0 .cse2 .cse12 .cse29) (and .cse9 .cse30 .cse0 .cse1 .cse29))))))) [2019-01-12 04:35:22,075 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:35:22,075 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:35:22,075 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,075 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,075 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,075 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,075 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:35:22,076 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,077 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,078 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,078 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,078 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,078 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse37 (+ ~a4~0 86))) (let ((.cse27 (= ~a2~0 3)) (.cse34 (+ ~a0~0 147)) (.cse15 (<= .cse37 0)) (.cse10 (< 0 (+ ~a29~0 144)))) (let ((.cse26 (and .cse15 .cse10)) (.cse9 (= ~a2~0 1)) (.cse13 (<= (+ ~a0~0 44) 0)) (.cse32 (+ ~a0~0 98)) (.cse5 (<= .cse34 0)) (.cse36 (not .cse27))) (let ((.cse18 (= ~a2~0 5)) (.cse31 (< 0 .cse37)) (.cse19 (and .cse10 .cse5 .cse36)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse2 (= ~a2~0 4)) (.cse21 (<= ~a29~0 43)) (.cse33 (+ ~a29~0 16)) (.cse14 (not (= 1 ~a2~0))) (.cse11 (< 0 .cse32)) (.cse28 (and (and .cse26 .cse9) .cse13))) (let ((.cse7 (or (and .cse9 .cse15 .cse11 .cse13) .cse28)) (.cse17 (< 43 ~a29~0)) (.cse20 (and .cse26 .cse36 .cse14)) (.cse8 (< 0 .cse33)) (.cse3 (exists ((v_prenex_65 Int)) (let ((.cse35 (div v_prenex_65 5))) (and (< .cse35 278887) (<= 0 v_prenex_65) (<= ~a0~0 (+ (div (+ .cse35 (- 278887)) 5) 1)) (<= v_prenex_65 599946) (not (= (mod (+ .cse35 3) 5) 0)))))) (.cse1 (<= (+ ~a29~0 145) 0)) (.cse24 (and .cse27 .cse15)) (.cse25 (<= ~a0~0 599920)) (.cse4 (= ~a2~0 2)) (.cse22 (<= ~a0~0 599946)) (.cse16 (or (and .cse0 .cse2 (and .cse31 .cse19)) (and .cse0 (or .cse15 (< 0 .cse34) (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse2 .cse21))) (.cse12 (or .cse18 (<= .cse33 0))) (.cse23 (<= 38763 ~a29~0)) (.cse6 (<= .cse32 0)) (.cse30 (<= 0 (+ ~a0~0 146)))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse0 .cse4 .cse5) (and .cse6 .cse7) (and .cse6 .cse8 .cse0 .cse4) (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7) (and .cse6 .cse14 .cse15) (and .cse16 .cse17) (and .cse18 .cse3 (and .cse0 .cse19)) (and .cse8 (and (and .cse20 .cse21) .cse18 (<= ~a0~0 599976))) (and .cse0 (and .cse9 .cse5) .cse17) (and .cse4 .cse19) (and .cse18 (and .cse20 .cse22) .cse23) (and .cse8 (and .cse24 .cse22)) (and (and .cse9 .cse1 .cse15) .cse22 (<= 0 ~a0~0)) (and .cse8 (and .cse0 .cse9 .cse3)) (and .cse5 .cse15) (and (and .cse1 .cse2 .cse15) .cse25) (and .cse0 .cse9 .cse10 (<= (+ ~a0~0 300073) 0)) (and (and .cse2 .cse21 .cse26) (<= ~a0~0 599999)) (and .cse6 (and .cse0 .cse27)) (and (and .cse1 .cse24) .cse25) (and .cse28 .cse21) (and .cse4 .cse22 .cse15) (and .cse26 .cse27 .cse13) (and .cse16 (exists ((v_prenex_69 Int)) (let ((.cse29 (div v_prenex_69 5))) (and (< .cse29 278887) (<= ~a0~0 (+ (div (+ .cse29 (- 278887)) 5) 1)) (<= v_prenex_69 599999) (not (= 0 (mod (+ .cse29 3) 5))) (<= 0 v_prenex_69)))) .cse12) (or (and .cse6 .cse0 .cse18 .cse23) (and .cse6 .cse21 .cse0 .cse10 .cse18 .cse30)) (and .cse6 .cse31 .cse0 .cse9 .cse30))))))) [2019-01-12 04:35:22,078 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,079 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:35:22,079 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:35:22,084 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,085 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,086 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,087 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:35:22,088 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,089 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:35:22,089 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:35:22,089 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,089 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,089 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,089 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,089 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,089 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,090 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse37 (+ ~a4~0 86))) (let ((.cse27 (= ~a2~0 3)) (.cse34 (+ ~a0~0 147)) (.cse15 (<= .cse37 0)) (.cse10 (< 0 (+ ~a29~0 144)))) (let ((.cse26 (and .cse15 .cse10)) (.cse9 (= ~a2~0 1)) (.cse13 (<= (+ ~a0~0 44) 0)) (.cse32 (+ ~a0~0 98)) (.cse5 (<= .cse34 0)) (.cse36 (not .cse27))) (let ((.cse18 (= ~a2~0 5)) (.cse31 (< 0 .cse37)) (.cse19 (and .cse10 .cse5 .cse36)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse2 (= ~a2~0 4)) (.cse21 (<= ~a29~0 43)) (.cse33 (+ ~a29~0 16)) (.cse14 (not (= 1 ~a2~0))) (.cse11 (< 0 .cse32)) (.cse28 (and (and .cse26 .cse9) .cse13))) (let ((.cse7 (or (and .cse9 .cse15 .cse11 .cse13) .cse28)) (.cse17 (< 43 ~a29~0)) (.cse20 (and .cse26 .cse36 .cse14)) (.cse8 (< 0 .cse33)) (.cse3 (exists ((v_prenex_65 Int)) (let ((.cse35 (div v_prenex_65 5))) (and (< .cse35 278887) (<= 0 v_prenex_65) (<= ~a0~0 (+ (div (+ .cse35 (- 278887)) 5) 1)) (<= v_prenex_65 599946) (not (= (mod (+ .cse35 3) 5) 0)))))) (.cse1 (<= (+ ~a29~0 145) 0)) (.cse24 (and .cse27 .cse15)) (.cse25 (<= ~a0~0 599920)) (.cse4 (= ~a2~0 2)) (.cse22 (<= ~a0~0 599946)) (.cse16 (or (and .cse0 .cse2 (and .cse31 .cse19)) (and .cse0 (or .cse15 (< 0 .cse34) (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse2 .cse21))) (.cse12 (or .cse18 (<= .cse33 0))) (.cse23 (<= 38763 ~a29~0)) (.cse6 (<= .cse32 0)) (.cse30 (<= 0 (+ ~a0~0 146)))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse0 .cse4 .cse5) (and .cse6 .cse7) (and .cse6 .cse8 .cse0 .cse4) (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7) (and .cse6 .cse14 .cse15) (and .cse16 .cse17) (and .cse18 .cse3 (and .cse0 .cse19)) (and .cse8 (and (and .cse20 .cse21) .cse18 (<= ~a0~0 599976))) (and .cse0 (and .cse9 .cse5) .cse17) (and .cse4 .cse19) (and .cse18 (and .cse20 .cse22) .cse23) (and .cse8 (and .cse24 .cse22)) (and (and .cse9 .cse1 .cse15) .cse22 (<= 0 ~a0~0)) (and .cse8 (and .cse0 .cse9 .cse3)) (and .cse5 .cse15) (and (and .cse1 .cse2 .cse15) .cse25) (and .cse0 .cse9 .cse10 (<= (+ ~a0~0 300073) 0)) (and (and .cse2 .cse21 .cse26) (<= ~a0~0 599999)) (and .cse6 (and .cse0 .cse27)) (and (and .cse1 .cse24) .cse25) (and .cse28 .cse21) (and .cse4 .cse22 .cse15) (and .cse26 .cse27 .cse13) (and .cse16 (exists ((v_prenex_69 Int)) (let ((.cse29 (div v_prenex_69 5))) (and (< .cse29 278887) (<= ~a0~0 (+ (div (+ .cse29 (- 278887)) 5) 1)) (<= v_prenex_69 599999) (not (= 0 (mod (+ .cse29 3) 5))) (<= 0 v_prenex_69)))) .cse12) (or (and .cse6 .cse0 .cse18 .cse23) (and .cse6 .cse21 .cse0 .cse10 .cse18 .cse30)) (and .cse6 .cse31 .cse0 .cse9 .cse30))))))) [2019-01-12 04:35:22,090 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:35:22,090 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:35:22,090 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,090 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2019-01-12 04:35:22,090 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,090 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,090 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,090 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,091 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,092 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:35:22,093 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,101 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,102 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,103 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,104 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,105 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,105 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,106 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:35:22,107 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:35:22,108 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:35:22,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:35:22 BoogieIcfgContainer [2019-01-12 04:35:22,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:35:22,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:35:22,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:35:22,263 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:35:22,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:32:20" (3/4) ... [2019-01-12 04:35:22,271 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:35:22,339 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:35:22,348 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:35:22,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a29 + 145 <= 0) && a2 == 4) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0)) || (a0 + 98 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && a4 + 42 <= 0) && a2 == 2)) || (((((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 < a0 + 98) && (a2 == 5 || a29 + 16 <= 0)) && a0 + 44 <= 0)) || (a29 + 145 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || ((a0 + 98 <= 0 && !(1 == a2)) && a4 + 86 <= 0)) || ((((a4 + 42 <= 0 && a2 == 4) && 0 < a4 + 86 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a0 + 147) || !(1 == input))) && a2 == 4) && a29 <= 43)) && 43 < a29)) || ((a2 == 5 && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) && a4 + 42 <= 0 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || (0 < a29 + 16 && (((((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && a29 <= 43) && a2 == 5) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (a2 == 2 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || ((a2 == 5 && (((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && a0 <= 599946) && 38763 <= a29)) || (0 < a29 + 16 && (a2 == 3 && a4 + 86 <= 0) && a0 <= 599946)) || ((((a2 == 1 && a29 + 145 <= 0) && a4 + 86 <= 0) && a0 <= 599946) && 0 <= a0)) || (0 < a29 + 16 && (a4 + 42 <= 0 && a2 == 1) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a29 + 145 <= 0 && a2 == 4) && a4 + 86 <= 0) && a0 <= 599920)) || (((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && a0 + 300073 <= 0)) || (((a2 == 4 && a29 <= 43) && a4 + 86 <= 0 && 0 < a29 + 144) && a0 <= 599999)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || ((a29 + 145 <= 0 && a2 == 3 && a4 + 86 <= 0) && a0 <= 599920)) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a29 <= 43)) || ((a2 == 2 && a0 <= 599946) && a4 + 86 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 3) && a0 + 44 <= 0)) || (((((a4 + 42 <= 0 && a2 == 4) && 0 < a4 + 86 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a0 + 147) || !(1 == input))) && a2 == 4) && a29 <= 43)) && (\exists v_prenex_69 : int :: (((v_prenex_69 / 5 < 278887 && a0 <= (v_prenex_69 / 5 + -278887) / 5 + 1) && v_prenex_69 <= 599999) && !(0 == (v_prenex_69 / 5 + 3) % 5)) && 0 <= v_prenex_69)) && (a2 == 5 || a29 + 16 <= 0))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 38763 <= a29) || (((((a0 + 98 <= 0 && a29 <= 43) && a4 + 42 <= 0) && 0 < a29 + 144) && a2 == 5) && 0 <= a0 + 146)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) [2019-01-12 04:35:22,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a29 + 145 <= 0) && a2 == 4) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0)) || (a0 + 98 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && a4 + 42 <= 0) && a2 == 2)) || (((((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 < a0 + 98) && (a2 == 5 || a29 + 16 <= 0)) && a0 + 44 <= 0)) || (a29 + 145 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || ((a0 + 98 <= 0 && !(1 == a2)) && a4 + 86 <= 0)) || ((((a4 + 42 <= 0 && a2 == 4) && 0 < a4 + 86 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a0 + 147) || !(1 == input))) && a2 == 4) && a29 <= 43)) && 43 < a29)) || ((a2 == 5 && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) && a4 + 42 <= 0 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || (0 < a29 + 16 && (((((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && a29 <= 43) && a2 == 5) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (a2 == 2 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || ((a2 == 5 && (((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && a0 <= 599946) && 38763 <= a29)) || (0 < a29 + 16 && (a2 == 3 && a4 + 86 <= 0) && a0 <= 599946)) || ((((a2 == 1 && a29 + 145 <= 0) && a4 + 86 <= 0) && a0 <= 599946) && 0 <= a0)) || (0 < a29 + 16 && (a4 + 42 <= 0 && a2 == 1) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a29 + 145 <= 0 && a2 == 4) && a4 + 86 <= 0) && a0 <= 599920)) || (((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && a0 + 300073 <= 0)) || (((a2 == 4 && a29 <= 43) && a4 + 86 <= 0 && 0 < a29 + 144) && a0 <= 599999)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || ((a29 + 145 <= 0 && a2 == 3 && a4 + 86 <= 0) && a0 <= 599920)) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a29 <= 43)) || ((a2 == 2 && a0 <= 599946) && a4 + 86 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 3) && a0 + 44 <= 0)) || (((((a4 + 42 <= 0 && a2 == 4) && 0 < a4 + 86 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a0 + 147) || !(1 == input))) && a2 == 4) && a29 <= 43)) && (\exists v_prenex_69 : int :: (((v_prenex_69 / 5 < 278887 && a0 <= (v_prenex_69 / 5 + -278887) / 5 + 1) && v_prenex_69 <= 599999) && !(0 == (v_prenex_69 / 5 + 3) % 5)) && 0 <= v_prenex_69)) && (a2 == 5 || a29 + 16 <= 0))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 38763 <= a29) || (((((a0 + 98 <= 0 && a29 <= 43) && a4 + 42 <= 0) && 0 < a29 + 144) && a2 == 5) && 0 <= a0 + 146)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) [2019-01-12 04:35:22,435 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 < a0 + 98) && (a2 == 5 || a29 + 16 <= 0)) && a0 + 44 <= 0) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0)) || (a2 == 2 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || ((a0 + 98 <= 0 && !(1 == a2)) && a4 + 86 <= 0)) || ((((a4 + 42 <= 0 && a2 == 5) && a0 + 147 <= 0) && !(4 == input)) && 38763 <= a29)) || (((a4 + 42 <= 0 && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) && a2 == 1) && 0 < a29 + 16)) || (((a29 + 145 <= 0 && a2 == 3) && a4 + 86 <= 0) && a0 <= 599920)) || (((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && a4 + 42 <= 0) && a2 == 5) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0)))) || ((a2 == 5 && a0 <= 599946 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && 38763 <= a29)) || (((a0 + 98 <= 0 && 0 < a29 + 16) && a4 + 42 <= 0) && a2 == 2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 3)) || (a29 + 145 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 4) && a29 <= 43) && a0 <= 599999)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a4 + 42) || !(1 == input))) && a2 == 4) && a29 <= 43) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a4 + 42) || !(1 == input))) && a2 == 4) && 0 < a4 + 86)) && a0 + 147 <= 0) && 43 < a29)) || (((a29 + 145 <= 0 && a2 == 4) && a4 + 86 <= 0) && a0 <= 599920)) || ((a29 <= 43 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)) || (((\exists v_prenex_69 : int :: (((v_prenex_69 / 5 < 278887 && a0 <= (v_prenex_69 / 5 + -278887) / 5 + 1) && v_prenex_69 <= 599999) && !(0 == (v_prenex_69 / 5 + 3) % 5)) && 0 <= v_prenex_69) && ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a4 + 42) || !(1 == input))) && a2 == 4) && a29 <= 43) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a4 + 42) || !(1 == input))) && a2 == 4) && 0 < a4 + 86)) && a0 + 147 <= 0) && (a2 == 5 || a29 + 16 <= 0))) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 3) && a0 + 44 <= 0)) || (a0 + 98 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || ((a2 == 2 && a4 + 86 <= 0) && a0 <= 599946)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 0 <= a0 + 146) && 38763 <= a29)) || (0 < a29 + 16 && (a2 == 3 && a0 <= 599946) && a4 + 86 <= 0)) || ((((a2 == 1 && a29 + 145 <= 0) && a0 <= 599946) && 0 <= a0) && a4 + 86 <= 0)) || (0 < a29 + 16 && (a2 == 5 && a0 <= 599976) && a29 <= 43 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2))) || (((((a0 + 98 <= 0 && a29 <= 43) && a4 + 42 <= 0) && 0 < a29 + 144) && a2 == 5) && 0 <= a0 + 146)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) [2019-01-12 04:35:22,641 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:35:22,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:35:22,643 INFO L168 Benchmark]: Toolchain (without parser) took 190550.29 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 946.0 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-12 04:35:22,644 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:35:22,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1555.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 139.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:35:22,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 238.77 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: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:35:22,644 INFO L168 Benchmark]: Boogie Preprocessor took 267.42 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:35:22,647 INFO L168 Benchmark]: RCFGBuilder took 6296.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -125.7 MB). Peak memory consumption was 311.9 MB. Max. memory is 11.5 GB. [2019-01-12 04:35:22,648 INFO L168 Benchmark]: TraceAbstraction took 181808.47 ms. Allocated memory was 1.3 GB in the beginning and 4.4 GB in the end (delta: 3.1 GB). Free memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-01-12 04:35:22,648 INFO L168 Benchmark]: Witness Printer took 377.93 ms. Allocated memory is still 4.4 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. [2019-01-12 04:35:22,653 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.16 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 1555.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -200.0 MB). Peak memory consumption was 139.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 238.77 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: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 267.42 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6296.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -125.7 MB). Peak memory consumption was 311.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 181808.47 ms. Allocated memory was 1.3 GB in the beginning and 4.4 GB in the end (delta: 3.1 GB). Free memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 377.93 ms. Allocated memory is still 4.4 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 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_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 142]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-01-12 04:35:22,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,682 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a29 + 145 <= 0) && a2 == 4) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0)) || (a0 + 98 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && a4 + 42 <= 0) && a2 == 2)) || (((((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 < a0 + 98) && (a2 == 5 || a29 + 16 <= 0)) && a0 + 44 <= 0)) || (a29 + 145 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || ((a0 + 98 <= 0 && !(1 == a2)) && a4 + 86 <= 0)) || ((((a4 + 42 <= 0 && a2 == 4) && 0 < a4 + 86 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a0 + 147) || !(1 == input))) && a2 == 4) && a29 <= 43)) && 43 < a29)) || ((a2 == 5 && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) && a4 + 42 <= 0 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || (0 < a29 + 16 && (((((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && a29 <= 43) && a2 == 5) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (a2 == 2 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || ((a2 == 5 && (((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && a0 <= 599946) && 38763 <= a29)) || (0 < a29 + 16 && (a2 == 3 && a4 + 86 <= 0) && a0 <= 599946)) || ((((a2 == 1 && a29 + 145 <= 0) && a4 + 86 <= 0) && a0 <= 599946) && 0 <= a0)) || (0 < a29 + 16 && (a4 + 42 <= 0 && a2 == 1) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a29 + 145 <= 0 && a2 == 4) && a4 + 86 <= 0) && a0 <= 599920)) || (((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && a0 + 300073 <= 0)) || (((a2 == 4 && a29 <= 43) && a4 + 86 <= 0 && 0 < a29 + 144) && a0 <= 599999)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || ((a29 + 145 <= 0 && a2 == 3 && a4 + 86 <= 0) && a0 <= 599920)) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a29 <= 43)) || ((a2 == 2 && a0 <= 599946) && a4 + 86 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 3) && a0 + 44 <= 0)) || (((((a4 + 42 <= 0 && a2 == 4) && 0 < a4 + 86 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a0 + 147) || !(1 == input))) && a2 == 4) && a29 <= 43)) && (\exists v_prenex_69 : int :: (((v_prenex_69 / 5 < 278887 && a0 <= (v_prenex_69 / 5 + -278887) / 5 + 1) && v_prenex_69 <= 599999) && !(0 == (v_prenex_69 / 5 + 3) % 5)) && 0 <= v_prenex_69)) && (a2 == 5 || a29 + 16 <= 0))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 38763 <= a29) || (((((a0 + 98 <= 0 && a29 <= 43) && a4 + 42 <= 0) && 0 < a29 + 144) && a2 == 5) && 0 <= a0 + 146)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:35:22,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,703 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,703 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,703 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a29 + 145 <= 0) && a2 == 4) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0)) || (a0 + 98 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && a4 + 42 <= 0) && a2 == 2)) || (((((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 < a0 + 98) && (a2 == 5 || a29 + 16 <= 0)) && a0 + 44 <= 0)) || (a29 + 145 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || ((a0 + 98 <= 0 && !(1 == a2)) && a4 + 86 <= 0)) || ((((a4 + 42 <= 0 && a2 == 4) && 0 < a4 + 86 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a0 + 147) || !(1 == input))) && a2 == 4) && a29 <= 43)) && 43 < a29)) || ((a2 == 5 && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) && a4 + 42 <= 0 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || (0 < a29 + 16 && (((((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && a29 <= 43) && a2 == 5) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (a2 == 2 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || ((a2 == 5 && (((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && a0 <= 599946) && 38763 <= a29)) || (0 < a29 + 16 && (a2 == 3 && a4 + 86 <= 0) && a0 <= 599946)) || ((((a2 == 1 && a29 + 145 <= 0) && a4 + 86 <= 0) && a0 <= 599946) && 0 <= a0)) || (0 < a29 + 16 && (a4 + 42 <= 0 && a2 == 1) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a29 + 145 <= 0 && a2 == 4) && a4 + 86 <= 0) && a0 <= 599920)) || (((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && a0 + 300073 <= 0)) || (((a2 == 4 && a29 <= 43) && a4 + 86 <= 0 && 0 < a29 + 144) && a0 <= 599999)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || ((a29 + 145 <= 0 && a2 == 3 && a4 + 86 <= 0) && a0 <= 599920)) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a29 <= 43)) || ((a2 == 2 && a0 <= 599946) && a4 + 86 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 3) && a0 + 44 <= 0)) || (((((a4 + 42 <= 0 && a2 == 4) && 0 < a4 + 86 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a0 + 147) || !(1 == input))) && a2 == 4) && a29 <= 43)) && (\exists v_prenex_69 : int :: (((v_prenex_69 / 5 < 278887 && a0 <= (v_prenex_69 / 5 + -278887) / 5 + 1) && v_prenex_69 <= 599999) && !(0 == (v_prenex_69 / 5 + 3) % 5)) && 0 <= v_prenex_69)) && (a2 == 5 || a29 + 16 <= 0))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 38763 <= a29) || (((((a0 + 98 <= 0 && a29 <= 43) && a4 + 42 <= 0) && 0 < a29 + 144) && a2 == 5) && 0 <= a0 + 146)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) - InvariantResult [Line: 1658]: Loop Invariant [2019-01-12 04:35:22,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-01-12 04:35:22,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 04:35:22,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 < a0 + 98) && (a2 == 5 || a29 + 16 <= 0)) && a0 + 44 <= 0) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0)) || (a2 == 2 && (0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3))) || ((a0 + 98 <= 0 && !(1 == a2)) && a4 + 86 <= 0)) || ((((a4 + 42 <= 0 && a2 == 5) && a0 + 147 <= 0) && !(4 == input)) && 38763 <= a29)) || (((a4 + 42 <= 0 && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0))) && a2 == 1) && 0 < a29 + 16)) || (((a29 + 145 <= 0 && a2 == 3) && a4 + 86 <= 0) && a0 <= 599920)) || (((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && a4 + 42 <= 0) && a2 == 5) && (\exists v_prenex_65 : int :: (((v_prenex_65 / 5 < 278887 && 0 <= v_prenex_65) && a0 <= (v_prenex_65 / 5 + -278887) / 5 + 1) && v_prenex_65 <= 599946) && !((v_prenex_65 / 5 + 3) % 5 == 0)))) || ((a2 == 5 && a0 <= 599946 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2)) && 38763 <= a29)) || (((a0 + 98 <= 0 && 0 < a29 + 16) && a4 + 42 <= 0) && a2 == 2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 3)) || (a29 + 145 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 4) && a29 <= 43) && a0 <= 599999)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && a2 == 1) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a4 + 42) || !(1 == input))) && a2 == 4) && a29 <= 43) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a4 + 42) || !(1 == input))) && a2 == 4) && 0 < a4 + 86)) && a0 + 147 <= 0) && 43 < a29)) || (((a29 + 145 <= 0 && a2 == 4) && a4 + 86 <= 0) && a0 <= 599920)) || ((a29 <= 43 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)) || (((\exists v_prenex_69 : int :: (((v_prenex_69 / 5 < 278887 && a0 <= (v_prenex_69 / 5 + -278887) / 5 + 1) && v_prenex_69 <= 599999) && !(0 == (v_prenex_69 / 5 + 3) % 5)) && 0 <= v_prenex_69) && ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a4 + 42) || !(1 == input))) && a2 == 4) && a29 <= 43) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || 0 < a4 + 42) || !(1 == input))) && a2 == 4) && 0 < a4 + 86)) && a0 + 147 <= 0) && (a2 == 5 || a29 + 16 <= 0))) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 3) && a0 + 44 <= 0)) || (a0 + 98 <= 0 && ((((a2 == 1 && a4 + 86 <= 0) && 0 < a0 + 98) && a0 + 44 <= 0) || (((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0)))) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || ((a2 == 2 && a4 + 86 <= 0) && a0 <= 599946)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 0 <= a0 + 146) && 38763 <= a29)) || (0 < a29 + 16 && (a2 == 3 && a0 <= 599946) && a4 + 86 <= 0)) || ((((a2 == 1 && a29 + 145 <= 0) && a0 <= 599946) && 0 <= a0) && a4 + 86 <= 0)) || (0 < a29 + 16 && (a2 == 5 && a0 <= 599976) && a29 <= 43 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && !(1 == a2))) || (((((a0 + 98 <= 0 && a29 <= 43) && a4 + 42 <= 0) && 0 < a29 + 144) && a2 == 5) && 0 <= a0 + 146)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 181.5s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 107.5s AutomataDifference, 0.0s DeadEndRemovalTime, 27.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 3364 SDtfs, 21319 SDslu, 1715 SDs, 0 SdLazy, 56358 SolverSat, 6917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4329 GetRequests, 4206 SyntacticMatches, 12 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24699occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 58115 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 275 NumberOfFragments, 2597 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2227827 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1391651 FormulaSimplificationTreeSizeReductionInter, 23.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 16985 NumberOfCodeBlocks, 16985 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 16959 ConstructedInterpolants, 389 QuantifiedInterpolants, 94805949 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4885 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 24982/25457 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...