./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label52_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem15_label52_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 4bb3b482390115b2782eac42531403c30b191295 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 23:28:18,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:28:18,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:28:18,618 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:28:18,618 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:28:18,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:28:18,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:28:18,623 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:28:18,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:28:18,625 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:28:18,626 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:28:18,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:28:18,627 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:28:18,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:28:18,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:28:18,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:28:18,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:28:18,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:28:18,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:28:18,637 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:28:18,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:28:18,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:28:18,642 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:28:18,642 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:28:18,642 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:28:18,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:28:18,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:28:18,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:28:18,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:28:18,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:28:18,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:28:18,648 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:28:18,649 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:28:18,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:28:18,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:28:18,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:28:18,651 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 23:28:18,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:28:18,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:28:18,669 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:28:18,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:28:18,669 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:28:18,670 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:28:18,670 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:28:18,670 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:28:18,670 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:28:18,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:28:18,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:28:18,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:28:18,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:28:18,671 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:28:18,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:28:18,671 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:28:18,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:28:18,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:28:18,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:28:18,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:28:18,675 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:28:18,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:28:18,675 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:28:18,675 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:28:18,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:28:18,676 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:28:18,676 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:28:18,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:28:18,676 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 -> 4bb3b482390115b2782eac42531403c30b191295 [2018-12-30 23:28:18,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:28:18,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:28:18,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:28:18,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:28:18,772 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:28:18,773 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label52_true-unreach-call.c [2018-12-30 23:28:18,841 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4af47bf/4d5f206460144d1994a32026fae906df/FLAGea4a92fdf [2018-12-30 23:28:19,537 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:28:19,538 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label52_true-unreach-call.c [2018-12-30 23:28:19,561 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4af47bf/4d5f206460144d1994a32026fae906df/FLAGea4a92fdf [2018-12-30 23:28:19,697 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4af47bf/4d5f206460144d1994a32026fae906df [2018-12-30 23:28:19,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:28:19,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:28:19,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:28:19,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:28:19,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:28:19,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:28:19" (1/1) ... [2018-12-30 23:28:19,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48473f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:19, skipping insertion in model container [2018-12-30 23:28:19,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:28:19" (1/1) ... [2018-12-30 23:28:19,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:28:19,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:28:20,673 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:28:20,679 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:28:21,034 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:28:21,059 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:28:21,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21 WrapperNode [2018-12-30 23:28:21,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:28:21,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:28:21,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:28:21,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:28:21,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:28:21,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:28:21,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:28:21,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:28:21,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... [2018-12-30 23:28:21,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:28:21,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:28:21,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:28:21,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:28:21,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:28:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:28:21,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:28:30,123 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:28:30,124 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-30 23:28:30,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:28:30 BoogieIcfgContainer [2018-12-30 23:28:30,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:28:30,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:28:30,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:28:30,130 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:28:30,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:28:19" (1/3) ... [2018-12-30 23:28:30,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b41432c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:28:30, skipping insertion in model container [2018-12-30 23:28:30,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:28:21" (2/3) ... [2018-12-30 23:28:30,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b41432c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:28:30, skipping insertion in model container [2018-12-30 23:28:30,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:28:30" (3/3) ... [2018-12-30 23:28:30,135 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label52_true-unreach-call.c [2018-12-30 23:28:30,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:28:30,168 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:28:30,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:28:30,230 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:28:30,231 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:28:30,231 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:28:30,231 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:28:30,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:28:30,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:28:30,231 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:28:30,231 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:28:30,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:28:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2018-12-30 23:28:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-30 23:28:30,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:30,279 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] [2018-12-30 23:28:30,282 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:30,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2018-12-30 23:28:30,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:30,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:30,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:30,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:30,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:28:30,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:28:30,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:28:30,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:28:30,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:28:30,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:28:30,828 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2018-12-30 23:28:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:36,861 INFO L93 Difference]: Finished difference Result 1466 states and 2714 transitions. [2018-12-30 23:28:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:28:36,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-30 23:28:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:36,895 INFO L225 Difference]: With dead ends: 1466 [2018-12-30 23:28:36,895 INFO L226 Difference]: Without dead ends: 975 [2018-12-30 23:28:36,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:28:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-30 23:28:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 973. [2018-12-30 23:28:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-12-30 23:28:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1485 transitions. [2018-12-30 23:28:37,007 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1485 transitions. Word has length 39 [2018-12-30 23:28:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:37,007 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1485 transitions. [2018-12-30 23:28:37,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:28:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1485 transitions. [2018-12-30 23:28:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-30 23:28:37,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:37,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:28:37,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash -743373994, now seen corresponding path program 1 times [2018-12-30 23:28:37,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:37,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:37,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:28:37,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:28:37,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:28:37,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:28:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:28:37,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:28:37,352 INFO L87 Difference]: Start difference. First operand 973 states and 1485 transitions. Second operand 4 states. [2018-12-30 23:28:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:43,520 INFO L93 Difference]: Finished difference Result 3745 states and 5745 transitions. [2018-12-30 23:28:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:28:43,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-30 23:28:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:43,536 INFO L225 Difference]: With dead ends: 3745 [2018-12-30 23:28:43,537 INFO L226 Difference]: Without dead ends: 2774 [2018-12-30 23:28:43,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:28:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2018-12-30 23:28:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1871. [2018-12-30 23:28:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2018-12-30 23:28:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2498 transitions. [2018-12-30 23:28:43,599 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2498 transitions. Word has length 151 [2018-12-30 23:28:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:43,600 INFO L480 AbstractCegarLoop]: Abstraction has 1871 states and 2498 transitions. [2018-12-30 23:28:43,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:28:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2498 transitions. [2018-12-30 23:28:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-12-30 23:28:43,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:43,618 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:28:43,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:43,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1757201092, now seen corresponding path program 1 times [2018-12-30 23:28:43,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:43,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:44,395 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-30 23:28:44,723 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-30 23:28:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-30 23:28:44,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:28:44,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:28:44,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:28:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:28:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:28:44,882 INFO L87 Difference]: Start difference. First operand 1871 states and 2498 transitions. Second operand 5 states. [2018-12-30 23:28:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:50,246 INFO L93 Difference]: Finished difference Result 4639 states and 5973 transitions. [2018-12-30 23:28:50,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:28:50,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 311 [2018-12-30 23:28:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:50,262 INFO L225 Difference]: With dead ends: 4639 [2018-12-30 23:28:50,262 INFO L226 Difference]: Without dead ends: 2770 [2018-12-30 23:28:50,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:28:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2018-12-30 23:28:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2470. [2018-12-30 23:28:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2018-12-30 23:28:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3139 transitions. [2018-12-30 23:28:50,314 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3139 transitions. Word has length 311 [2018-12-30 23:28:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:50,314 INFO L480 AbstractCegarLoop]: Abstraction has 2470 states and 3139 transitions. [2018-12-30 23:28:50,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:28:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3139 transitions. [2018-12-30 23:28:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-12-30 23:28:50,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:50,323 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:28:50,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1988464242, now seen corresponding path program 1 times [2018-12-30 23:28:50,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:50,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:50,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:50,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:50,884 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:28:51,493 WARN L181 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-12-30 23:28:51,923 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-12-30 23:28:52,163 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2018-12-30 23:28:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 77 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:28:53,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:28:53,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:28:53,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:53,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:28:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:28:53,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:28:53,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-12-30 23:28:53,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 23:28:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 23:28:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:28:53,528 INFO L87 Difference]: Start difference. First operand 2470 states and 3139 transitions. Second operand 12 states. [2018-12-30 23:28:56,710 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-30 23:29:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:06,114 INFO L93 Difference]: Finished difference Result 7090 states and 8839 transitions. [2018-12-30 23:29:06,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-30 23:29:06,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 385 [2018-12-30 23:29:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:06,145 INFO L225 Difference]: With dead ends: 7090 [2018-12-30 23:29:06,145 INFO L226 Difference]: Without dead ends: 4622 [2018-12-30 23:29:06,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 387 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-12-30 23:29:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2018-12-30 23:29:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 3676. [2018-12-30 23:29:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3676 states. [2018-12-30 23:29:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 4530 transitions. [2018-12-30 23:29:06,232 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 4530 transitions. Word has length 385 [2018-12-30 23:29:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:06,233 INFO L480 AbstractCegarLoop]: Abstraction has 3676 states and 4530 transitions. [2018-12-30 23:29:06,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 23:29:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 4530 transitions. [2018-12-30 23:29:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-12-30 23:29:06,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:06,239 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:29:06,240 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1876663847, now seen corresponding path program 1 times [2018-12-30 23:29:06,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:06,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:06,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:06,998 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-30 23:29:07,350 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-30 23:29:07,713 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-12-30 23:29:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 311 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-30 23:29:08,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:29:08,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:29:08,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:08,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:29:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-30 23:29:08,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:29:08,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-12-30 23:29:08,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:29:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:29:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:29:08,404 INFO L87 Difference]: Start difference. First operand 3676 states and 4530 transitions. Second operand 8 states. [2018-12-30 23:29:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:15,266 INFO L93 Difference]: Finished difference Result 9599 states and 11607 transitions. [2018-12-30 23:29:15,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 23:29:15,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 402 [2018-12-30 23:29:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:15,287 INFO L225 Difference]: With dead ends: 9599 [2018-12-30 23:29:15,288 INFO L226 Difference]: Without dead ends: 4573 [2018-12-30 23:29:15,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:29:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2018-12-30 23:29:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4274. [2018-12-30 23:29:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2018-12-30 23:29:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 4987 transitions. [2018-12-30 23:29:15,390 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 4987 transitions. Word has length 402 [2018-12-30 23:29:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:15,391 INFO L480 AbstractCegarLoop]: Abstraction has 4274 states and 4987 transitions. [2018-12-30 23:29:15,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:29:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 4987 transitions. [2018-12-30 23:29:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-12-30 23:29:15,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:15,400 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:29:15,400 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash 806528277, now seen corresponding path program 1 times [2018-12-30 23:29:15,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:15,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:15,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-30 23:29:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:29:16,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:29:16,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:29:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:29:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:29:16,136 INFO L87 Difference]: Start difference. First operand 4274 states and 4987 transitions. Second operand 4 states. [2018-12-30 23:29:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:18,828 INFO L93 Difference]: Finished difference Result 12692 states and 14738 transitions. [2018-12-30 23:29:18,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:29:18,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 513 [2018-12-30 23:29:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:18,855 INFO L225 Difference]: With dead ends: 12692 [2018-12-30 23:29:18,856 INFO L226 Difference]: Without dead ends: 5729 [2018-12-30 23:29:18,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:29:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2018-12-30 23:29:18,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 4228. [2018-12-30 23:29:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4228 states. [2018-12-30 23:29:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4228 states to 4228 states and 4530 transitions. [2018-12-30 23:29:18,960 INFO L78 Accepts]: Start accepts. Automaton has 4228 states and 4530 transitions. Word has length 513 [2018-12-30 23:29:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:18,961 INFO L480 AbstractCegarLoop]: Abstraction has 4228 states and 4530 transitions. [2018-12-30 23:29:18,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:29:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4228 states and 4530 transitions. [2018-12-30 23:29:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-12-30 23:29:18,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:18,968 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:29:18,968 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:18,969 INFO L82 PathProgramCache]: Analyzing trace with hash -828305129, now seen corresponding path program 1 times [2018-12-30 23:29:18,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:18,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:18,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-30 23:29:19,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:29:19,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:29:19,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:29:19,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:29:19,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:29:19,703 INFO L87 Difference]: Start difference. First operand 4228 states and 4530 transitions. Second operand 3 states. [2018-12-30 23:29:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:22,846 INFO L93 Difference]: Finished difference Result 11744 states and 12610 transitions. [2018-12-30 23:29:22,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:29:22,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 540 [2018-12-30 23:29:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:22,879 INFO L225 Difference]: With dead ends: 11744 [2018-12-30 23:29:22,879 INFO L226 Difference]: Without dead ends: 7518 [2018-12-30 23:29:22,886 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 [2018-12-30 23:29:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2018-12-30 23:29:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 6023. [2018-12-30 23:29:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6023 states. [2018-12-30 23:29:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6023 states to 6023 states and 6422 transitions. [2018-12-30 23:29:22,993 INFO L78 Accepts]: Start accepts. Automaton has 6023 states and 6422 transitions. Word has length 540 [2018-12-30 23:29:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:22,994 INFO L480 AbstractCegarLoop]: Abstraction has 6023 states and 6422 transitions. [2018-12-30 23:29:22,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:29:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6023 states and 6422 transitions. [2018-12-30 23:29:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-12-30 23:29:23,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:23,006 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:29:23,006 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1831700796, now seen corresponding path program 1 times [2018-12-30 23:29:23,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:23,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:23,930 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-12-30 23:29:24,138 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2018-12-30 23:29:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 500 proven. 121 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-30 23:29:24,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:29:24,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:29:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:24,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:29:25,418 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2018-12-30 23:29:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 545 proven. 76 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-30 23:29:26,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:29:26,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-12-30 23:29:26,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 23:29:26,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 23:29:26,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:29:26,571 INFO L87 Difference]: Start difference. First operand 6023 states and 6422 transitions. Second operand 14 states. [2018-12-30 23:29:36,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:36,105 INFO L93 Difference]: Finished difference Result 17291 states and 18543 transitions. [2018-12-30 23:29:36,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-30 23:29:36,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 698 [2018-12-30 23:29:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:36,130 INFO L225 Difference]: With dead ends: 17291 [2018-12-30 23:29:36,130 INFO L226 Difference]: Without dead ends: 11270 [2018-12-30 23:29:36,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 700 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2018-12-30 23:29:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2018-12-30 23:29:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 8452. [2018-12-30 23:29:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2018-12-30 23:29:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 8823 transitions. [2018-12-30 23:29:36,268 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 8823 transitions. Word has length 698 [2018-12-30 23:29:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:36,269 INFO L480 AbstractCegarLoop]: Abstraction has 8452 states and 8823 transitions. [2018-12-30 23:29:36,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 23:29:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 8823 transitions. [2018-12-30 23:29:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-12-30 23:29:36,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:36,283 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:29:36,283 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:36,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:36,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1481633791, now seen corresponding path program 1 times [2018-12-30 23:29:36,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:36,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:36,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:36,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:36,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 37 proven. 489 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-12-30 23:29:37,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:29:37,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:29:37,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:37,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:29:39,438 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_825 Int)) (let ((.cse0 (mod v_~a0~0_825 299926))) (and (<= (+ v_~a0~0_825 44) 0) (<= .cse0 (+ c_~a0~0 300072)) (= .cse0 0)))) (exists ((v_prenex_4 Int)) (let ((.cse1 (mod v_prenex_4 299926))) (and (not (= .cse1 0)) (<= .cse1 (+ c_~a0~0 599998)) (< v_prenex_4 0) (<= (+ v_prenex_4 44) 0)))) (exists ((v_prenex_3 Int)) (and (<= (mod v_prenex_3 299926) (+ c_~a0~0 300072)) (<= (+ v_prenex_3 44) 0) (<= 0 v_prenex_3)))) is different from true [2018-12-30 23:29:41,936 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 164 DAG size of output: 23 [2018-12-30 23:29:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 347 trivial. 416 not checked. [2018-12-30 23:29:43,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:29:43,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-30 23:29:43,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:29:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:29:43,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2018-12-30 23:29:43,854 INFO L87 Difference]: Start difference. First operand 8452 states and 8823 transitions. Second operand 9 states. [2018-12-30 23:29:57,118 WARN L181 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2018-12-30 23:30:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:30:03,850 INFO L93 Difference]: Finished difference Result 19177 states and 19993 transitions. [2018-12-30 23:30:03,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:30:03,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 730 [2018-12-30 23:30:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:30:03,888 INFO L225 Difference]: With dead ends: 19177 [2018-12-30 23:30:03,888 INFO L226 Difference]: Without dead ends: 19175 [2018-12-30 23:30:03,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=42, Invalid=70, Unknown=2, NotChecked=18, Total=132 [2018-12-30 23:30:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19175 states. [2018-12-30 23:30:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19175 to 16400. [2018-12-30 23:30:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16400 states. [2018-12-30 23:30:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16400 states to 16400 states and 17121 transitions. [2018-12-30 23:30:04,159 INFO L78 Accepts]: Start accepts. Automaton has 16400 states and 17121 transitions. Word has length 730 [2018-12-30 23:30:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:30:04,160 INFO L480 AbstractCegarLoop]: Abstraction has 16400 states and 17121 transitions. [2018-12-30 23:30:04,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:30:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 16400 states and 17121 transitions. [2018-12-30 23:30:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2018-12-30 23:30:04,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:30:04,299 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:30:04,299 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:30:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:30:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2129502436, now seen corresponding path program 1 times [2018-12-30 23:30:04,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:30:04,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:30:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:04,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 691 proven. 174 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-30 23:30:05,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:30:05,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:30:05,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:05,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:30:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 725 proven. 140 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-30 23:30:06,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:30:06,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 10 [2018-12-30 23:30:06,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 23:30:06,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 23:30:06,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:30:06,078 INFO L87 Difference]: Start difference. First operand 16400 states and 17121 transitions. Second operand 10 states. [2018-12-30 23:30:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:30:18,317 INFO L93 Difference]: Finished difference Result 46788 states and 48922 transitions. [2018-12-30 23:30:18,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 23:30:18,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 788 [2018-12-30 23:30:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:30:18,363 INFO L225 Difference]: With dead ends: 46788 [2018-12-30 23:30:18,364 INFO L226 Difference]: Without dead ends: 30689 [2018-12-30 23:30:18,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 795 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-12-30 23:30:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30689 states. [2018-12-30 23:30:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30689 to 22081. [2018-12-30 23:30:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22081 states. [2018-12-30 23:30:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22081 states to 22081 states and 22836 transitions. [2018-12-30 23:30:18,795 INFO L78 Accepts]: Start accepts. Automaton has 22081 states and 22836 transitions. Word has length 788 [2018-12-30 23:30:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:30:18,796 INFO L480 AbstractCegarLoop]: Abstraction has 22081 states and 22836 transitions. [2018-12-30 23:30:18,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 23:30:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 22081 states and 22836 transitions. [2018-12-30 23:30:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2018-12-30 23:30:18,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:30:18,831 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:30:18,831 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:30:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:30:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash -598243412, now seen corresponding path program 1 times [2018-12-30 23:30:18,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:30:18,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:30:18,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:18,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:18,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-12-30 23:30:20,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:30:20,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:30:20,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:30:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:30:20,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:30:20,004 INFO L87 Difference]: Start difference. First operand 22081 states and 22836 transitions. Second operand 5 states. [2018-12-30 23:30:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:30:22,839 INFO L93 Difference]: Finished difference Result 31410 states and 32500 transitions. [2018-12-30 23:30:22,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:30:22,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 820 [2018-12-30 23:30:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:30:22,884 INFO L225 Difference]: With dead ends: 31410 [2018-12-30 23:30:22,884 INFO L226 Difference]: Without dead ends: 31408 [2018-12-30 23:30:22,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:30:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31408 states. [2018-12-30 23:30:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31408 to 13245. [2018-12-30 23:30:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13245 states. [2018-12-30 23:30:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13245 states to 13245 states and 13788 transitions. [2018-12-30 23:30:23,165 INFO L78 Accepts]: Start accepts. Automaton has 13245 states and 13788 transitions. Word has length 820 [2018-12-30 23:30:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:30:23,166 INFO L480 AbstractCegarLoop]: Abstraction has 13245 states and 13788 transitions. [2018-12-30 23:30:23,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:30:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 13245 states and 13788 transitions. [2018-12-30 23:30:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2018-12-30 23:30:23,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:30:23,190 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:30:23,192 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:30:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:30:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2040339601, now seen corresponding path program 1 times [2018-12-30 23:30:23,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:30:23,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:30:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:23,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:23,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:23,782 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:30:24,269 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-12-30 23:30:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 825 proven. 134 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-30 23:30:25,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:30:25,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:30:25,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:25,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:30:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-30 23:30:25,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:30:25,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-30 23:30:25,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:30:25,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:30:25,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:30:25,733 INFO L87 Difference]: Start difference. First operand 13245 states and 13788 transitions. Second operand 9 states. [2018-12-30 23:30:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:30:29,339 INFO L93 Difference]: Finished difference Result 26601 states and 27677 transitions. [2018-12-30 23:30:29,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:30:29,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 858 [2018-12-30 23:30:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:30:29,357 INFO L225 Difference]: With dead ends: 26601 [2018-12-30 23:30:29,357 INFO L226 Difference]: Without dead ends: 13358 [2018-12-30 23:30:29,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 862 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:30:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13358 states. [2018-12-30 23:30:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 12943. [2018-12-30 23:30:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12943 states. [2018-12-30 23:30:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12943 states to 12943 states and 13344 transitions. [2018-12-30 23:30:29,553 INFO L78 Accepts]: Start accepts. Automaton has 12943 states and 13344 transitions. Word has length 858 [2018-12-30 23:30:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:30:29,553 INFO L480 AbstractCegarLoop]: Abstraction has 12943 states and 13344 transitions. [2018-12-30 23:30:29,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:30:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12943 states and 13344 transitions. [2018-12-30 23:30:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2018-12-30 23:30:29,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:30:29,579 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:30:29,579 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:30:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:30:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash 520105551, now seen corresponding path program 1 times [2018-12-30 23:30:29,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:30:29,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:30:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:29,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:30,451 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:30:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 74 proven. 810 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-30 23:30:32,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:30:32,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:30:32,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:32,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:30:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 570 proven. 398 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-12-30 23:30:34,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:30:34,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-30 23:30:34,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:30:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:30:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:30:34,365 INFO L87 Difference]: Start difference. First operand 12943 states and 13344 transitions. Second operand 8 states. [2018-12-30 23:30:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:30:39,774 INFO L93 Difference]: Finished difference Result 36701 states and 37738 transitions. [2018-12-30 23:30:39,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:30:39,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1032 [2018-12-30 23:30:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:30:39,803 INFO L225 Difference]: With dead ends: 36701 [2018-12-30 23:30:39,803 INFO L226 Difference]: Without dead ends: 23760 [2018-12-30 23:30:39,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1038 GetRequests, 1028 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:30:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23760 states. [2018-12-30 23:30:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23760 to 15040. [2018-12-30 23:30:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15040 states. [2018-12-30 23:30:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15040 states to 15040 states and 15420 transitions. [2018-12-30 23:30:40,079 INFO L78 Accepts]: Start accepts. Automaton has 15040 states and 15420 transitions. Word has length 1032 [2018-12-30 23:30:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:30:40,080 INFO L480 AbstractCegarLoop]: Abstraction has 15040 states and 15420 transitions. [2018-12-30 23:30:40,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:30:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 15040 states and 15420 transitions. [2018-12-30 23:30:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-12-30 23:30:40,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:30:40,115 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:30:40,116 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:30:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:30:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1304486572, now seen corresponding path program 1 times [2018-12-30 23:30:40,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:30:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:30:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:40,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:40,548 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-12-30 23:30:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2134 backedges. 1292 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-12-30 23:30:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:30:41,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:30:41,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:30:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:30:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:30:41,274 INFO L87 Difference]: Start difference. First operand 15040 states and 15420 transitions. Second operand 3 states. [2018-12-30 23:30:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:30:43,456 INFO L93 Difference]: Finished difference Result 32179 states and 33000 transitions. [2018-12-30 23:30:43,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:30:43,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2018-12-30 23:30:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:30:43,476 INFO L225 Difference]: With dead ends: 32179 [2018-12-30 23:30:43,476 INFO L226 Difference]: Without dead ends: 17141 [2018-12-30 23:30:43,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:30:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17141 states. [2018-12-30 23:30:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17141 to 15635. [2018-12-30 23:30:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15635 states. [2018-12-30 23:30:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15635 states to 15635 states and 16007 transitions. [2018-12-30 23:30:43,697 INFO L78 Accepts]: Start accepts. Automaton has 15635 states and 16007 transitions. Word has length 1071 [2018-12-30 23:30:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:30:43,697 INFO L480 AbstractCegarLoop]: Abstraction has 15635 states and 16007 transitions. [2018-12-30 23:30:43,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:30:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 15635 states and 16007 transitions. [2018-12-30 23:30:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2018-12-30 23:30:43,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:30:43,718 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:30:43,718 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:30:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:30:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash -991780697, now seen corresponding path program 1 times [2018-12-30 23:30:43,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:30:43,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:30:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:43,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:43,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:44,452 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-30 23:30:45,095 WARN L181 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-30 23:30:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 1632 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2018-12-30 23:30:46,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:30:46,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:30:46,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:30:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:30:46,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:30:46,133 INFO L87 Difference]: Start difference. First operand 15635 states and 16007 transitions. Second operand 5 states. [2018-12-30 23:30:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:30:48,398 INFO L93 Difference]: Finished difference Result 32472 states and 33247 transitions. [2018-12-30 23:30:48,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:30:48,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1156 [2018-12-30 23:30:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:30:48,416 INFO L225 Difference]: With dead ends: 32472 [2018-12-30 23:30:48,416 INFO L226 Difference]: Without dead ends: 16839 [2018-12-30 23:30:48,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:30:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16839 states. [2018-12-30 23:30:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16839 to 15336. [2018-12-30 23:30:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15336 states. [2018-12-30 23:30:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15336 states to 15336 states and 15689 transitions. [2018-12-30 23:30:48,620 INFO L78 Accepts]: Start accepts. Automaton has 15336 states and 15689 transitions. Word has length 1156 [2018-12-30 23:30:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:30:48,621 INFO L480 AbstractCegarLoop]: Abstraction has 15336 states and 15689 transitions. [2018-12-30 23:30:48,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:30:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15336 states and 15689 transitions. [2018-12-30 23:30:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2018-12-30 23:30:48,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:30:48,640 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:30:48,640 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:30:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:30:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash 274902571, now seen corresponding path program 1 times [2018-12-30 23:30:48,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:30:48,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:30:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:48,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:49,328 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-12-30 23:30:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 1387 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2018-12-30 23:30:50,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:30:50,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:30:50,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:30:50,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:30:50,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:30:50,042 INFO L87 Difference]: Start difference. First operand 15336 states and 15689 transitions. Second operand 5 states. [2018-12-30 23:30:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:30:52,670 INFO L93 Difference]: Finished difference Result 23163 states and 23676 transitions. [2018-12-30 23:30:52,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:30:52,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1158 [2018-12-30 23:30:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:30:52,696 INFO L225 Difference]: With dead ends: 23163 [2018-12-30 23:30:52,696 INFO L226 Difference]: Without dead ends: 23161 [2018-12-30 23:30:52,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:30:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23161 states. [2018-12-30 23:30:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23161 to 16837. [2018-12-30 23:30:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16837 states. [2018-12-30 23:30:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16837 states to 16837 states and 17244 transitions. [2018-12-30 23:30:53,045 INFO L78 Accepts]: Start accepts. Automaton has 16837 states and 17244 transitions. Word has length 1158 [2018-12-30 23:30:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:30:53,046 INFO L480 AbstractCegarLoop]: Abstraction has 16837 states and 17244 transitions. [2018-12-30 23:30:53,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:30:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 16837 states and 17244 transitions. [2018-12-30 23:30:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2018-12-30 23:30:53,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:30:53,069 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:30:53,069 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:30:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:30:53,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1241493419, now seen corresponding path program 1 times [2018-12-30 23:30:53,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:30:53,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:30:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:53,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:53,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:30:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2143 backedges. 746 proven. 629 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2018-12-30 23:30:55,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:30:55,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:30:55,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:30:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:30:55,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:30:56,141 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 14 [2018-12-30 23:30:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2143 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 1360 trivial. 0 not checked. [2018-12-30 23:30:57,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:30:57,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-12-30 23:30:57,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:30:57,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:30:57,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:30:57,239 INFO L87 Difference]: Start difference. First operand 16837 states and 17244 transitions. Second operand 7 states. [2018-12-30 23:31:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:31:03,230 INFO L93 Difference]: Finished difference Result 46600 states and 47692 transitions. [2018-12-30 23:31:03,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:31:03,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1159 [2018-12-30 23:31:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:31:03,261 INFO L225 Difference]: With dead ends: 46600 [2018-12-30 23:31:03,261 INFO L226 Difference]: Without dead ends: 29765 [2018-12-30 23:31:03,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1164 GetRequests, 1158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:31:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29765 states. [2018-12-30 23:31:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29765 to 19833. [2018-12-30 23:31:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19833 states. [2018-12-30 23:31:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19833 states to 19833 states and 20288 transitions. [2018-12-30 23:31:03,547 INFO L78 Accepts]: Start accepts. Automaton has 19833 states and 20288 transitions. Word has length 1159 [2018-12-30 23:31:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:31:03,548 INFO L480 AbstractCegarLoop]: Abstraction has 19833 states and 20288 transitions. [2018-12-30 23:31:03,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:31:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 19833 states and 20288 transitions. [2018-12-30 23:31:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1345 [2018-12-30 23:31:03,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:31:03,576 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:31:03,576 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:31:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:31:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash -363614580, now seen corresponding path program 1 times [2018-12-30 23:31:03,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:31:03,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:31:03,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:31:03,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:31:03,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:31:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:31:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3794 backedges. 2999 proven. 70 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2018-12-30 23:31:05,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:31:05,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:31:05,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:31:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:31:06,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:31:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3794 backedges. 2931 proven. 87 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2018-12-30 23:31:07,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:31:07,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2018-12-30 23:31:07,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 23:31:07,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 23:31:07,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:31:07,932 INFO L87 Difference]: Start difference. First operand 19833 states and 20288 transitions. Second operand 11 states. [2018-12-30 23:31:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:31:13,974 INFO L93 Difference]: Finished difference Result 41823 states and 42797 transitions. [2018-12-30 23:31:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-30 23:31:13,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1344 [2018-12-30 23:31:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:31:13,999 INFO L225 Difference]: With dead ends: 41823 [2018-12-30 23:31:13,999 INFO L226 Difference]: Without dead ends: 24687 [2018-12-30 23:31:14,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1375 GetRequests, 1353 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2018-12-30 23:31:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24687 states. [2018-12-30 23:31:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24687 to 21033. [2018-12-30 23:31:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21033 states. [2018-12-30 23:31:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21033 states to 21033 states and 21498 transitions. [2018-12-30 23:31:14,469 INFO L78 Accepts]: Start accepts. Automaton has 21033 states and 21498 transitions. Word has length 1344 [2018-12-30 23:31:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:31:14,470 INFO L480 AbstractCegarLoop]: Abstraction has 21033 states and 21498 transitions. [2018-12-30 23:31:14,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 23:31:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 21033 states and 21498 transitions. [2018-12-30 23:31:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1368 [2018-12-30 23:31:14,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:31:14,492 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:31:14,492 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:31:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:31:14,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1542456831, now seen corresponding path program 1 times [2018-12-30 23:31:14,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:31:14,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:31:14,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:31:14,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:31:14,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:31:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:31:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 1818 proven. 0 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-12-30 23:31:16,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:31:16,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:31:16,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:31:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:31:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:31:16,026 INFO L87 Difference]: Start difference. First operand 21033 states and 21498 transitions. Second operand 4 states. [2018-12-30 23:31:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:31:17,968 INFO L93 Difference]: Finished difference Result 40867 states and 41809 transitions. [2018-12-30 23:31:17,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:31:17,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1367 [2018-12-30 23:31:17,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:31:17,993 INFO L225 Difference]: With dead ends: 40867 [2018-12-30 23:31:17,993 INFO L226 Difference]: Without dead ends: 23132 [2018-12-30 23:31:18,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:31:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23132 states. [2018-12-30 23:31:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23132 to 15927. [2018-12-30 23:31:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15927 states. [2018-12-30 23:31:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15927 states to 15927 states and 16209 transitions. [2018-12-30 23:31:18,233 INFO L78 Accepts]: Start accepts. Automaton has 15927 states and 16209 transitions. Word has length 1367 [2018-12-30 23:31:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:31:18,234 INFO L480 AbstractCegarLoop]: Abstraction has 15927 states and 16209 transitions. [2018-12-30 23:31:18,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:31:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15927 states and 16209 transitions. [2018-12-30 23:31:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1570 [2018-12-30 23:31:18,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:31:18,253 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:31:18,254 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:31:18,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:31:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1710672224, now seen corresponding path program 1 times [2018-12-30 23:31:18,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:31:18,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:31:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:31:18,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:31:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:31:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:31:19,197 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:31:19,331 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-12-30 23:31:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 74 proven. 4167 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2018-12-30 23:31:22,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:31:22,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:31:22,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:31:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:31:23,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:31:24,473 WARN L181 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 498 DAG size of output: 21 [2018-12-30 23:31:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 3495 proven. 400 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2018-12-30 23:31:28,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:31:28,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-12-30 23:31:28,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 23:31:28,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 23:31:28,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:31:28,545 INFO L87 Difference]: Start difference. First operand 15927 states and 16209 transitions. Second operand 12 states. [2018-12-30 23:31:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:31:43,102 INFO L93 Difference]: Finished difference Result 52914 states and 53826 transitions. [2018-12-30 23:31:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 23:31:43,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1569 [2018-12-30 23:31:43,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:31:43,140 INFO L225 Difference]: With dead ends: 52914 [2018-12-30 23:31:43,140 INFO L226 Difference]: Without dead ends: 38783 [2018-12-30 23:31:43,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1585 GetRequests, 1570 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-30 23:31:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38783 states. [2018-12-30 23:31:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38783 to 19218. [2018-12-30 23:31:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19218 states. [2018-12-30 23:31:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19218 states to 19218 states and 19553 transitions. [2018-12-30 23:31:43,503 INFO L78 Accepts]: Start accepts. Automaton has 19218 states and 19553 transitions. Word has length 1569 [2018-12-30 23:31:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:31:43,504 INFO L480 AbstractCegarLoop]: Abstraction has 19218 states and 19553 transitions. [2018-12-30 23:31:43,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 23:31:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 19218 states and 19553 transitions. [2018-12-30 23:31:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1632 [2018-12-30 23:31:43,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:31:43,530 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:31:43,531 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:31:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:31:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash -71854046, now seen corresponding path program 1 times [2018-12-30 23:31:43,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:31:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:31:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:31:43,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:31:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:31:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:31:44,430 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:31:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4925 backedges. 2639 proven. 519 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2018-12-30 23:31:46,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:31:46,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:31:46,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:31:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:31:47,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:31:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4925 backedges. 295 proven. 2479 refuted. 0 times theorem prover too weak. 2151 trivial. 0 not checked. [2018-12-30 23:31:55,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:31:55,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 14 [2018-12-30 23:31:55,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 23:31:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 23:31:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:31:55,892 INFO L87 Difference]: Start difference. First operand 19218 states and 19553 transitions. Second operand 14 states. [2018-12-30 23:35:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:14,991 INFO L93 Difference]: Finished difference Result 52829 states and 53765 transitions. [2018-12-30 23:35:14,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-30 23:35:14,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1631 [2018-12-30 23:35:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:15,023 INFO L225 Difference]: With dead ends: 52829 [2018-12-30 23:35:15,023 INFO L226 Difference]: Without dead ends: 36005 [2018-12-30 23:35:15,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1719 GetRequests, 1667 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=481, Invalid=1969, Unknown=0, NotChecked=0, Total=2450 [2018-12-30 23:35:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36005 states. [2018-12-30 23:35:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36005 to 14129. [2018-12-30 23:35:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2018-12-30 23:35:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 14377 transitions. [2018-12-30 23:35:15,331 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 14377 transitions. Word has length 1631 [2018-12-30 23:35:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:15,332 INFO L480 AbstractCegarLoop]: Abstraction has 14129 states and 14377 transitions. [2018-12-30 23:35:15,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 23:35:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 14377 transitions. [2018-12-30 23:35:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1780 [2018-12-30 23:35:15,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:15,359 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:35:15,359 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash 899563936, now seen corresponding path program 1 times [2018-12-30 23:35:15,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:15,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:15,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:15,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:15,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 4001 proven. 0 refuted. 0 times theorem prover too weak. 2083 trivial. 0 not checked. [2018-12-30 23:35:17,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:17,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:35:17,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:35:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:35:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:35:17,929 INFO L87 Difference]: Start difference. First operand 14129 states and 14377 transitions. Second operand 3 states. [2018-12-30 23:35:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:19,272 INFO L93 Difference]: Finished difference Result 28559 states and 29059 transitions. [2018-12-30 23:35:19,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:35:19,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1779 [2018-12-30 23:35:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:19,288 INFO L225 Difference]: With dead ends: 28559 [2018-12-30 23:35:19,288 INFO L226 Difference]: Without dead ends: 16226 [2018-12-30 23:35:19,296 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 [2018-12-30 23:35:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16226 states. [2018-12-30 23:35:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16226 to 14128. [2018-12-30 23:35:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14128 states. [2018-12-30 23:35:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14128 states to 14128 states and 14372 transitions. [2018-12-30 23:35:19,507 INFO L78 Accepts]: Start accepts. Automaton has 14128 states and 14372 transitions. Word has length 1779 [2018-12-30 23:35:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:19,508 INFO L480 AbstractCegarLoop]: Abstraction has 14128 states and 14372 transitions. [2018-12-30 23:35:19,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:35:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14128 states and 14372 transitions. [2018-12-30 23:35:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1876 [2018-12-30 23:35:19,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:19,535 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:35:19,535 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 387671527, now seen corresponding path program 1 times [2018-12-30 23:35:19,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:19,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:19,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:19,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:19,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:20,374 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:35:20,524 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-12-30 23:35:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7340 backedges. 4740 proven. 335 refuted. 0 times theorem prover too weak. 2265 trivial. 0 not checked. [2018-12-30 23:35:22,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:35:22,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:35:22,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:23,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:35:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7340 backedges. 4807 proven. 0 refuted. 0 times theorem prover too weak. 2533 trivial. 0 not checked. [2018-12-30 23:35:24,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:35:24,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-30 23:35:24,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:35:24,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:35:24,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:35:24,606 INFO L87 Difference]: Start difference. First operand 14128 states and 14372 transitions. Second operand 9 states. [2018-12-30 23:35:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:27,721 INFO L93 Difference]: Finished difference Result 26881 states and 27347 transitions. [2018-12-30 23:35:27,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:35:27,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1875 [2018-12-30 23:35:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:27,735 INFO L225 Difference]: With dead ends: 26881 [2018-12-30 23:35:27,736 INFO L226 Difference]: Without dead ends: 14549 [2018-12-30 23:35:27,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1891 GetRequests, 1878 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:35:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14549 states. [2018-12-30 23:35:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14549 to 13827. [2018-12-30 23:35:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13827 states. [2018-12-30 23:35:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13827 states to 13827 states and 14055 transitions. [2018-12-30 23:35:27,956 INFO L78 Accepts]: Start accepts. Automaton has 13827 states and 14055 transitions. Word has length 1875 [2018-12-30 23:35:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:27,957 INFO L480 AbstractCegarLoop]: Abstraction has 13827 states and 14055 transitions. [2018-12-30 23:35:27,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:35:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 13827 states and 14055 transitions. [2018-12-30 23:35:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1876 [2018-12-30 23:35:27,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:27,993 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 23:35:27,994 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash -603868045, now seen corresponding path program 1 times [2018-12-30 23:35:27,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:27,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:27,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:27,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:27,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6357 backedges. 74 proven. 4944 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2018-12-30 23:35:33,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:35:33,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:35:33,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:34,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:35:34,951 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 498 DAG size of output: 22 [2018-12-30 23:35:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6357 backedges. 3945 proven. 400 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2018-12-30 23:35:41,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:35:41,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-12-30 23:35:41,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 23:35:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 23:35:41,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=89, Unknown=1, NotChecked=0, Total=132 [2018-12-30 23:35:41,817 INFO L87 Difference]: Start difference. First operand 13827 states and 14055 transitions. Second operand 12 states. [2018-12-30 23:35:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:56,369 INFO L93 Difference]: Finished difference Result 28251 states and 28678 transitions. [2018-12-30 23:35:56,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 23:35:56,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1875 [2018-12-30 23:35:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:56,372 INFO L225 Difference]: With dead ends: 28251 [2018-12-30 23:35:56,372 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:35:56,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1891 GetRequests, 1876 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=85, Invalid=186, Unknown=1, NotChecked=0, Total=272 [2018-12-30 23:35:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:35:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:35:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:35:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:35:56,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1875 [2018-12-30 23:35:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:56,384 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:35:56,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 23:35:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:35:56,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:35:56,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:35:56,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:57,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:57,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:58,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:59,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:59,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:59,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:59,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:59,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:59,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:35:59,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:00,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:00,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:00,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:00,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:00,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:00,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:01,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:01,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:01,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:01,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:01,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:01,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:02,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:02,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:02,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:03,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:03,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:03,822 WARN L181 SmtUtils]: Spent 7.43 s on a formula simplification. DAG size of input: 1813 DAG size of output: 1605 [2018-12-30 23:36:04,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:04,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:05,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:05,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:05,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:05,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:05,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:05,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:05,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:06,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:06,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:07,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:08,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:08,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:08,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:09,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:09,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:09,881 WARN L181 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 1813 DAG size of output: 1605 [2018-12-30 23:36:09,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:09,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:09,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:09,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:10,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:10,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:10,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:10,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:10,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:10,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:10,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:11,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:11,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:11,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:11,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:12,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:12,921 WARN L181 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 1240 DAG size of output: 1119 [2018-12-30 23:36:51,722 WARN L181 SmtUtils]: Spent 38.79 s on a formula simplification. DAG size of input: 1556 DAG size of output: 170 [2018-12-30 23:37:29,596 WARN L181 SmtUtils]: Spent 37.86 s on a formula simplification. DAG size of input: 1556 DAG size of output: 170 [2018-12-30 23:38:19,777 WARN L181 SmtUtils]: Spent 50.17 s on a formula simplification. DAG size of input: 1087 DAG size of output: 181 [2018-12-30 23:38:19,783 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,783 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,783 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,783 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,784 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,785 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,786 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2018-12-30 23:38:19,787 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,788 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,789 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,790 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2018-12-30 23:38:19,791 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,792 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:38:19,793 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,794 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,795 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,796 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,797 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,798 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 124) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:38:19,799 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,800 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,801 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,802 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,802 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse36 (+ ~a29~0 144)) (.cse19 (+ ~a0~0 61)) (.cse34 (+ ~a29~0 16)) (.cse37 (+ ~a4~0 86))) (let ((.cse17 (<= .cse37 0)) (.cse5 (= ~a2~0 4)) (.cse2 (< 0 .cse34)) (.cse21 (< 0 .cse19)) (.cse18 (<= .cse36 0))) (let ((.cse25 (or .cse2 (< 0 .cse37) .cse21 .cse18)) (.cse35 (and .cse17 (not .cse5)))) (let ((.cse14 (= 5 ~a2~0)) (.cse3 (<= (+ ~a0~0 98) 0)) (.cse6 (= ~a2~0 1)) (.cse28 (<= (+ ~a0~0 147) 0)) (.cse24 (= 3 ~a2~0)) (.cse26 (and (<= ~a2~0 2) .cse35)) (.cse7 (<= ~a29~0 43)) (.cse31 (and .cse35 .cse25))) (let ((.cse1 (and .cse7 (and .cse31 (= ~a2~0 3)))) (.cse8 (< 0 .cse36)) (.cse20 (and .cse2 .cse35)) (.cse11 (<= ~a0~0 599946)) (.cse22 (and .cse7 .cse26)) (.cse15 (<= 0 ~a29~0)) (.cse0 (<= ~a0~0 599970)) (.cse12 (and .cse28 .cse7 (<= 0 (+ ~a0~0 570979)) .cse24)) (.cse9 (and .cse3 .cse6)) (.cse10 (<= 0 (+ ~a0~0 366694))) (.cse13 (= ~a2~0 2)) (.cse4 (< 43 ~a29~0)) (.cse23 (<= (+ ~a0~0 99) 0)) (.cse27 (and .cse3 .cse7 .cse14)) (.cse16 (<= .cse34 0))) (or (and .cse0 (and .cse1 .cse2)) (and .cse3 .cse4 .cse5) (and (and .cse3 .cse6 .cse7 .cse8) (<= 0 (+ ~a0~0 451092))) (and (and .cse4 .cse9) .cse10) (and .cse11 .cse1) (and (<= 0 (+ ~a0~0 385464)) .cse12) (and (and .cse3 (or (< 0 (+ ~a4~0 42)) (not (= 1 ULTIMATE.start_calculate_output_~input)))) .cse13 .cse4) (and (and .cse3 .cse14) .cse15) (and .cse16 .cse6 .cse8 .cse10 (<= (+ ~a0~0 44) 0)) (and (and .cse17 .cse6) .cse18 (<= .cse19 0)) (and .cse0 (and .cse20 .cse21 .cse14)) (and .cse0 (and .cse22 .cse13 .cse16)) (and .cse7 (and .cse20 .cse14)) (and (and .cse17 .cse5 .cse2 .cse21) .cse7) (and .cse23 .cse24 .cse10) (and (and (and (and .cse5 .cse17) .cse25) .cse11) .cse16) (and (<= 2 ~a2~0) (or (and .cse11 .cse22) (and .cse26 .cse4))) (and .cse27 .cse28) (and .cse0 .cse6 .cse2 .cse7) (and .cse13 (or (and .cse28 .cse15) (and (and .cse2 .cse28) (exists ((v_prenex_76 Int)) (let ((.cse30 (* 10 (div v_prenex_76 5)))) (let ((.cse29 (+ .cse30 3459790))) (and (<= 0 .cse29) (<= v_prenex_76 599946) (<= 0 v_prenex_76) (<= 0 (+ .cse30 3459800)) (<= (div .cse29 (- 9)) ~a0~0)))))))) (and .cse0 (and (and .cse31 .cse24) .cse4)) (and .cse12 .cse16) (and (<= 0 (+ ~a0~0 146)) .cse9) (and (and .cse5 .cse10) .cse28 .cse16) (and (and .cse2 .cse7 .cse3 .cse10) .cse13) (and (or .cse10 (and (<= 0 (+ ~a0~0 501326)) (<= (+ ~a0~0 500918) 0))) .cse13 .cse28) (and (exists ((v_prenex_101 Int)) (let ((.cse33 (* 10 (div v_prenex_101 5)))) (let ((.cse32 (+ .cse33 3459790))) (and (<= v_prenex_101 599970) (<= 0 .cse32) (= 0 (mod v_prenex_101 5)) (<= (div .cse32 (- 9)) ~a0~0) (<= 0 (+ .cse33 3459800)))))) .cse4 .cse23 .cse24) (and .cse27 .cse16) (and .cse3 .cse17))))))) [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,803 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,804 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,805 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,806 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse8 (<= (+ ~a4~0 86) 0)) (.cse12 (= ~a2~0 4))) (let ((.cse32 (<= ~a2~0 2)) (.cse34 (+ ~a29~0 16)) (.cse36 (and .cse8 (not .cse12))) (.cse33 (= ~a2~0 3))) (let ((.cse14 (<= (+ ~a0~0 147) 0)) (.cse4 (and .cse36 .cse33)) (.cse25 (< 0 .cse34)) (.cse22 (and .cse32 .cse36)) (.cse15 (<= ~a29~0 43)) (.cse11 (<= (+ ~a0~0 98) 0)) (.cse9 (= ~a2~0 1)) (.cse35 (+ ~a29~0 144))) (let ((.cse16 (< 0 .cse35)) (.cse17 (and .cse11 .cse9)) (.cse20 (and .cse22 .cse15)) (.cse23 (and .cse25 .cse36)) (.cse18 (<= 0 (+ ~a0~0 366694))) (.cse3 (<= ~a0~0 599970)) (.cse7 (and .cse15 .cse4)) (.cse24 (< 0 (+ ~a0~0 61))) (.cse10 (<= .cse35 0)) (.cse6 (<= ~a0~0 599946)) (.cse19 (<= .cse34 0)) (.cse21 (and (and .cse33 .cse15 (<= 0 (+ ~a0~0 570979))) .cse14)) (.cse5 (< 43 ~a29~0)) (.cse26 (<= (+ ~a0~0 99) 0)) (.cse27 (= 3 ~a2~0)) (.cse13 (= 5 ~a2~0)) (.cse1 (<= 0 ~a29~0)) (.cse2 (= ~a2~0 2)) (.cse0 (and .cse25 (and .cse11 .cse32)))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 (and .cse4 .cse5)) (and .cse6 .cse7) (and (and .cse8 .cse9) .cse10) (and .cse11 .cse5 .cse12) (and .cse13 .cse14) (and (and .cse11 .cse9 .cse15 .cse16) (<= 0 (+ ~a0~0 451092))) (and (and .cse17 .cse5) .cse18) (and (and (and .cse12 .cse18) .cse19) .cse14) (and .cse19 .cse9 .cse16 .cse18 (<= (+ ~a0~0 44) 0)) (and .cse3 (and .cse20 .cse2 .cse19)) (and .cse21 .cse19) (and (<= 0 (+ ~a0~0 146)) .cse17) (and (<= 2 ~a2~0) (or (and .cse6 .cse20) (and .cse22 .cse5))) (and .cse14 (and (or .cse18 (and (<= 0 (+ ~a0~0 501326)) (<= (+ ~a0~0 500918) 0))) .cse2)) (and .cse3 (and .cse23 .cse24 .cse13)) (and .cse3 (and .cse9 .cse25 .cse15)) (and .cse15 (and .cse8 .cse12 .cse25 .cse24)) (and (and .cse23 .cse13) .cse15) (and .cse26 .cse18 .cse27) (and .cse3 (and .cse25 .cse7)) (and .cse19 (and .cse11 .cse13)) (and (and (and .cse12 (or .cse24 .cse10) .cse8) .cse6) .cse19) (and (<= 0 (+ ~a0~0 385464)) .cse21) (and (exists ((v_prenex_101 Int)) (let ((.cse29 (* 10 (div v_prenex_101 5)))) (let ((.cse28 (+ .cse29 3459790))) (and (<= v_prenex_101 599970) (<= 0 .cse28) (= 0 (mod v_prenex_101 5)) (<= (div .cse28 (- 9)) ~a0~0) (<= 0 (+ .cse29 3459800)))))) .cse5 .cse26 .cse27) (and .cse11 .cse8) (and (and .cse13 .cse11) .cse1) (and .cse2 (and .cse0 (exists ((v_prenex_76 Int)) (let ((.cse31 (* 10 (div v_prenex_76 5)))) (let ((.cse30 (+ .cse31 3459790))) (and (<= 0 .cse30) (<= v_prenex_76 599946) (<= 0 v_prenex_76) (<= 0 (+ .cse31 3459800)) (<= (div .cse30 (- 9)) ~a0~0)))))))))))) [2018-12-30 23:38:19,806 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,806 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:38:19,806 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:38:19,806 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,806 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,806 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,807 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,808 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,809 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:38:19,810 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:38:19,811 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:38:19,812 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,812 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,812 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,812 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,812 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,812 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse8 (<= (+ ~a4~0 86) 0)) (.cse12 (= ~a2~0 4))) (let ((.cse32 (<= ~a2~0 2)) (.cse34 (+ ~a29~0 16)) (.cse36 (and .cse8 (not .cse12))) (.cse33 (= ~a2~0 3))) (let ((.cse14 (<= (+ ~a0~0 147) 0)) (.cse4 (and .cse36 .cse33)) (.cse25 (< 0 .cse34)) (.cse22 (and .cse32 .cse36)) (.cse15 (<= ~a29~0 43)) (.cse11 (<= (+ ~a0~0 98) 0)) (.cse9 (= ~a2~0 1)) (.cse35 (+ ~a29~0 144))) (let ((.cse16 (< 0 .cse35)) (.cse17 (and .cse11 .cse9)) (.cse20 (and .cse22 .cse15)) (.cse23 (and .cse25 .cse36)) (.cse18 (<= 0 (+ ~a0~0 366694))) (.cse3 (<= ~a0~0 599970)) (.cse7 (and .cse15 .cse4)) (.cse24 (< 0 (+ ~a0~0 61))) (.cse10 (<= .cse35 0)) (.cse6 (<= ~a0~0 599946)) (.cse19 (<= .cse34 0)) (.cse21 (and (and .cse33 .cse15 (<= 0 (+ ~a0~0 570979))) .cse14)) (.cse5 (< 43 ~a29~0)) (.cse26 (<= (+ ~a0~0 99) 0)) (.cse27 (= 3 ~a2~0)) (.cse13 (= 5 ~a2~0)) (.cse1 (<= 0 ~a29~0)) (.cse2 (= ~a2~0 2)) (.cse0 (and .cse25 (and .cse11 .cse32)))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 (and .cse4 .cse5)) (and .cse6 .cse7) (and (and .cse8 .cse9) .cse10) (and .cse11 .cse5 .cse12) (and .cse13 .cse14) (and (and .cse11 .cse9 .cse15 .cse16) (<= 0 (+ ~a0~0 451092))) (and (and .cse17 .cse5) .cse18) (and (and (and .cse12 .cse18) .cse19) .cse14) (and .cse19 .cse9 .cse16 .cse18 (<= (+ ~a0~0 44) 0)) (and .cse3 (and .cse20 .cse2 .cse19)) (and .cse21 .cse19) (and (<= 0 (+ ~a0~0 146)) .cse17) (and (<= 2 ~a2~0) (or (and .cse6 .cse20) (and .cse22 .cse5))) (and .cse14 (and (or .cse18 (and (<= 0 (+ ~a0~0 501326)) (<= (+ ~a0~0 500918) 0))) .cse2)) (and .cse3 (and .cse23 .cse24 .cse13)) (and .cse3 (and .cse9 .cse25 .cse15)) (and .cse15 (and .cse8 .cse12 .cse25 .cse24)) (and (and .cse23 .cse13) .cse15) (and .cse26 .cse18 .cse27) (and .cse3 (and .cse25 .cse7)) (and .cse19 (and .cse11 .cse13)) (and (and (and .cse12 (or .cse24 .cse10) .cse8) .cse6) .cse19) (and (<= 0 (+ ~a0~0 385464)) .cse21) (and (exists ((v_prenex_101 Int)) (let ((.cse29 (* 10 (div v_prenex_101 5)))) (let ((.cse28 (+ .cse29 3459790))) (and (<= v_prenex_101 599970) (<= 0 .cse28) (= 0 (mod v_prenex_101 5)) (<= (div .cse28 (- 9)) ~a0~0) (<= 0 (+ .cse29 3459800)))))) .cse5 .cse26 .cse27) (and .cse11 .cse8) (and (and .cse13 .cse11) .cse1) (and .cse2 (and .cse0 (exists ((v_prenex_76 Int)) (let ((.cse31 (* 10 (div v_prenex_76 5)))) (let ((.cse30 (+ .cse31 3459790))) (and (<= 0 .cse30) (<= v_prenex_76 599946) (<= 0 v_prenex_76) (<= 0 (+ .cse31 3459800)) (<= (div .cse30 (- 9)) ~a0~0)))))))))))) [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,813 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,814 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2018-12-30 23:38:19,815 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,816 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,817 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,818 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,819 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,820 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:38:19,821 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,821 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2018-12-30 23:38:19,821 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2018-12-30 23:38:19,821 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,821 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,821 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2018-12-30 23:38:19,821 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2018-12-30 23:38:19,821 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2018-12-30 23:38:19,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,902 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,902 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,903 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,903 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,903 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:19,903 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:19,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:38:19 BoogieIcfgContainer [2018-12-30 23:38:19,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:38:19,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:38:19,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:38:19,920 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:38:19,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:28:30" (3/4) ... [2018-12-30 23:38:19,929 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:38:19,998 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-30 23:38:20,003 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:38:20,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((0 < a29 + 16 && a0 + 98 <= 0 && a2 <= 2) && 0 <= a29) && a2 == 2) || (a0 <= 599970 && ((a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3) && 43 < a29)) || (a0 <= 599946 && a29 <= 43 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((a0 + 98 <= 0 && 43 < a29) && a2 == 4)) || (5 == a2 && a0 + 147 <= 0)) || ((((a0 + 98 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 451092)) || (((a0 + 98 <= 0 && a2 == 1) && 43 < a29) && 0 <= a0 + 366694)) || (((a2 == 4 && 0 <= a0 + 366694) && a29 + 16 <= 0) && a0 + 147 <= 0)) || ((((a29 + 16 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 366694) && a0 + 44 <= 0)) || (a0 <= 599970 && (((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a29 <= 43) && a2 == 2) && a29 + 16 <= 0)) || ((((a2 == 3 && a29 <= 43) && 0 <= a0 + 570979) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || (2 <= a2 && ((a0 <= 599946 && (a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a29 <= 43) || ((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && 43 < a29)))) || (a0 + 147 <= 0 && (0 <= a0 + 366694 || (0 <= a0 + 501326 && a0 + 500918 <= 0)) && a2 == 2)) || (a0 <= 599970 && ((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 0 < a0 + 61) && 5 == a2)) || (a0 <= 599970 && (a2 == 1 && 0 < a29 + 16) && a29 <= 43)) || (a29 <= 43 && ((a4 + 86 <= 0 && a2 == 4) && 0 < a29 + 16) && 0 < a0 + 61)) || (((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2) && a29 <= 43)) || ((a0 + 99 <= 0 && 0 <= a0 + 366694) && 3 == a2)) || (a0 <= 599970 && 0 < a29 + 16 && a29 <= 43 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || (a29 + 16 <= 0 && a0 + 98 <= 0 && 5 == a2)) || ((((a2 == 4 && (0 < a0 + 61 || a29 + 144 <= 0)) && a4 + 86 <= 0) && a0 <= 599946) && a29 + 16 <= 0)) || (0 <= a0 + 385464 && ((a2 == 3 && a29 <= 43) && 0 <= a0 + 570979) && a0 + 147 <= 0)) || ((((\exists v_prenex_101 : int :: (((v_prenex_101 <= 599970 && 0 <= 10 * (v_prenex_101 / 5) + 3459790) && 0 == v_prenex_101 % 5) && (10 * (v_prenex_101 / 5) + 3459790) / -9 <= a0) && 0 <= 10 * (v_prenex_101 / 5) + 3459800) && 43 < a29) && a0 + 99 <= 0) && 3 == a2)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((5 == a2 && a0 + 98 <= 0) && 0 <= a29)) || (a2 == 2 && (0 < a29 + 16 && a0 + 98 <= 0 && a2 <= 2) && (\exists v_prenex_76 : int :: (((0 <= 10 * (v_prenex_76 / 5) + 3459790 && v_prenex_76 <= 599946) && 0 <= v_prenex_76) && 0 <= 10 * (v_prenex_76 / 5) + 3459800) && (10 * (v_prenex_76 / 5) + 3459790) / -9 <= a0)) [2018-12-30 23:38:20,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((0 < a29 + 16 && a0 + 98 <= 0 && a2 <= 2) && 0 <= a29) && a2 == 2) || (a0 <= 599970 && ((a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3) && 43 < a29)) || (a0 <= 599946 && a29 <= 43 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((a0 + 98 <= 0 && 43 < a29) && a2 == 4)) || (5 == a2 && a0 + 147 <= 0)) || ((((a0 + 98 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 451092)) || (((a0 + 98 <= 0 && a2 == 1) && 43 < a29) && 0 <= a0 + 366694)) || (((a2 == 4 && 0 <= a0 + 366694) && a29 + 16 <= 0) && a0 + 147 <= 0)) || ((((a29 + 16 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 366694) && a0 + 44 <= 0)) || (a0 <= 599970 && (((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a29 <= 43) && a2 == 2) && a29 + 16 <= 0)) || ((((a2 == 3 && a29 <= 43) && 0 <= a0 + 570979) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || (2 <= a2 && ((a0 <= 599946 && (a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a29 <= 43) || ((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && 43 < a29)))) || (a0 + 147 <= 0 && (0 <= a0 + 366694 || (0 <= a0 + 501326 && a0 + 500918 <= 0)) && a2 == 2)) || (a0 <= 599970 && ((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 0 < a0 + 61) && 5 == a2)) || (a0 <= 599970 && (a2 == 1 && 0 < a29 + 16) && a29 <= 43)) || (a29 <= 43 && ((a4 + 86 <= 0 && a2 == 4) && 0 < a29 + 16) && 0 < a0 + 61)) || (((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2) && a29 <= 43)) || ((a0 + 99 <= 0 && 0 <= a0 + 366694) && 3 == a2)) || (a0 <= 599970 && 0 < a29 + 16 && a29 <= 43 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || (a29 + 16 <= 0 && a0 + 98 <= 0 && 5 == a2)) || ((((a2 == 4 && (0 < a0 + 61 || a29 + 144 <= 0)) && a4 + 86 <= 0) && a0 <= 599946) && a29 + 16 <= 0)) || (0 <= a0 + 385464 && ((a2 == 3 && a29 <= 43) && 0 <= a0 + 570979) && a0 + 147 <= 0)) || ((((\exists v_prenex_101 : int :: (((v_prenex_101 <= 599970 && 0 <= 10 * (v_prenex_101 / 5) + 3459790) && 0 == v_prenex_101 % 5) && (10 * (v_prenex_101 / 5) + 3459790) / -9 <= a0) && 0 <= 10 * (v_prenex_101 / 5) + 3459800) && 43 < a29) && a0 + 99 <= 0) && 3 == a2)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((5 == a2 && a0 + 98 <= 0) && 0 <= a29)) || (a2 == 2 && (0 < a29 + 16 && a0 + 98 <= 0 && a2 <= 2) && (\exists v_prenex_76 : int :: (((0 <= 10 * (v_prenex_76 / 5) + 3459790 && v_prenex_76 <= 599946) && 0 <= v_prenex_76) && 0 <= 10 * (v_prenex_76 / 5) + 3459800) && (10 * (v_prenex_76 / 5) + 3459790) / -9 <= a0)) [2018-12-30 23:38:20,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a0 <= 599970 && (a29 <= 43 && ((a4 + 86 <= 0 && !(a2 == 4)) && (((0 < a29 + 16 || 0 < a4 + 86) || 0 < a0 + 61) || a29 + 144 <= 0)) && a2 == 3) && 0 < a29 + 16) || ((a0 + 98 <= 0 && 43 < a29) && a2 == 4)) || ((((a0 + 98 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 451092)) || ((43 < a29 && a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 366694)) || (a0 <= 599946 && a29 <= 43 && ((a4 + 86 <= 0 && !(a2 == 4)) && (((0 < a29 + 16 || 0 < a4 + 86) || 0 < a0 + 61) || a29 + 144 <= 0)) && a2 == 3)) || (0 <= a0 + 385464 && ((a0 + 147 <= 0 && a29 <= 43) && 0 <= a0 + 570979) && 3 == a2)) || (((a0 + 98 <= 0 && (0 < a4 + 42 || !(1 == input))) && a2 == 2) && 43 < a29)) || ((a0 + 98 <= 0 && 5 == a2) && 0 <= a29)) || ((((a29 + 16 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 366694) && a0 + 44 <= 0)) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (a0 <= 599970 && ((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 0 < a0 + 61) && 5 == a2)) || (a0 <= 599970 && ((a29 <= 43 && a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a2 == 2) && a29 + 16 <= 0)) || (a29 <= 43 && (0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || ((((a4 + 86 <= 0 && a2 == 4) && 0 < a29 + 16) && 0 < a0 + 61) && a29 <= 43)) || ((a0 + 99 <= 0 && 3 == a2) && 0 <= a0 + 366694)) || ((((a2 == 4 && a4 + 86 <= 0) && (((0 < a29 + 16 || 0 < a4 + 86) || 0 < a0 + 61) || a29 + 144 <= 0)) && a0 <= 599946) && a29 + 16 <= 0)) || (2 <= a2 && ((a0 <= 599946 && a29 <= 43 && a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) || ((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && 43 < a29)))) || (((a0 + 98 <= 0 && a29 <= 43) && 5 == a2) && a0 + 147 <= 0)) || (((a0 <= 599970 && a2 == 1) && 0 < a29 + 16) && a29 <= 43)) || (a2 == 2 && ((a0 + 147 <= 0 && 0 <= a29) || ((0 < a29 + 16 && a0 + 147 <= 0) && (\exists v_prenex_76 : int :: (((0 <= 10 * (v_prenex_76 / 5) + 3459790 && v_prenex_76 <= 599946) && 0 <= v_prenex_76) && 0 <= 10 * (v_prenex_76 / 5) + 3459800) && (10 * (v_prenex_76 / 5) + 3459790) / -9 <= a0))))) || (a0 <= 599970 && (((a4 + 86 <= 0 && !(a2 == 4)) && (((0 < a29 + 16 || 0 < a4 + 86) || 0 < a0 + 61) || a29 + 144 <= 0)) && 3 == a2) && 43 < a29)) || ((((a0 + 147 <= 0 && a29 <= 43) && 0 <= a0 + 570979) && 3 == a2) && a29 + 16 <= 0)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || (((a2 == 4 && 0 <= a0 + 366694) && a0 + 147 <= 0) && a29 + 16 <= 0)) || ((((0 < a29 + 16 && a29 <= 43) && a0 + 98 <= 0) && 0 <= a0 + 366694) && a2 == 2)) || (((0 <= a0 + 366694 || (0 <= a0 + 501326 && a0 + 500918 <= 0)) && a2 == 2) && a0 + 147 <= 0)) || ((((\exists v_prenex_101 : int :: (((v_prenex_101 <= 599970 && 0 <= 10 * (v_prenex_101 / 5) + 3459790) && 0 == v_prenex_101 % 5) && (10 * (v_prenex_101 / 5) + 3459790) / -9 <= a0) && 0 <= 10 * (v_prenex_101 / 5) + 3459800) && 43 < a29) && a0 + 99 <= 0) && 3 == a2)) || (((a0 + 98 <= 0 && a29 <= 43) && 5 == a2) && a29 + 16 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0) [2018-12-30 23:38:20,421 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:38:20,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:38:20,422 INFO L168 Benchmark]: Toolchain (without parser) took 600717.52 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 943.2 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 229.0 MB. Max. memory is 11.5 GB. [2018-12-30 23:38:20,424 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:38:20,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1352.03 ms. Allocated memory is still 1.0 GB. Free memory was 943.2 MB in the beginning and 845.2 MB in the end (delta: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. [2018-12-30 23:38:20,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 434.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 845.2 MB in the beginning and 1.1 GB in the end (delta: -269.6 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-12-30 23:38:20,425 INFO L168 Benchmark]: Boogie Preprocessor took 209.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:38:20,425 INFO L168 Benchmark]: RCFGBuilder took 8418.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.8 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. [2018-12-30 23:38:20,429 INFO L168 Benchmark]: TraceAbstraction took 589793.69 ms. Allocated memory was 1.3 GB in the beginning and 4.7 GB in the end (delta: 3.4 GB). Free memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-30 23:38:20,429 INFO L168 Benchmark]: Witness Printer took 501.04 ms. Allocated memory is still 4.7 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 75.5 MB). Peak memory consumption was 75.5 MB. Max. memory is 11.5 GB. [2018-12-30 23:38:20,433 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.21 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 1352.03 ms. Allocated memory is still 1.0 GB. Free memory was 943.2 MB in the beginning and 845.2 MB in the end (delta: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 434.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 845.2 MB in the beginning and 1.1 GB in the end (delta: -269.6 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 209.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8418.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.8 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 589793.69 ms. Allocated memory was 1.3 GB in the beginning and 4.7 GB in the end (delta: 3.4 GB). Free memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 501.04 ms. Allocated memory is still 4.7 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 75.5 MB). Peak memory consumption was 75.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 124]: 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 [2018-12-30 23:38:20,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((0 < a29 + 16 && a0 + 98 <= 0 && a2 <= 2) && 0 <= a29) && a2 == 2) || (a0 <= 599970 && ((a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3) && 43 < a29)) || (a0 <= 599946 && a29 <= 43 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((a0 + 98 <= 0 && 43 < a29) && a2 == 4)) || (5 == a2 && a0 + 147 <= 0)) || ((((a0 + 98 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 451092)) || (((a0 + 98 <= 0 && a2 == 1) && 43 < a29) && 0 <= a0 + 366694)) || (((a2 == 4 && 0 <= a0 + 366694) && a29 + 16 <= 0) && a0 + 147 <= 0)) || ((((a29 + 16 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 366694) && a0 + 44 <= 0)) || (a0 <= 599970 && (((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a29 <= 43) && a2 == 2) && a29 + 16 <= 0)) || ((((a2 == 3 && a29 <= 43) && 0 <= a0 + 570979) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || (2 <= a2 && ((a0 <= 599946 && (a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a29 <= 43) || ((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && 43 < a29)))) || (a0 + 147 <= 0 && (0 <= a0 + 366694 || (0 <= a0 + 501326 && a0 + 500918 <= 0)) && a2 == 2)) || (a0 <= 599970 && ((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 0 < a0 + 61) && 5 == a2)) || (a0 <= 599970 && (a2 == 1 && 0 < a29 + 16) && a29 <= 43)) || (a29 <= 43 && ((a4 + 86 <= 0 && a2 == 4) && 0 < a29 + 16) && 0 < a0 + 61)) || (((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2) && a29 <= 43)) || ((a0 + 99 <= 0 && 0 <= a0 + 366694) && 3 == a2)) || (a0 <= 599970 && 0 < a29 + 16 && a29 <= 43 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || (a29 + 16 <= 0 && a0 + 98 <= 0 && 5 == a2)) || ((((a2 == 4 && (0 < a0 + 61 || a29 + 144 <= 0)) && a4 + 86 <= 0) && a0 <= 599946) && a29 + 16 <= 0)) || (0 <= a0 + 385464 && ((a2 == 3 && a29 <= 43) && 0 <= a0 + 570979) && a0 + 147 <= 0)) || ((((\exists v_prenex_101 : int :: (((v_prenex_101 <= 599970 && 0 <= 10 * (v_prenex_101 / 5) + 3459790) && 0 == v_prenex_101 % 5) && (10 * (v_prenex_101 / 5) + 3459790) / -9 <= a0) && 0 <= 10 * (v_prenex_101 / 5) + 3459800) && 43 < a29) && a0 + 99 <= 0) && 3 == a2)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((5 == a2 && a0 + 98 <= 0) && 0 <= a29)) || (a2 == 2 && (0 < a29 + 16 && a0 + 98 <= 0 && a2 <= 2) && (\exists v_prenex_76 : int :: (((0 <= 10 * (v_prenex_76 / 5) + 3459790 && v_prenex_76 <= 599946) && 0 <= v_prenex_76) && 0 <= 10 * (v_prenex_76 / 5) + 3459800) && (10 * (v_prenex_76 / 5) + 3459790) / -9 <= a0)) - InvariantResult [Line: 23]: Loop Invariant [2018-12-30 23:38:20,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((0 < a29 + 16 && a0 + 98 <= 0 && a2 <= 2) && 0 <= a29) && a2 == 2) || (a0 <= 599970 && ((a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3) && 43 < a29)) || (a0 <= 599946 && a29 <= 43 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((a0 + 98 <= 0 && 43 < a29) && a2 == 4)) || (5 == a2 && a0 + 147 <= 0)) || ((((a0 + 98 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 451092)) || (((a0 + 98 <= 0 && a2 == 1) && 43 < a29) && 0 <= a0 + 366694)) || (((a2 == 4 && 0 <= a0 + 366694) && a29 + 16 <= 0) && a0 + 147 <= 0)) || ((((a29 + 16 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 366694) && a0 + 44 <= 0)) || (a0 <= 599970 && (((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a29 <= 43) && a2 == 2) && a29 + 16 <= 0)) || ((((a2 == 3 && a29 <= 43) && 0 <= a0 + 570979) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || (2 <= a2 && ((a0 <= 599946 && (a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a29 <= 43) || ((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && 43 < a29)))) || (a0 + 147 <= 0 && (0 <= a0 + 366694 || (0 <= a0 + 501326 && a0 + 500918 <= 0)) && a2 == 2)) || (a0 <= 599970 && ((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 0 < a0 + 61) && 5 == a2)) || (a0 <= 599970 && (a2 == 1 && 0 < a29 + 16) && a29 <= 43)) || (a29 <= 43 && ((a4 + 86 <= 0 && a2 == 4) && 0 < a29 + 16) && 0 < a0 + 61)) || (((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2) && a29 <= 43)) || ((a0 + 99 <= 0 && 0 <= a0 + 366694) && 3 == a2)) || (a0 <= 599970 && 0 < a29 + 16 && a29 <= 43 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || (a29 + 16 <= 0 && a0 + 98 <= 0 && 5 == a2)) || ((((a2 == 4 && (0 < a0 + 61 || a29 + 144 <= 0)) && a4 + 86 <= 0) && a0 <= 599946) && a29 + 16 <= 0)) || (0 <= a0 + 385464 && ((a2 == 3 && a29 <= 43) && 0 <= a0 + 570979) && a0 + 147 <= 0)) || ((((\exists v_prenex_101 : int :: (((v_prenex_101 <= 599970 && 0 <= 10 * (v_prenex_101 / 5) + 3459790) && 0 == v_prenex_101 % 5) && (10 * (v_prenex_101 / 5) + 3459790) / -9 <= a0) && 0 <= 10 * (v_prenex_101 / 5) + 3459800) && 43 < a29) && a0 + 99 <= 0) && 3 == a2)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((5 == a2 && a0 + 98 <= 0) && 0 <= a29)) || (a2 == 2 && (0 < a29 + 16 && a0 + 98 <= 0 && a2 <= 2) && (\exists v_prenex_76 : int :: (((0 <= 10 * (v_prenex_76 / 5) + 3459790 && v_prenex_76 <= 599946) && 0 <= v_prenex_76) && 0 <= 10 * (v_prenex_76 / 5) + 3459800) && (10 * (v_prenex_76 / 5) + 3459790) / -9 <= a0)) - InvariantResult [Line: 1658]: Loop Invariant [2018-12-30 23:38:20,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_76,QUANTIFIED] [2018-12-30 23:38:20,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] [2018-12-30 23:38:20,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_101,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a0 <= 599970 && (a29 <= 43 && ((a4 + 86 <= 0 && !(a2 == 4)) && (((0 < a29 + 16 || 0 < a4 + 86) || 0 < a0 + 61) || a29 + 144 <= 0)) && a2 == 3) && 0 < a29 + 16) || ((a0 + 98 <= 0 && 43 < a29) && a2 == 4)) || ((((a0 + 98 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 451092)) || ((43 < a29 && a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 366694)) || (a0 <= 599946 && a29 <= 43 && ((a4 + 86 <= 0 && !(a2 == 4)) && (((0 < a29 + 16 || 0 < a4 + 86) || 0 < a0 + 61) || a29 + 144 <= 0)) && a2 == 3)) || (0 <= a0 + 385464 && ((a0 + 147 <= 0 && a29 <= 43) && 0 <= a0 + 570979) && 3 == a2)) || (((a0 + 98 <= 0 && (0 < a4 + 42 || !(1 == input))) && a2 == 2) && 43 < a29)) || ((a0 + 98 <= 0 && 5 == a2) && 0 <= a29)) || ((((a29 + 16 <= 0 && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 366694) && a0 + 44 <= 0)) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (a0 <= 599970 && ((0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 0 < a0 + 61) && 5 == a2)) || (a0 <= 599970 && ((a29 <= 43 && a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && a2 == 2) && a29 + 16 <= 0)) || (a29 <= 43 && (0 < a29 + 16 && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || ((((a4 + 86 <= 0 && a2 == 4) && 0 < a29 + 16) && 0 < a0 + 61) && a29 <= 43)) || ((a0 + 99 <= 0 && 3 == a2) && 0 <= a0 + 366694)) || ((((a2 == 4 && a4 + 86 <= 0) && (((0 < a29 + 16 || 0 < a4 + 86) || 0 < a0 + 61) || a29 + 144 <= 0)) && a0 <= 599946) && a29 + 16 <= 0)) || (2 <= a2 && ((a0 <= 599946 && a29 <= 43 && a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) || ((a2 <= 2 && a4 + 86 <= 0 && !(a2 == 4)) && 43 < a29)))) || (((a0 + 98 <= 0 && a29 <= 43) && 5 == a2) && a0 + 147 <= 0)) || (((a0 <= 599970 && a2 == 1) && 0 < a29 + 16) && a29 <= 43)) || (a2 == 2 && ((a0 + 147 <= 0 && 0 <= a29) || ((0 < a29 + 16 && a0 + 147 <= 0) && (\exists v_prenex_76 : int :: (((0 <= 10 * (v_prenex_76 / 5) + 3459790 && v_prenex_76 <= 599946) && 0 <= v_prenex_76) && 0 <= 10 * (v_prenex_76 / 5) + 3459800) && (10 * (v_prenex_76 / 5) + 3459790) / -9 <= a0))))) || (a0 <= 599970 && (((a4 + 86 <= 0 && !(a2 == 4)) && (((0 < a29 + 16 || 0 < a4 + 86) || 0 < a0 + 61) || a29 + 144 <= 0)) && 3 == a2) && 43 < a29)) || ((((a0 + 147 <= 0 && a29 <= 43) && 0 <= a0 + 570979) && 3 == a2) && a29 + 16 <= 0)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || (((a2 == 4 && 0 <= a0 + 366694) && a0 + 147 <= 0) && a29 + 16 <= 0)) || ((((0 < a29 + 16 && a29 <= 43) && a0 + 98 <= 0) && 0 <= a0 + 366694) && a2 == 2)) || (((0 <= a0 + 366694 || (0 <= a0 + 501326 && a0 + 500918 <= 0)) && a2 == 2) && a0 + 147 <= 0)) || ((((\exists v_prenex_101 : int :: (((v_prenex_101 <= 599970 && 0 <= 10 * (v_prenex_101 / 5) + 3459790) && 0 == v_prenex_101 % 5) && (10 * (v_prenex_101 / 5) + 3459790) / -9 <= a0) && 0 <= 10 * (v_prenex_101 / 5) + 3459800) && 43 < a29) && a0 + 99 <= 0) && 3 == a2)) || (((a0 + 98 <= 0 && a29 <= 43) && 5 == a2) && a29 + 16 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0) - 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, 589.6s OverallTime, 24 OverallIterations, 12 TraceHistogramMax, 351.0s AutomataDifference, 0.0s DeadEndRemovalTime, 143.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 3230 SDtfs, 39084 SDslu, 2670 SDs, 0 SdLazy, 104542 SolverSat, 7366 SolverUnsat, 94 SolverUnknown, 0 SolverNotchecked, 314.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14677 GetRequests, 14426 SyntacticMatches, 33 SemanticMatches, 218 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22081occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 121330 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 338 NumberOfFragments, 2123 HoareAnnotationTreeSize, 4 FomulaSimplifications, 7879241124 FormulaSimplificationTreeSizeReduction, 16.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9442409320 FormulaSimplificationTreeSizeReductionInter, 126.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 55.7s InterpolantComputationTime, 37597 NumberOfCodeBlocks, 37597 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 37560 ConstructedInterpolants, 1760 QuantifiedInterpolants, 262881686 SizeOfPredicates, 12 NumberOfNonLiveVariables, 16574 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 37 InterpolantComputations, 16 PerfectInterpolantSequences, 73014/89986 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...