java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label09_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:25:18,948 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:25:18,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:25:18,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:25:18,964 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:25:18,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:25:18,967 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:25:18,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:25:18,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:25:18,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:25:18,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:25:18,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:25:18,974 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:25:18,975 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:25:18,976 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:25:18,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:25:18,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:25:18,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:25:18,989 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:25:18,991 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:25:18,994 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:25:18,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:25:19,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:25:19,002 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:25:19,002 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:25:19,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:25:19,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:25:19,008 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:25:19,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:25:19,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:25:19,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:25:19,012 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:25:19,014 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:25:19,014 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:25:19,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:25:19,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:25:19,017 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:25:19,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:25:19,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:25:19,045 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:25:19,046 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:25:19,046 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:25:19,047 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:25:19,047 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:25:19,047 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:25:19,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:25:19,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:25:19,049 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:25:19,049 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:25:19,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:25:19,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:25:19,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:25:19,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:25:19,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:25:19,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:25:19,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:25:19,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:25:19,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:25:19,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:25:19,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:25:19,053 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:25:19,053 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:25:19,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:25:19,054 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:25:19,054 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:25:19,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:25:19,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:25:19,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:25:19,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:25:19,149 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:25:19,150 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label09_true-unreach-call_false-termination.c [2018-11-06 21:25:19,210 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03335ae41/d33e93b935a948879dec7325f8b2a324/FLAGa29ba09e0 [2018-11-06 21:25:19,764 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:25:19,765 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label09_true-unreach-call_false-termination.c [2018-11-06 21:25:19,777 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03335ae41/d33e93b935a948879dec7325f8b2a324/FLAGa29ba09e0 [2018-11-06 21:25:19,792 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03335ae41/d33e93b935a948879dec7325f8b2a324 [2018-11-06 21:25:19,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:25:19,805 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:25:19,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:25:19,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:25:19,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:25:19,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:25:19" (1/1) ... [2018-11-06 21:25:19,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea9c6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:19, skipping insertion in model container [2018-11-06 21:25:19,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:25:19" (1/1) ... [2018-11-06 21:25:19,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:25:19,883 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:25:20,404 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:25:20,408 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:25:20,565 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:25:20,585 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:25:20,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20 WrapperNode [2018-11-06 21:25:20,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:25:20,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:25:20,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:25:20,587 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:25:20,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:25:20,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:25:20,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:25:20,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:25:20,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (1/1) ... [2018-11-06 21:25:20,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:25:20,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:25:20,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:25:20,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:25:20,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (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-11-06 21:25:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:25:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:25:21,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:25:24,624 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:25:24,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:25:24 BoogieIcfgContainer [2018-11-06 21:25:24,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:25:24,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:25:24,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:25:24,631 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:25:24,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:25:19" (1/3) ... [2018-11-06 21:25:24,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c0eab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:25:24, skipping insertion in model container [2018-11-06 21:25:24,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:20" (2/3) ... [2018-11-06 21:25:24,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c0eab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:25:24, skipping insertion in model container [2018-11-06 21:25:24,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:25:24" (3/3) ... [2018-11-06 21:25:24,638 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label09_true-unreach-call_false-termination.c [2018-11-06 21:25:24,648 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:25:24,663 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:25:24,682 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:25:24,729 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:25:24,729 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:25:24,730 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:25:24,730 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:25:24,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:25:24,731 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:25:24,731 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:25:24,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:25:24,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:25:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-11-06 21:25:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-06 21:25:24,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:24,770 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:25:24,772 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:24,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:24,779 INFO L82 PathProgramCache]: Analyzing trace with hash 279835594, now seen corresponding path program 1 times [2018-11-06 21:25:24,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:24,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:24,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:24,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:24,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:25:25,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:25:25,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:25:25,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:25:25,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:25:25,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:25:25,247 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-11-06 21:25:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:28,139 INFO L93 Difference]: Finished difference Result 870 states and 1578 transitions. [2018-11-06 21:25:28,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:25:28,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-06 21:25:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:28,166 INFO L225 Difference]: With dead ends: 870 [2018-11-06 21:25:28,167 INFO L226 Difference]: Without dead ends: 617 [2018-11-06 21:25:28,172 INFO L604 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-11-06 21:25:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-06 21:25:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2018-11-06 21:25:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-06 21:25:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 940 transitions. [2018-11-06 21:25:28,300 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 940 transitions. Word has length 46 [2018-11-06 21:25:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:28,301 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 940 transitions. [2018-11-06 21:25:28,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:25:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 940 transitions. [2018-11-06 21:25:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-06 21:25:28,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:28,316 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:25:28,316 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:28,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1096666001, now seen corresponding path program 1 times [2018-11-06 21:25:28,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:28,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:29,002 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2018-11-06 21:25:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:25:29,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:25:29,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:25:29,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:25:29,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:25:29,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:25:29,157 INFO L87 Difference]: Start difference. First operand 617 states and 940 transitions. Second operand 6 states. [2018-11-06 21:25:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:34,791 INFO L93 Difference]: Finished difference Result 3026 states and 4618 transitions. [2018-11-06 21:25:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:25:34,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-11-06 21:25:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:34,808 INFO L225 Difference]: With dead ends: 3026 [2018-11-06 21:25:34,808 INFO L226 Difference]: Without dead ends: 2411 [2018-11-06 21:25:34,814 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:25:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2018-11-06 21:25:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1870. [2018-11-06 21:25:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2018-11-06 21:25:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2494 transitions. [2018-11-06 21:25:34,880 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2494 transitions. Word has length 155 [2018-11-06 21:25:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:34,881 INFO L480 AbstractCegarLoop]: Abstraction has 1870 states and 2494 transitions. [2018-11-06 21:25:34,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:25:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2494 transitions. [2018-11-06 21:25:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-06 21:25:34,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:34,889 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:25:34,889 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:34,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:34,890 INFO L82 PathProgramCache]: Analyzing trace with hash 256002721, now seen corresponding path program 1 times [2018-11-06 21:25:34,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:34,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:34,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 21:25:35,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:25:35,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:25:35,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:25:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:25:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:25:35,086 INFO L87 Difference]: Start difference. First operand 1870 states and 2494 transitions. Second operand 4 states. [2018-11-06 21:25:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:38,341 INFO L93 Difference]: Finished difference Result 5170 states and 7227 transitions. [2018-11-06 21:25:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:25:38,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-11-06 21:25:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:38,359 INFO L225 Difference]: With dead ends: 5170 [2018-11-06 21:25:38,359 INFO L226 Difference]: Without dead ends: 3302 [2018-11-06 21:25:38,363 INFO L604 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-11-06 21:25:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2018-11-06 21:25:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3302. [2018-11-06 21:25:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3302 states. [2018-11-06 21:25:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4301 transitions. [2018-11-06 21:25:38,433 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4301 transitions. Word has length 222 [2018-11-06 21:25:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:38,434 INFO L480 AbstractCegarLoop]: Abstraction has 3302 states and 4301 transitions. [2018-11-06 21:25:38,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:25:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4301 transitions. [2018-11-06 21:25:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-06 21:25:38,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:38,440 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:25:38,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:38,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1243089956, now seen corresponding path program 1 times [2018-11-06 21:25:38,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:38,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:38,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:38,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:38,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 148 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 21:25:38,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:25:38,846 INFO L225 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-11-06 21:25:38,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:38,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:25:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 21:25:39,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:25:39,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 21:25:39,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:25:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:25:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:25:39,166 INFO L87 Difference]: Start difference. First operand 3302 states and 4301 transitions. Second operand 6 states. [2018-11-06 21:25:40,301 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-11-06 21:25:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:44,478 INFO L93 Difference]: Finished difference Result 9124 states and 11710 transitions. [2018-11-06 21:25:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:25:44,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2018-11-06 21:25:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:44,507 INFO L225 Difference]: With dead ends: 9124 [2018-11-06 21:25:44,508 INFO L226 Difference]: Without dead ends: 5463 [2018-11-06 21:25:44,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:25:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2018-11-06 21:25:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 3285. [2018-11-06 21:25:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3285 states. [2018-11-06 21:25:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 3842 transitions. [2018-11-06 21:25:44,588 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 3842 transitions. Word has length 236 [2018-11-06 21:25:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:44,588 INFO L480 AbstractCegarLoop]: Abstraction has 3285 states and 3842 transitions. [2018-11-06 21:25:44,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:25:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 3842 transitions. [2018-11-06 21:25:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-06 21:25:44,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:44,596 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:25:44,596 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:44,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2076395288, now seen corresponding path program 1 times [2018-11-06 21:25:44,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:44,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:44,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:45,178 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-06 21:25:45,519 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-06 21:25:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 286 proven. 46 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 21:25:45,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:25:45,941 INFO L225 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-11-06 21:25:45,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:46,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:25:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 309 proven. 23 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 21:25:46,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:25:46,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-06 21:25:46,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:25:46,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:25:46,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:25:46,459 INFO L87 Difference]: Start difference. First operand 3285 states and 3842 transitions. Second operand 9 states. [2018-11-06 21:25:48,566 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-11-06 21:25:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:51,010 INFO L93 Difference]: Finished difference Result 6815 states and 7936 transitions. [2018-11-06 21:25:51,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:25:51,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 353 [2018-11-06 21:25:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:51,025 INFO L225 Difference]: With dead ends: 6815 [2018-11-06 21:25:51,025 INFO L226 Difference]: Without dead ends: 3711 [2018-11-06 21:25:51,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:25:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2018-11-06 21:25:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3464. [2018-11-06 21:25:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2018-11-06 21:25:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4021 transitions. [2018-11-06 21:25:51,092 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4021 transitions. Word has length 353 [2018-11-06 21:25:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:51,093 INFO L480 AbstractCegarLoop]: Abstraction has 3464 states and 4021 transitions. [2018-11-06 21:25:51,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:25:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4021 transitions. [2018-11-06 21:25:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-11-06 21:25:51,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:51,104 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:25:51,105 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:51,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1406253511, now seen corresponding path program 1 times [2018-11-06 21:25:51,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:51,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:51,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:51,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:51,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-11-06 21:25:51,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:25:51,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:25:51,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:25:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:25:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:25:51,627 INFO L87 Difference]: Start difference. First operand 3464 states and 4021 transitions. Second operand 3 states. [2018-11-06 21:25:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:52,777 INFO L93 Difference]: Finished difference Result 7105 states and 8305 transitions. [2018-11-06 21:25:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:25:52,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2018-11-06 21:25:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:52,793 INFO L225 Difference]: With dead ends: 7105 [2018-11-06 21:25:52,794 INFO L226 Difference]: Without dead ends: 3822 [2018-11-06 21:25:52,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:25:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2018-11-06 21:25:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3643. [2018-11-06 21:25:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-11-06 21:25:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4246 transitions. [2018-11-06 21:25:52,861 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4246 transitions. Word has length 438 [2018-11-06 21:25:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:52,862 INFO L480 AbstractCegarLoop]: Abstraction has 3643 states and 4246 transitions. [2018-11-06 21:25:52,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:25:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4246 transitions. [2018-11-06 21:25:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-06 21:25:52,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:52,875 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:25:52,880 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:52,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:52,880 INFO L82 PathProgramCache]: Analyzing trace with hash -807291830, now seen corresponding path program 1 times [2018-11-06 21:25:52,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:52,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-06 21:25:53,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:25:53,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:25:53,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:25:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:25:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:25:53,270 INFO L87 Difference]: Start difference. First operand 3643 states and 4246 transitions. Second operand 4 states. [2018-11-06 21:25:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:54,563 INFO L93 Difference]: Finished difference Result 10327 states and 12381 transitions. [2018-11-06 21:25:54,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:25:54,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 459 [2018-11-06 21:25:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:54,593 INFO L225 Difference]: With dead ends: 10327 [2018-11-06 21:25:54,593 INFO L226 Difference]: Without dead ends: 6865 [2018-11-06 21:25:54,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-06 21:25:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6865 states. [2018-11-06 21:25:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6865 to 6865. [2018-11-06 21:25:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6865 states. [2018-11-06 21:25:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6865 states to 6865 states and 7809 transitions. [2018-11-06 21:25:54,714 INFO L78 Accepts]: Start accepts. Automaton has 6865 states and 7809 transitions. Word has length 459 [2018-11-06 21:25:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:54,715 INFO L480 AbstractCegarLoop]: Abstraction has 6865 states and 7809 transitions. [2018-11-06 21:25:54,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:25:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6865 states and 7809 transitions. [2018-11-06 21:25:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-11-06 21:25:54,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:54,727 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:25:54,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:54,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash -772093792, now seen corresponding path program 1 times [2018-11-06 21:25:54,728 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:54,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:54,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:54,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:55,378 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:25:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 1205 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-11-06 21:25:55,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:25:55,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:25:55,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:25:55,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:25:55,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:25:55,855 INFO L87 Difference]: Start difference. First operand 6865 states and 7809 transitions. Second operand 5 states. [2018-11-06 21:25:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:57,747 INFO L93 Difference]: Finished difference Result 14981 states and 17236 transitions. [2018-11-06 21:25:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:25:57,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 651 [2018-11-06 21:25:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:57,784 INFO L225 Difference]: With dead ends: 14981 [2018-11-06 21:25:57,785 INFO L226 Difference]: Without dead ends: 8297 [2018-11-06 21:25:57,795 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:25:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8297 states. [2018-11-06 21:25:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8297 to 8297. [2018-11-06 21:25:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8297 states. [2018-11-06 21:25:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 9329 transitions. [2018-11-06 21:25:57,917 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 9329 transitions. Word has length 651 [2018-11-06 21:25:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:57,918 INFO L480 AbstractCegarLoop]: Abstraction has 8297 states and 9329 transitions. [2018-11-06 21:25:57,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:25:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 9329 transitions. [2018-11-06 21:25:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-11-06 21:25:57,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:57,927 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2018-11-06 21:25:57,927 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:57,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash 736057852, now seen corresponding path program 1 times [2018-11-06 21:25:57,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2018-11-06 21:25:58,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:25:58,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:25:58,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:25:58,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:25:58,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:25:58,824 INFO L87 Difference]: Start difference. First operand 8297 states and 9329 transitions. Second operand 4 states. [2018-11-06 21:26:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:00,963 INFO L93 Difference]: Finished difference Result 18023 states and 20321 transitions. [2018-11-06 21:26:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:26:00,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 713 [2018-11-06 21:26:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:01,000 INFO L225 Difference]: With dead ends: 18023 [2018-11-06 21:26:01,001 INFO L226 Difference]: Without dead ends: 9907 [2018-11-06 21:26:01,009 INFO L604 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-11-06 21:26:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2018-11-06 21:26:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 9907. [2018-11-06 21:26:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9907 states. [2018-11-06 21:26:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9907 states to 9907 states and 10862 transitions. [2018-11-06 21:26:01,137 INFO L78 Accepts]: Start accepts. Automaton has 9907 states and 10862 transitions. Word has length 713 [2018-11-06 21:26:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:01,138 INFO L480 AbstractCegarLoop]: Abstraction has 9907 states and 10862 transitions. [2018-11-06 21:26:01,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:26:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 9907 states and 10862 transitions. [2018-11-06 21:26:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2018-11-06 21:26:01,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:01,148 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:26:01,148 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:01,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1521446553, now seen corresponding path program 1 times [2018-11-06 21:26:01,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:01,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:01,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:01,854 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-06 21:26:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1737 backedges. 663 proven. 372 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-11-06 21:26:03,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:26:03,293 INFO L225 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-11-06 21:26:03,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:03,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:26:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1737 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-11-06 21:26:04,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:26:04,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-11-06 21:26:04,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:26:04,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:26:04,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:26:04,419 INFO L87 Difference]: Start difference. First operand 9907 states and 10862 transitions. Second operand 13 states. [2018-11-06 21:26:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:10,293 INFO L93 Difference]: Finished difference Result 20481 states and 22627 transitions. [2018-11-06 21:26:10,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:26:10,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 769 [2018-11-06 21:26:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:10,318 INFO L225 Difference]: With dead ends: 20481 [2018-11-06 21:26:10,319 INFO L226 Difference]: Without dead ends: 10390 [2018-11-06 21:26:10,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 768 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-11-06 21:26:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10390 states. [2018-11-06 21:26:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10390 to 10262. [2018-11-06 21:26:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10262 states. [2018-11-06 21:26:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10262 states to 10262 states and 11066 transitions. [2018-11-06 21:26:10,453 INFO L78 Accepts]: Start accepts. Automaton has 10262 states and 11066 transitions. Word has length 769 [2018-11-06 21:26:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:10,454 INFO L480 AbstractCegarLoop]: Abstraction has 10262 states and 11066 transitions. [2018-11-06 21:26:10,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 21:26:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 10262 states and 11066 transitions. [2018-11-06 21:26:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2018-11-06 21:26:10,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:10,463 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:10,464 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:10,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1043164057, now seen corresponding path program 1 times [2018-11-06 21:26:10,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:10,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:10,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-11-06 21:26:11,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:11,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:26:11,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:26:11,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:26:11,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:26:11,264 INFO L87 Difference]: Start difference. First operand 10262 states and 11066 transitions. Second operand 5 states. [2018-11-06 21:26:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:12,873 INFO L93 Difference]: Finished difference Result 22325 states and 24082 transitions. [2018-11-06 21:26:12,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:26:12,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 809 [2018-11-06 21:26:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:12,895 INFO L225 Difference]: With dead ends: 22325 [2018-11-06 21:26:12,896 INFO L226 Difference]: Without dead ends: 12065 [2018-11-06 21:26:12,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:26:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12065 states. [2018-11-06 21:26:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12065 to 10982. [2018-11-06 21:26:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10982 states. [2018-11-06 21:26:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10982 states to 10982 states and 11846 transitions. [2018-11-06 21:26:13,047 INFO L78 Accepts]: Start accepts. Automaton has 10982 states and 11846 transitions. Word has length 809 [2018-11-06 21:26:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:13,048 INFO L480 AbstractCegarLoop]: Abstraction has 10982 states and 11846 transitions. [2018-11-06 21:26:13,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:26:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 10982 states and 11846 transitions. [2018-11-06 21:26:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2018-11-06 21:26:13,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:13,058 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:13,059 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:13,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1194644164, now seen corresponding path program 1 times [2018-11-06 21:26:13,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:13,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:13,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:13,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:13,620 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:26:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2243 backedges. 1245 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2018-11-06 21:26:13,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:26:13,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:26:13,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:26:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:26:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:26:13,892 INFO L87 Difference]: Start difference. First operand 10982 states and 11846 transitions. Second operand 4 states. [2018-11-06 21:26:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:15,394 INFO L93 Difference]: Finished difference Result 21783 states and 23510 transitions. [2018-11-06 21:26:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:26:15,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 854 [2018-11-06 21:26:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:15,413 INFO L225 Difference]: With dead ends: 21783 [2018-11-06 21:26:15,413 INFO L226 Difference]: Without dead ends: 10982 [2018-11-06 21:26:15,422 INFO L604 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-11-06 21:26:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10982 states. [2018-11-06 21:26:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10982 to 10982. [2018-11-06 21:26:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10982 states. [2018-11-06 21:26:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10982 states to 10982 states and 11713 transitions. [2018-11-06 21:26:15,548 INFO L78 Accepts]: Start accepts. Automaton has 10982 states and 11713 transitions. Word has length 854 [2018-11-06 21:26:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:15,549 INFO L480 AbstractCegarLoop]: Abstraction has 10982 states and 11713 transitions. [2018-11-06 21:26:15,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:26:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 10982 states and 11713 transitions. [2018-11-06 21:26:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2018-11-06 21:26:15,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:15,561 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:15,561 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:15,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash -267445699, now seen corresponding path program 1 times [2018-11-06 21:26:15,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:15,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:15,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:15,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:15,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:16,360 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:26:16,703 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-11-06 21:26:17,066 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-11-06 21:26:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2492 backedges. 858 proven. 773 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-11-06 21:26:19,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:26:19,027 INFO L225 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-11-06 21:26:19,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:19,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:26:20,510 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 554 DAG size of output: 27 [2018-11-06 21:26:25,887 WARN L179 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 246 DAG size of output: 41 [2018-11-06 21:26:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2492 backedges. 634 proven. 733 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-11-06 21:26:28,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:26:28,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2018-11-06 21:26:28,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 21:26:28,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 21:26:28,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:26:28,049 INFO L87 Difference]: Start difference. First operand 10982 states and 11713 transitions. Second operand 16 states. [2018-11-06 21:26:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:26:54,097 INFO L93 Difference]: Finished difference Result 23251 states and 24787 transitions. [2018-11-06 21:26:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:26:54,098 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 928 [2018-11-06 21:26:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:26:54,117 INFO L225 Difference]: With dead ends: 23251 [2018-11-06 21:26:54,117 INFO L226 Difference]: Without dead ends: 12092 [2018-11-06 21:26:54,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 924 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2018-11-06 21:26:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12092 states. [2018-11-06 21:26:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12092 to 11161. [2018-11-06 21:26:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11161 states. [2018-11-06 21:26:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 11898 transitions. [2018-11-06 21:26:54,321 INFO L78 Accepts]: Start accepts. Automaton has 11161 states and 11898 transitions. Word has length 928 [2018-11-06 21:26:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:26:54,323 INFO L480 AbstractCegarLoop]: Abstraction has 11161 states and 11898 transitions. [2018-11-06 21:26:54,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 21:26:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 11161 states and 11898 transitions. [2018-11-06 21:26:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1059 [2018-11-06 21:26:54,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:26:54,342 INFO L375 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:26:54,342 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:26:54,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:26:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash 950184563, now seen corresponding path program 1 times [2018-11-06 21:26:54,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:26:54,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:26:54,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:54,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:54,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:26:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:55,598 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-06 21:26:56,107 WARN L179 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-11-06 21:26:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3322 backedges. 199 proven. 1861 refuted. 0 times theorem prover too weak. 1262 trivial. 0 not checked. [2018-11-06 21:26:58,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:26:58,405 INFO L225 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-11-06 21:26:58,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:26:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:26:58,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:26:59,322 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 17 [2018-11-06 21:27:05,847 WARN L179 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 188 DAG size of output: 50 [2018-11-06 21:27:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3322 backedges. 489 proven. 351 refuted. 0 times theorem prover too weak. 2482 trivial. 0 not checked. [2018-11-06 21:27:08,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:27:08,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 15 [2018-11-06 21:27:08,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 21:27:08,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 21:27:08,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:27:08,456 INFO L87 Difference]: Start difference. First operand 11161 states and 11898 transitions. Second operand 16 states. [2018-11-06 21:27:23,058 WARN L179 SmtUtils]: Spent 8.88 s on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-11-06 21:27:33,819 WARN L179 SmtUtils]: Spent 10.72 s on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-11-06 21:27:53,365 WARN L179 SmtUtils]: Spent 9.08 s on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2018-11-06 21:27:56,756 WARN L179 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2018-11-06 21:28:16,323 WARN L179 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-06 21:28:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:19,265 INFO L93 Difference]: Finished difference Result 25184 states and 27041 transitions. [2018-11-06 21:28:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-06 21:28:19,266 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1058 [2018-11-06 21:28:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:19,281 INFO L225 Difference]: With dead ends: 25184 [2018-11-06 21:28:19,281 INFO L226 Difference]: Without dead ends: 13838 [2018-11-06 21:28:19,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1056 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=635, Invalid=2017, Unknown=0, NotChecked=0, Total=2652 [2018-11-06 21:28:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13838 states. [2018-11-06 21:28:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13838 to 12059. [2018-11-06 21:28:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12059 states. [2018-11-06 21:28:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12059 states to 12059 states and 12769 transitions. [2018-11-06 21:28:19,447 INFO L78 Accepts]: Start accepts. Automaton has 12059 states and 12769 transitions. Word has length 1058 [2018-11-06 21:28:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:19,448 INFO L480 AbstractCegarLoop]: Abstraction has 12059 states and 12769 transitions. [2018-11-06 21:28:19,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 21:28:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12059 states and 12769 transitions. [2018-11-06 21:28:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2119 [2018-11-06 21:28:19,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:19,496 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:19,497 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:19,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1547180355, now seen corresponding path program 1 times [2018-11-06 21:28:19,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:19,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:19,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14444 backedges. 3095 proven. 0 refuted. 0 times theorem prover too weak. 11349 trivial. 0 not checked. [2018-11-06 21:28:22,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:22,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-06 21:28:22,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:28:22,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:28:22,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:28:22,942 INFO L87 Difference]: Start difference. First operand 12059 states and 12769 transitions. Second operand 7 states. [2018-11-06 21:28:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:25,545 INFO L93 Difference]: Finished difference Result 24960 states and 26477 transitions. [2018-11-06 21:28:25,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:28:25,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2118 [2018-11-06 21:28:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:25,556 INFO L225 Difference]: With dead ends: 24960 [2018-11-06 21:28:25,556 INFO L226 Difference]: Without dead ends: 12054 [2018-11-06 21:28:25,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:28:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2018-11-06 21:28:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 12054. [2018-11-06 21:28:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12054 states. [2018-11-06 21:28:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12054 states to 12054 states and 12717 transitions. [2018-11-06 21:28:25,702 INFO L78 Accepts]: Start accepts. Automaton has 12054 states and 12717 transitions. Word has length 2118 [2018-11-06 21:28:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:25,704 INFO L480 AbstractCegarLoop]: Abstraction has 12054 states and 12717 transitions. [2018-11-06 21:28:25,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:28:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 12054 states and 12717 transitions. [2018-11-06 21:28:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2153 [2018-11-06 21:28:25,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:25,746 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:25,746 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:25,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 372411892, now seen corresponding path program 1 times [2018-11-06 21:28:25,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:25,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:25,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:25,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:25,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14891 backedges. 3466 proven. 39 refuted. 0 times theorem prover too weak. 11386 trivial. 0 not checked. [2018-11-06 21:28:28,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:28,893 INFO L225 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-11-06 21:28:28,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:29,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14891 backedges. 3466 proven. 0 refuted. 0 times theorem prover too weak. 11425 trivial. 0 not checked. [2018-11-06 21:28:31,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:28:31,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 21:28:31,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:28:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:28:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:28:31,389 INFO L87 Difference]: Start difference. First operand 12054 states and 12717 transitions. Second operand 5 states. [2018-11-06 21:28:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:32,873 INFO L93 Difference]: Finished difference Result 23387 states and 24627 transitions. [2018-11-06 21:28:32,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:32,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2152 [2018-11-06 21:28:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:32,879 INFO L225 Difference]: With dead ends: 23387 [2018-11-06 21:28:32,879 INFO L226 Difference]: Without dead ends: 5018 [2018-11-06 21:28:32,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2156 GetRequests, 2153 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-11-06 21:28:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2018-11-06 21:28:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 4660. [2018-11-06 21:28:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2018-11-06 21:28:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 4734 transitions. [2018-11-06 21:28:32,949 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 4734 transitions. Word has length 2152 [2018-11-06 21:28:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:32,951 INFO L480 AbstractCegarLoop]: Abstraction has 4660 states and 4734 transitions. [2018-11-06 21:28:32,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:28:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 4734 transitions. [2018-11-06 21:28:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2213 [2018-11-06 21:28:32,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:32,989 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:32,989 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:32,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:32,990 INFO L82 PathProgramCache]: Analyzing trace with hash 734032280, now seen corresponding path program 1 times [2018-11-06 21:28:32,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:32,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:32,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:32,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:34,384 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-06 21:28:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 3743 proven. 39 refuted. 0 times theorem prover too weak. 11349 trivial. 0 not checked. [2018-11-06 21:28:37,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:37,287 INFO L225 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-11-06 21:28:37,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:37,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 3782 proven. 0 refuted. 0 times theorem prover too weak. 11349 trivial. 0 not checked. [2018-11-06 21:28:40,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:28:40,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-06 21:28:40,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:28:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:28:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:28:40,152 INFO L87 Difference]: Start difference. First operand 4660 states and 4734 transitions. Second operand 10 states. [2018-11-06 21:28:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:43,748 INFO L93 Difference]: Finished difference Result 9324 states and 9475 transitions. [2018-11-06 21:28:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:28:43,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2212 [2018-11-06 21:28:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:43,750 INFO L225 Difference]: With dead ends: 9324 [2018-11-06 21:28:43,750 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:28:43,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2227 GetRequests, 2215 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:28:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:28:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:28:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:28:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:28:43,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2212 [2018-11-06 21:28:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:43,756 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:28:43,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:28:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:28:43,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:28:43,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:28:43,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:43,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:43,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:43,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:43,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,504 WARN L179 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 606 DAG size of output: 294 [2018-11-06 21:28:44,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:44,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:45,124 WARN L179 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 606 DAG size of output: 294 [2018-11-06 21:28:52,803 WARN L179 SmtUtils]: Spent 7.68 s on a formula simplification. DAG size of input: 249 DAG size of output: 103 [2018-11-06 21:29:02,637 WARN L179 SmtUtils]: Spent 9.83 s on a formula simplification. DAG size of input: 249 DAG size of output: 103 [2018-11-06 21:29:02,644 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-06 21:29:02,644 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-06 21:29:02,644 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,644 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,644 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,644 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-06 21:29:02,644 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:29:02,644 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-06 21:29:02,645 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-06 21:29:02,646 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:29:02,646 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:29:02,646 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:29:02,646 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-06 21:29:02,646 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-06 21:29:02,646 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-06 21:29:02,646 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,646 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-06 21:29:02,647 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-06 21:29:02,648 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2018-11-06 21:29:02,648 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-06 21:29:02,648 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,648 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,648 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,648 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-06 21:29:02,648 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:29:02,648 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-06 21:29:02,649 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,650 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-06 21:29:02,651 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-06 21:29:02,652 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:29:02,653 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-06 21:29:02,654 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:29:02,655 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-06 21:29:02,656 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,657 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,658 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,659 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-06 21:29:02,660 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:29:02,660 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:29:02,660 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-06 21:29:02,660 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-06 21:29:02,660 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-06 21:29:02,660 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,660 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,661 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse12 (= ~a15~0 9)) (.cse4 (<= ~a12~0 80)) (.cse2 (<= ~a12~0 11)) (.cse6 (= ~a21~0 6)) (.cse13 (< 80 ~a12~0)) (.cse1 (= ~a21~0 7)) (.cse11 (= ~a21~0 10)) (.cse10 (not (= ~a15~0 8))) (.cse15 (exists ((v_prenex_43 Int)) (and (<= ~a12~0 (+ (mod v_prenex_43 299959) 300039)) (< 80 v_prenex_43) (<= 0 v_prenex_43)))) (.cse16 (= ~a21~0 9)) (.cse17 (<= ~a12~0 73282)) (.cse14 (not (= ~a15~0 5))) (.cse0 (= ~a24~0 1)) (.cse5 (= ~a21~0 8)) (.cse3 (<= ~a15~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse6 (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse9 (mod v_prenex_42 299959))) (let ((.cse8 (div v_prenex_41 5)) (.cse7 (+ .cse9 81))) (and (<= 0 .cse7) (< 11 v_prenex_42) (< 80 v_prenex_41) (< 0 (+ v_prenex_42 43)) (not (= (mod (+ .cse8 4) 5) 0)) (< .cse8 345781) (<= 0 v_prenex_41) (<= 299878 .cse9) (<= 0 v_prenex_42) (<= ~a12~0 (+ (div (+ .cse8 (- 345781)) 5) 1)) (<= v_prenex_41 (+ (div .cse7 5) 165863)))))) .cse10 .cse3) (and .cse0 .cse11 .cse12 .cse2) (and .cse0 .cse12 .cse13) (and .cse0 .cse12 .cse5) (and .cse6 (and (<= (+ ~a12~0 43) 0) .cse0) .cse3) (and (and .cse14 .cse11 .cse15 .cse3) .cse0) (and .cse14 .cse0 .cse5 .cse10 .cse3) (and .cse6 .cse14 .cse0 .cse10 .cse3) (and .cse4 .cse0 .cse3 .cse16) (and .cse4 .cse0 .cse1 .cse10 .cse3) (and .cse6 .cse0 .cse10 (or .cse2 .cse13) .cse3) (and .cse6 .cse0 .cse15 .cse3 .cse13) (and (and .cse17 .cse11 .cse3) .cse0) (and (and .cse14 .cse0 .cse1 .cse3) .cse10) (and (= ~a15~0 7) .cse0 .cse11) (and .cse14 .cse0 .cse10 .cse15 .cse3 .cse16) (and .cse17 .cse14 .cse0 .cse5 .cse3))) [2018-11-06 21:29:02,661 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-06 21:29:02,661 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-06 21:29:02,661 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:29:02,661 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:29:02,661 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-06 21:29:02,661 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:29:02,662 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-06 21:29:02,663 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-06 21:29:02,664 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,664 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,664 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-06 21:29:02,664 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,664 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-06 21:29:02,664 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-06 21:29:02,664 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse12 (= ~a15~0 9)) (.cse4 (<= ~a12~0 80)) (.cse2 (<= ~a12~0 11)) (.cse6 (= ~a21~0 6)) (.cse13 (< 80 ~a12~0)) (.cse1 (= ~a21~0 7)) (.cse11 (= ~a21~0 10)) (.cse10 (not (= ~a15~0 8))) (.cse15 (exists ((v_prenex_43 Int)) (and (<= ~a12~0 (+ (mod v_prenex_43 299959) 300039)) (< 80 v_prenex_43) (<= 0 v_prenex_43)))) (.cse16 (= ~a21~0 9)) (.cse17 (<= ~a12~0 73282)) (.cse14 (not (= ~a15~0 5))) (.cse0 (= ~a24~0 1)) (.cse5 (= ~a21~0 8)) (.cse3 (<= ~a15~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse6 (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse9 (mod v_prenex_42 299959))) (let ((.cse8 (div v_prenex_41 5)) (.cse7 (+ .cse9 81))) (and (<= 0 .cse7) (< 11 v_prenex_42) (< 80 v_prenex_41) (< 0 (+ v_prenex_42 43)) (not (= (mod (+ .cse8 4) 5) 0)) (< .cse8 345781) (<= 0 v_prenex_41) (<= 299878 .cse9) (<= 0 v_prenex_42) (<= ~a12~0 (+ (div (+ .cse8 (- 345781)) 5) 1)) (<= v_prenex_41 (+ (div .cse7 5) 165863)))))) .cse10 .cse3) (and .cse0 .cse11 .cse12 .cse2) (and .cse0 .cse12 .cse13) (and .cse0 .cse12 .cse5) (and .cse6 (and (<= (+ ~a12~0 43) 0) .cse0) .cse3) (and (and .cse14 .cse11 .cse15 .cse3) .cse0) (and .cse14 .cse0 .cse5 .cse10 .cse3) (and .cse6 .cse14 .cse0 .cse10 .cse3) (and .cse4 .cse0 .cse3 .cse16) (and .cse4 .cse0 .cse1 .cse10 .cse3) (and .cse6 .cse0 .cse10 (or .cse2 .cse13) .cse3) (and .cse6 .cse0 .cse15 .cse3 .cse13) (and (and .cse17 .cse11 .cse3) .cse0) (and (and .cse14 .cse0 .cse1 .cse3) .cse10) (and (= ~a15~0 7) .cse0 .cse11) (and .cse14 .cse0 .cse10 .cse15 .cse3 .cse16) (and .cse17 .cse14 .cse0 .cse5 .cse3))) [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-06 21:29:02,665 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-06 21:29:02,666 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:29:02,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:29:02,668 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-06 21:29:02,669 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:29:02,670 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:29:02,670 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:29:02,670 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-06 21:29:02,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,684 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,684 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,684 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,685 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,685 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,685 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,685 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,686 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,686 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,701 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,701 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,701 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,704 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,708 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,708 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,709 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,709 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,709 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,709 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:29:02 BoogieIcfgContainer [2018-11-06 21:29:02,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:29:02,727 INFO L168 Benchmark]: Toolchain (without parser) took 222922.78 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:29:02,728 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:29:02,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:29:02,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 244.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -814.7 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:29:02,730 INFO L168 Benchmark]: Boogie Preprocessor took 125.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:29:02,731 INFO L168 Benchmark]: RCFGBuilder took 3668.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 131.7 MB). Peak memory consumption was 131.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:29:02,731 INFO L168 Benchmark]: TraceAbstraction took 218098.95 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -495.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:29:02,736 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.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 244.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -814.7 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3668.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 131.7 MB). Peak memory consumption was 131.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218098.95 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -495.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 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_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: 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: 880]: Loop Invariant [2018-11-06 21:29:02,749 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,750 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,750 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,750 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,751 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,751 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,751 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,752 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,752 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,752 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,752 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,755 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,755 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,755 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,757 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,757 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,760 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,760 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,760 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,760 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,761 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,761 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,761 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,762 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,762 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,762 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,762 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,762 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8) || (((a12 <= 80 && a24 == 1) && a21 == 8) && a15 <= 8)) || (((a21 == 6 && (\exists v_prenex_41 : int, v_prenex_42 : int :: (((((((((0 <= v_prenex_42 % 299959 + 81 && 11 < v_prenex_42) && 80 < v_prenex_41) && 0 < v_prenex_42 + 43) && !((v_prenex_41 / 5 + 4) % 5 == 0)) && v_prenex_41 / 5 < 345781) && 0 <= v_prenex_41) && 299878 <= v_prenex_42 % 299959) && 0 <= v_prenex_42) && a12 <= (v_prenex_41 / 5 + -345781) / 5 + 1) && v_prenex_41 <= (v_prenex_42 % 299959 + 81) / 5 + 165863)) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || ((a24 == 1 && a15 == 9) && a21 == 8)) || ((a21 == 6 && a12 + 43 <= 0 && a24 == 1) && a15 <= 8)) || ((((!(a15 == 5) && a21 == 10) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43)) && a15 <= 8) && a24 == 1)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (((a12 <= 80 && a24 == 1) && a15 <= 8) && a21 == 9)) || ((((a12 <= 80 && a24 == 1) && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && a24 == 1) && !(a15 == 8)) && (a12 <= 11 || 80 < a12)) && a15 <= 8)) || ((((a21 == 6 && a24 == 1) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43)) && a15 <= 8) && 80 < a12)) || (((a12 <= 73282 && a21 == 10) && a15 <= 8) && a24 == 1)) || ((((!(a15 == 5) && a24 == 1) && a21 == 7) && a15 <= 8) && !(a15 == 8))) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((((!(a15 == 5) && a24 == 1) && !(a15 == 8)) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43)) && a15 <= 8) && a21 == 9)) || ((((a12 <= 73282 && !(a15 == 5)) && a24 == 1) && a21 == 8) && a15 <= 8) - InvariantResult [Line: 20]: Loop Invariant [2018-11-06 21:29:02,766 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,766 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,766 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,767 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,767 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,767 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,767 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,768 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,768 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,768 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,768 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,769 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,769 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,769 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,769 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,769 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,770 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,770 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,770 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,770 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,770 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,772 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,772 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,773 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,773 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,773 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,774 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,774 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,774 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,774 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,775 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,775 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:29:02,775 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-11-06 21:29:02,775 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,776 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,776 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,776 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,776 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,777 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,777 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,777 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-11-06 21:29:02,777 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8) || (((a12 <= 80 && a24 == 1) && a21 == 8) && a15 <= 8)) || (((a21 == 6 && (\exists v_prenex_41 : int, v_prenex_42 : int :: (((((((((0 <= v_prenex_42 % 299959 + 81 && 11 < v_prenex_42) && 80 < v_prenex_41) && 0 < v_prenex_42 + 43) && !((v_prenex_41 / 5 + 4) % 5 == 0)) && v_prenex_41 / 5 < 345781) && 0 <= v_prenex_41) && 299878 <= v_prenex_42 % 299959) && 0 <= v_prenex_42) && a12 <= (v_prenex_41 / 5 + -345781) / 5 + 1) && v_prenex_41 <= (v_prenex_42 % 299959 + 81) / 5 + 165863)) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || ((a24 == 1 && a15 == 9) && a21 == 8)) || ((a21 == 6 && a12 + 43 <= 0 && a24 == 1) && a15 <= 8)) || ((((!(a15 == 5) && a21 == 10) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43)) && a15 <= 8) && a24 == 1)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (((a12 <= 80 && a24 == 1) && a15 <= 8) && a21 == 9)) || ((((a12 <= 80 && a24 == 1) && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && a24 == 1) && !(a15 == 8)) && (a12 <= 11 || 80 < a12)) && a15 <= 8)) || ((((a21 == 6 && a24 == 1) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43)) && a15 <= 8) && 80 < a12)) || (((a12 <= 73282 && a21 == 10) && a15 <= 8) && a24 == 1)) || ((((!(a15 == 5) && a24 == 1) && a21 == 7) && a15 <= 8) && !(a15 == 8))) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((((!(a15 == 5) && a24 == 1) && !(a15 == 8)) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43)) && a15 <= 8) && a21 == 9)) || ((((a12 <= 73282 && !(a15 == 5)) && a24 == 1) && a21 == 8) && a15 <= 8) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 217.9s OverallTime, 17 OverallIterations, 18 TraceHistogramMax, 142.1s AutomataDifference, 0.0s DeadEndRemovalTime, 18.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2458 SDtfs, 22313 SDslu, 2934 SDs, 0 SdLazy, 38366 SolverSat, 5313 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 88.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7897 GetRequests, 7720 SyntacticMatches, 23 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 63.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12059occurred in iteration=14, 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: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 7424 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 174 NumberOfFragments, 787 HoareAnnotationTreeSize, 3 FomulaSimplifications, 53716 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 8076 FormulaSimplificationTreeSizeReductionInter, 17.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 38.1s InterpolantComputationTime, 21881 NumberOfCodeBlocks, 21881 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 21857 ConstructedInterpolants, 228 QuantifiedInterpolants, 88648186 SizeOfPredicates, 13 NumberOfNonLiveVariables, 9323 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 95755/99997 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...