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_label50_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:27:35,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:27:35,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:27:35,221 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:27:35,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:27:35,222 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:27:35,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:27:35,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:27:35,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:27:35,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:27:35,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:27:35,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:27:35,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:27:35,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:27:35,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:27:35,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:27:35,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:27:35,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:27:35,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:27:35,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:27:35,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:27:35,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:27:35,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:27:35,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:27:35,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:27:35,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:27:35,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:27:35,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:27:35,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:27:35,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:27:35,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:27:35,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:27:35,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:27:35,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:27:35,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:27:35,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:27:35,253 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:27:35,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:27:35,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:27:35,269 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:27:35,270 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:27:35,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:27:35,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:27:35,271 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:27:35,271 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:27:35,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:27:35,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:27:35,271 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:27:35,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:27:35,272 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:27:35,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:27:35,272 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:27:35,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:27:35,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:27:35,273 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:27:35,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:27:35,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:27:35,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:27:35,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:27:35,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:27:35,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:27:35,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:27:35,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:27:35,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:27:35,275 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:27:35,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:27:35,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:27:35,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:27:35,336 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:27:35,337 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:27:35,338 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2018-11-06 21:27:35,407 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928162260/1319a319840b43deaa3b5f8b362744bf/FLAG24c50d650 [2018-11-06 21:27:36,033 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:27:36,034 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2018-11-06 21:27:36,048 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928162260/1319a319840b43deaa3b5f8b362744bf/FLAG24c50d650 [2018-11-06 21:27:36,064 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928162260/1319a319840b43deaa3b5f8b362744bf [2018-11-06 21:27:36,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:27:36,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:27:36,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:27:36,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:27:36,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:27:36,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:36,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b29a96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36, skipping insertion in model container [2018-11-06 21:27:36,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:36,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:27:36,164 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:27:36,651 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:27:36,656 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:27:36,856 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:27:36,883 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:27:36,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36 WrapperNode [2018-11-06 21:27:36,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:27:36,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:27:36,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:27:36,885 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:27:36,898 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:27:36" (1/1) ... [2018-11-06 21:27:37,049 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:27:36" (1/1) ... [2018-11-06 21:27:37,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:27:37,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:27:37,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:27:37,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:27:37,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:37,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:37,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:37,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:37,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:37,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:37,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2018-11-06 21:27:37,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:27:37,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:27:37,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:27:37,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:27:37,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (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:27:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:27:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:27:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:27:40,767 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:27:40,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:40 BoogieIcfgContainer [2018-11-06 21:27:40,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:27:40,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:27:40,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:27:40,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:27:40,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:27:36" (1/3) ... [2018-11-06 21:27:40,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3673a2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:40, skipping insertion in model container [2018-11-06 21:27:40,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (2/3) ... [2018-11-06 21:27:40,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3673a2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:40, skipping insertion in model container [2018-11-06 21:27:40,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:40" (3/3) ... [2018-11-06 21:27:40,778 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label50_true-unreach-call_false-termination.c [2018-11-06 21:27:40,789 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:27:40,801 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:27:40,820 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:27:40,863 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:27:40,863 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:27:40,863 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:27:40,864 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:27:40,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:27:40,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:27:40,864 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:27:40,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:27:40,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:27:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-11-06 21:27:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-06 21:27:40,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:40,899 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] [2018-11-06 21:27:40,902 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:40,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash -387853398, now seen corresponding path program 1 times [2018-11-06 21:27:40,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:40,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:41,341 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:27:41,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:41,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:27:41,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:27:41,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:27:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:27:41,367 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-11-06 21:27:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:44,562 INFO L93 Difference]: Finished difference Result 870 states and 1578 transitions. [2018-11-06 21:27:44,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:27:44,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-06 21:27:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:44,589 INFO L225 Difference]: With dead ends: 870 [2018-11-06 21:27:44,589 INFO L226 Difference]: Without dead ends: 617 [2018-11-06 21:27:44,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:27:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-06 21:27:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2018-11-06 21:27:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-06 21:27:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 940 transitions. [2018-11-06 21:27:44,685 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 940 transitions. Word has length 38 [2018-11-06 21:27:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:44,686 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 940 transitions. [2018-11-06 21:27:44,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:27:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 940 transitions. [2018-11-06 21:27:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-06 21:27:44,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:44,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:44,699 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:44,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1913323023, now seen corresponding path program 1 times [2018-11-06 21:27:44,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:44,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:44,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:44,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:44,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:27:45,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:45,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:27:45,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:27:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:27:45,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:27:45,357 INFO L87 Difference]: Start difference. First operand 617 states and 940 transitions. Second operand 6 states. [2018-11-06 21:27:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:50,745 INFO L93 Difference]: Finished difference Result 3026 states and 4618 transitions. [2018-11-06 21:27:50,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:27:50,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2018-11-06 21:27:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:50,761 INFO L225 Difference]: With dead ends: 3026 [2018-11-06 21:27:50,761 INFO L226 Difference]: Without dead ends: 2411 [2018-11-06 21:27:50,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:27:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2018-11-06 21:27:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1870. [2018-11-06 21:27:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2018-11-06 21:27:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2494 transitions. [2018-11-06 21:27:50,844 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2494 transitions. Word has length 147 [2018-11-06 21:27:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:50,845 INFO L480 AbstractCegarLoop]: Abstraction has 1870 states and 2494 transitions. [2018-11-06 21:27:50,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:27:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2494 transitions. [2018-11-06 21:27:50,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-06 21:27:50,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:50,851 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, 2, 2, 2, 2, 2, 2, 2, 2, 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:27:50,852 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:50,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:50,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1563967103, now seen corresponding path program 1 times [2018-11-06 21:27:50,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:50,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:50,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:50,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:50,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 21:27:51,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:51,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:27:51,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:27:51,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:27:51,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:27:51,033 INFO L87 Difference]: Start difference. First operand 1870 states and 2494 transitions. Second operand 4 states. [2018-11-06 21:27:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:54,109 INFO L93 Difference]: Finished difference Result 5170 states and 7227 transitions. [2018-11-06 21:27:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:27:54,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-11-06 21:27:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:54,127 INFO L225 Difference]: With dead ends: 5170 [2018-11-06 21:27:54,127 INFO L226 Difference]: Without dead ends: 3302 [2018-11-06 21:27:54,130 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:27:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2018-11-06 21:27:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3302. [2018-11-06 21:27:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3302 states. [2018-11-06 21:27:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4301 transitions. [2018-11-06 21:27:54,195 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4301 transitions. Word has length 214 [2018-11-06 21:27:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:54,195 INFO L480 AbstractCegarLoop]: Abstraction has 3302 states and 4301 transitions. [2018-11-06 21:27:54,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:27:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4301 transitions. [2018-11-06 21:27:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-06 21:27:54,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:54,201 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:27:54,201 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:54,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1007823356, now seen corresponding path program 1 times [2018-11-06 21:27:54,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:54,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 140 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 21:27:54,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:27:54,519 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:27:54,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:54,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:27:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-06 21:27:54,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:27:54,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:27:54,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:27:54,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:27:54,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:27:54,795 INFO L87 Difference]: Start difference. First operand 3302 states and 4301 transitions. Second operand 6 states. [2018-11-06 21:28:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:05,634 INFO L93 Difference]: Finished difference Result 9155 states and 11800 transitions. [2018-11-06 21:28:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:28:05,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2018-11-06 21:28:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:05,658 INFO L225 Difference]: With dead ends: 9155 [2018-11-06 21:28:05,659 INFO L226 Difference]: Without dead ends: 5284 [2018-11-06 21:28:05,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:28:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5284 states. [2018-11-06 21:28:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5284 to 3285. [2018-11-06 21:28:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3285 states. [2018-11-06 21:28:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 3679 transitions. [2018-11-06 21:28:05,739 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 3679 transitions. Word has length 228 [2018-11-06 21:28:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:05,740 INFO L480 AbstractCegarLoop]: Abstraction has 3285 states and 3679 transitions. [2018-11-06 21:28:05,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:28:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 3679 transitions. [2018-11-06 21:28:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-06 21:28:05,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:05,748 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:28:05,748 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:05,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:05,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1637886600, now seen corresponding path program 1 times [2018-11-06 21:28:05,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:05,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:05,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:05,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:06,354 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-06 21:28:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 270 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 21:28:06,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:06,741 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:28:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:06,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-06 21:28:07,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:28:07,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 21:28:07,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:28:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:28:07,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:28:07,033 INFO L87 Difference]: Start difference. First operand 3285 states and 3679 transitions. Second operand 8 states. [2018-11-06 21:28:10,340 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-11-06 21:28:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:15,457 INFO L93 Difference]: Finished difference Result 8020 states and 9093 transitions. [2018-11-06 21:28:15,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 21:28:15,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 345 [2018-11-06 21:28:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:15,479 INFO L225 Difference]: With dead ends: 8020 [2018-11-06 21:28:15,479 INFO L226 Difference]: Without dead ends: 4736 [2018-11-06 21:28:15,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:28:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4736 states. [2018-11-06 21:28:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4736 to 4537. [2018-11-06 21:28:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2018-11-06 21:28:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 4998 transitions. [2018-11-06 21:28:15,556 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 4998 transitions. Word has length 345 [2018-11-06 21:28:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:15,557 INFO L480 AbstractCegarLoop]: Abstraction has 4537 states and 4998 transitions. [2018-11-06 21:28:15,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:28:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 4998 transitions. [2018-11-06 21:28:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-11-06 21:28:15,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:15,570 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 21:28:15,571 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:15,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2081368363, now seen corresponding path program 1 times [2018-11-06 21:28:15,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:15,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:15,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:15,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-06 21:28:16,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:16,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:28:16,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:28:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:28:16,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:28:16,290 INFO L87 Difference]: Start difference. First operand 4537 states and 4998 transitions. Second operand 7 states. [2018-11-06 21:28:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:17,867 INFO L93 Difference]: Finished difference Result 9314 states and 10286 transitions. [2018-11-06 21:28:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:28:17,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 513 [2018-11-06 21:28:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:17,884 INFO L225 Difference]: With dead ends: 9314 [2018-11-06 21:28:17,885 INFO L226 Difference]: Without dead ends: 4355 [2018-11-06 21:28:17,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4355 states. [2018-11-06 21:28:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4355 to 4355. [2018-11-06 21:28:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4355 states. [2018-11-06 21:28:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 4745 transitions. [2018-11-06 21:28:17,954 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 4745 transitions. Word has length 513 [2018-11-06 21:28:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:17,955 INFO L480 AbstractCegarLoop]: Abstraction has 4355 states and 4745 transitions. [2018-11-06 21:28:17,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:28:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 4745 transitions. [2018-11-06 21:28:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-11-06 21:28:17,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:17,971 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-11-06 21:28:17,972 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:17,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash -325385925, now seen corresponding path program 1 times [2018-11-06 21:28:17,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:17,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-06 21:28:18,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:18,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:28:18,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:18,399 INFO L87 Difference]: Start difference. First operand 4355 states and 4745 transitions. Second operand 4 states. [2018-11-06 21:28:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:19,767 INFO L93 Difference]: Finished difference Result 11393 states and 12676 transitions. [2018-11-06 21:28:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:19,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 640 [2018-11-06 21:28:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:19,789 INFO L225 Difference]: With dead ends: 11393 [2018-11-06 21:28:19,789 INFO L226 Difference]: Without dead ends: 7219 [2018-11-06 21:28:19,793 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:28:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7219 states. [2018-11-06 21:28:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7219 to 7219. [2018-11-06 21:28:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7219 states. [2018-11-06 21:28:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7219 states to 7219 states and 7846 transitions. [2018-11-06 21:28:19,893 INFO L78 Accepts]: Start accepts. Automaton has 7219 states and 7846 transitions. Word has length 640 [2018-11-06 21:28:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:19,894 INFO L480 AbstractCegarLoop]: Abstraction has 7219 states and 7846 transitions. [2018-11-06 21:28:19,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:28:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7219 states and 7846 transitions. [2018-11-06 21:28:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2018-11-06 21:28:19,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:19,921 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:28:19,921 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:19,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1329105499, now seen corresponding path program 1 times [2018-11-06 21:28:19,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:19,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:19,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:19,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:19,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-11-06 21:28:20,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:20,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:28:20,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:20,952 INFO L87 Difference]: Start difference. First operand 7219 states and 7846 transitions. Second operand 4 states. [2018-11-06 21:28:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:23,109 INFO L93 Difference]: Finished difference Result 14257 states and 15510 transitions. [2018-11-06 21:28:23,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:23,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 832 [2018-11-06 21:28:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:23,132 INFO L225 Difference]: With dead ends: 14257 [2018-11-06 21:28:23,132 INFO L226 Difference]: Without dead ends: 7219 [2018-11-06 21:28:23,140 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:28:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7219 states. [2018-11-06 21:28:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7219 to 7219. [2018-11-06 21:28:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7219 states. [2018-11-06 21:28:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7219 states to 7219 states and 7622 transitions. [2018-11-06 21:28:23,234 INFO L78 Accepts]: Start accepts. Automaton has 7219 states and 7622 transitions. Word has length 832 [2018-11-06 21:28:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:23,235 INFO L480 AbstractCegarLoop]: Abstraction has 7219 states and 7622 transitions. [2018-11-06 21:28:23,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:28:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 7219 states and 7622 transitions. [2018-11-06 21:28:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-11-06 21:28:23,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:23,250 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:23,250 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:23,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:23,251 INFO L82 PathProgramCache]: Analyzing trace with hash 496632342, now seen corresponding path program 1 times [2018-11-06 21:28:23,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:23,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:23,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:23,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:23,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2371 backedges. 1540 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-06 21:28:24,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:24,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:28:24,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:24,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:24,338 INFO L87 Difference]: Start difference. First operand 7219 states and 7622 transitions. Second operand 4 states. [2018-11-06 21:28:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:26,448 INFO L93 Difference]: Finished difference Result 15689 states and 16624 transitions. [2018-11-06 21:28:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:26,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 886 [2018-11-06 21:28:26,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:26,465 INFO L225 Difference]: With dead ends: 15689 [2018-11-06 21:28:26,466 INFO L226 Difference]: Without dead ends: 8651 [2018-11-06 21:28:26,475 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:28:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8651 states. [2018-11-06 21:28:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8651 to 8651. [2018-11-06 21:28:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8651 states. [2018-11-06 21:28:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8651 states to 8651 states and 9095 transitions. [2018-11-06 21:28:26,597 INFO L78 Accepts]: Start accepts. Automaton has 8651 states and 9095 transitions. Word has length 886 [2018-11-06 21:28:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:26,598 INFO L480 AbstractCegarLoop]: Abstraction has 8651 states and 9095 transitions. [2018-11-06 21:28:26,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:28:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 8651 states and 9095 transitions. [2018-11-06 21:28:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1059 [2018-11-06 21:28:26,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:26,624 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:26,624 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:26,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2056836584, now seen corresponding path program 1 times [2018-11-06 21:28:26,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:26,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:26,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3605 backedges. 1108 proven. 0 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2018-11-06 21:28:27,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:27,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:28:27,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:27,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:27,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:27,818 INFO L87 Difference]: Start difference. First operand 8651 states and 9095 transitions. Second operand 4 states. [2018-11-06 21:28:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:28,974 INFO L93 Difference]: Finished difference Result 18016 states and 19003 transitions. [2018-11-06 21:28:28,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:28,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1058 [2018-11-06 21:28:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:28,992 INFO L225 Difference]: With dead ends: 18016 [2018-11-06 21:28:28,992 INFO L226 Difference]: Without dead ends: 9004 [2018-11-06 21:28:29,001 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:28:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9004 states. [2018-11-06 21:28:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9004 to 8646. [2018-11-06 21:28:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8646 states. [2018-11-06 21:28:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8646 states to 8646 states and 9005 transitions. [2018-11-06 21:28:29,101 INFO L78 Accepts]: Start accepts. Automaton has 8646 states and 9005 transitions. Word has length 1058 [2018-11-06 21:28:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:29,102 INFO L480 AbstractCegarLoop]: Abstraction has 8646 states and 9005 transitions. [2018-11-06 21:28:29,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:28:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8646 states and 9005 transitions. [2018-11-06 21:28:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1107 [2018-11-06 21:28:29,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:29,123 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 7, 7, 7, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:29,124 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:29,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash 234601072, now seen corresponding path program 1 times [2018-11-06 21:28:29,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:29,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:29,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:29,854 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-06 21:28:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3842 backedges. 2488 proven. 0 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2018-11-06 21:28:30,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:30,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:28:30,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:28:30,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:28:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:28:30,527 INFO L87 Difference]: Start difference. First operand 8646 states and 9005 transitions. Second operand 5 states. [2018-11-06 21:28:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:31,981 INFO L93 Difference]: Finished difference Result 18912 states and 19728 transitions. [2018-11-06 21:28:31,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:28:31,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1106 [2018-11-06 21:28:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:31,994 INFO L225 Difference]: With dead ends: 18912 [2018-11-06 21:28:31,995 INFO L226 Difference]: Without dead ends: 10447 [2018-11-06 21:28:32,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:28:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10447 states. [2018-11-06 21:28:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10447 to 9368. [2018-11-06 21:28:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9368 states. [2018-11-06 21:28:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9368 states to 9368 states and 9752 transitions. [2018-11-06 21:28:32,111 INFO L78 Accepts]: Start accepts. Automaton has 9368 states and 9752 transitions. Word has length 1106 [2018-11-06 21:28:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:32,112 INFO L480 AbstractCegarLoop]: Abstraction has 9368 states and 9752 transitions. [2018-11-06 21:28:32,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:28:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 9368 states and 9752 transitions. [2018-11-06 21:28:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1448 [2018-11-06 21:28:32,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:32,137 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:32,138 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:32,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash -997113547, now seen corresponding path program 1 times [2018-11-06 21:28:32,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:32,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:32,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:32,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:32,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 5800 trivial. 0 not checked. [2018-11-06 21:28:34,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:34,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:28:34,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:34,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:34,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:34,182 INFO L87 Difference]: Start difference. First operand 9368 states and 9752 transitions. Second operand 4 states. [2018-11-06 21:28:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:35,398 INFO L93 Difference]: Finished difference Result 22847 states and 23792 transitions. [2018-11-06 21:28:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:35,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1447 [2018-11-06 21:28:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:35,415 INFO L225 Difference]: With dead ends: 22847 [2018-11-06 21:28:35,416 INFO L226 Difference]: Without dead ends: 10961 [2018-11-06 21:28:35,428 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 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:28:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10961 states. [2018-11-06 21:28:35,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10961 to 10782. [2018-11-06 21:28:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10782 states. [2018-11-06 21:28:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10782 states to 10782 states and 11123 transitions. [2018-11-06 21:28:35,551 INFO L78 Accepts]: Start accepts. Automaton has 10782 states and 11123 transitions. Word has length 1447 [2018-11-06 21:28:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:35,552 INFO L480 AbstractCegarLoop]: Abstraction has 10782 states and 11123 transitions. [2018-11-06 21:28:35,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:28:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 10782 states and 11123 transitions. [2018-11-06 21:28:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1648 [2018-11-06 21:28:35,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:35,587 INFO L375 BasicCegarLoop]: trace histogram [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, 14, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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:35,587 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:35,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1771443447, now seen corresponding path program 1 times [2018-11-06 21:28:35,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:35,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8591 backedges. 3526 proven. 444 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-11-06 21:28:38,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:38,780 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:28:38,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:39,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8591 backedges. 3598 proven. 372 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-11-06 21:28:41,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:28:41,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-06 21:28:41,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:28:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:28:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:28:41,269 INFO L87 Difference]: Start difference. First operand 10782 states and 11123 transitions. Second operand 9 states. [2018-11-06 21:28:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:46,960 INFO L93 Difference]: Finished difference Result 23719 states and 24503 transitions. [2018-11-06 21:28:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:28:46,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1647 [2018-11-06 21:28:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:46,979 INFO L225 Difference]: With dead ends: 23719 [2018-11-06 21:28:46,979 INFO L226 Difference]: Without dead ends: 12758 [2018-11-06 21:28:46,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1663 GetRequests, 1650 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:28:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12758 states. [2018-11-06 21:28:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12758 to 11501. [2018-11-06 21:28:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11501 states. [2018-11-06 21:28:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11501 states to 11501 states and 11821 transitions. [2018-11-06 21:28:47,115 INFO L78 Accepts]: Start accepts. Automaton has 11501 states and 11821 transitions. Word has length 1647 [2018-11-06 21:28:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:47,117 INFO L480 AbstractCegarLoop]: Abstraction has 11501 states and 11821 transitions. [2018-11-06 21:28:47,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:28:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 11501 states and 11821 transitions. [2018-11-06 21:28:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1822 [2018-11-06 21:28:47,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:47,157 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:47,157 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:47,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash -494298241, now seen corresponding path program 1 times [2018-11-06 21:28:47,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:47,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:47,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10214 backedges. 4394 proven. 0 refuted. 0 times theorem prover too weak. 5820 trivial. 0 not checked. [2018-11-06 21:28:49,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:49,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:28:49,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:49,364 INFO L87 Difference]: Start difference. First operand 11501 states and 11821 transitions. Second operand 4 states. [2018-11-06 21:28:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:50,523 INFO L93 Difference]: Finished difference Result 19582 states and 20098 transitions. [2018-11-06 21:28:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:50,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1821 [2018-11-06 21:28:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:50,526 INFO L225 Difference]: With dead ends: 19582 [2018-11-06 21:28:50,526 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:28:50,538 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:28:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:28:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:28:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:28:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:28:50,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1821 [2018-11-06 21:28:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:50,539 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:28:50,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:28:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:28:50,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:28:50,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:28:50,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:50,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:50,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:50,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:50,713 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 147 [2018-11-06 21:28:50,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:50,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:50,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:50,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:28:50,931 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 147 [2018-11-06 21:28:52,765 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 140 DAG size of output: 89 [2018-11-06 21:28:54,059 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 140 DAG size of output: 89 [2018-11-06 21:28:54,062 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-06 21:28:54,063 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,064 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,065 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,066 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-06 21:28:54,067 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:28:54,068 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-06 21:28:54,069 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-06 21:28:54,070 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,071 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,072 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,073 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,074 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,074 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-06 21:28:54,074 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:28:54,074 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:28:54,074 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:28:54,074 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-06 21:28:54,074 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-06 21:28:54,074 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-06 21:28:54,075 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-06 21:28:54,076 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-06 21:28:54,077 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-06 21:28:54,077 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,077 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,077 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse20 (= ~a21~0 10)) (.cse18 (= ~a21~0 7)) (.cse22 (+ ~a12~0 43)) (.cse0 (= ~a15~0 8))) (let ((.cse12 (not (= 7 ~a15~0))) (.cse9 (not .cse0)) (.cse17 (<= .cse22 0)) (.cse19 (<= 9 ~a15~0)) (.cse2 (<= ~a12~0 11)) (.cse3 (< 0 .cse22)) (.cse8 (= ~a21~0 8)) (.cse16 (= ~a15~0 7)) (.cse5 (<= ~a12~0 72)) (.cse14 (not .cse18)) (.cse6 (<= 19 ~a12~0)) (.cse13 (<= ~a15~0 8)) (.cse11 (<= ~a21~0 6)) (.cse7 (<= ~a12~0 73282)) (.cse4 (= ~a15~0 5)) (.cse15 (not .cse20)) (.cse10 (< 80 ~a12~0)) (.cse1 (= ~a24~0 1)) (.cse21 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse2) (and .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8) (and .cse1 .cse9 .cse10 (= ~a21~0 9)) (and (<= ~a12~0 95434) (<= 95381 ~a12~0) .cse1 .cse11) (and .cse1 .cse8 (<= (+ ~a12~0 526767) 0)) (and .cse12 .cse1 .cse2 .cse13 .cse14 .cse15) (and .cse1 .cse8 .cse5 .cse6) (and .cse16 (and (and .cse17 .cse1) .cse18)) (and .cse1 .cse19 .cse20 .cse2) (and .cse1 .cse20 .cse4 .cse10) (and .cse1 .cse8 .cse2 .cse3) (and (and (or (and .cse1 .cse19 .cse20 .cse10) (and .cse13 .cse21 .cse11)) .cse12) .cse9) (and .cse1 .cse4 .cse8) (and (and .cse17 .cse0 .cse1) .cse20) (and .cse16 .cse1 .cse20) (or (and .cse1 .cse19 .cse8 .cse10) (and .cse1 .cse18 .cse10)) (and .cse1 .cse20 .cse2 .cse3) (and (<= ~a12~0 80) .cse0 .cse1 .cse14 .cse15) (and .cse16 .cse1 .cse8) (and .cse16 .cse1 .cse5 .cse14 .cse6) (and .cse1 .cse13 .cse11) (and .cse7 .cse1 .cse4 .cse15) (and .cse0 .cse1 .cse20 .cse10) (and .cse0 .cse1 .cse21)))) [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-06 21:28:54,078 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,079 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,079 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-11-06 21:28:54,079 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-06 21:28:54,079 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-06 21:28:54,079 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:28:54,079 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:28:54,079 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-06 21:28:54,079 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-06 21:28:54,079 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:28:54,080 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-06 21:28:54,081 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-06 21:28:54,081 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,081 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,081 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-06 21:28:54,081 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,081 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-06 21:28:54,081 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-06 21:28:54,082 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse20 (= ~a21~0 10)) (.cse18 (= ~a21~0 7)) (.cse22 (+ ~a12~0 43)) (.cse0 (= ~a15~0 8))) (let ((.cse12 (not (= 7 ~a15~0))) (.cse9 (not .cse0)) (.cse17 (<= .cse22 0)) (.cse19 (<= 9 ~a15~0)) (.cse2 (<= ~a12~0 11)) (.cse3 (< 0 .cse22)) (.cse8 (= ~a21~0 8)) (.cse16 (= ~a15~0 7)) (.cse5 (<= ~a12~0 72)) (.cse14 (not .cse18)) (.cse6 (<= 19 ~a12~0)) (.cse13 (<= ~a15~0 8)) (.cse11 (<= ~a21~0 6)) (.cse7 (<= ~a12~0 73282)) (.cse4 (= ~a15~0 5)) (.cse15 (not .cse20)) (.cse10 (< 80 ~a12~0)) (.cse1 (= ~a24~0 1)) (.cse21 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse2) (and .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8) (and .cse1 .cse9 .cse10 (= ~a21~0 9)) (and (<= ~a12~0 95434) (<= 95381 ~a12~0) .cse1 .cse11) (and .cse1 .cse8 (<= (+ ~a12~0 526767) 0)) (and .cse12 .cse1 .cse2 .cse13 .cse14 .cse15) (and .cse1 .cse8 .cse5 .cse6) (and .cse16 (and (and .cse17 .cse1) .cse18)) (and .cse1 .cse19 .cse20 .cse2) (and .cse1 .cse20 .cse4 .cse10) (and .cse1 .cse8 .cse2 .cse3) (and (and (or (and .cse1 .cse19 .cse20 .cse10) (and .cse13 .cse21 .cse11)) .cse12) .cse9) (and .cse1 .cse4 .cse8) (and (and .cse17 .cse0 .cse1) .cse20) (and .cse16 .cse1 .cse20) (or (and .cse1 .cse19 .cse8 .cse10) (and .cse1 .cse18 .cse10)) (and .cse1 .cse20 .cse2 .cse3) (and (<= ~a12~0 80) .cse0 .cse1 .cse14 .cse15) (and .cse16 .cse1 .cse8) (and .cse16 .cse1 .cse5 .cse14 .cse6) (and .cse1 .cse13 .cse11) (and .cse7 .cse1 .cse4 .cse15) (and .cse0 .cse1 .cse20 .cse10) (and .cse0 .cse1 .cse21)))) [2018-11-06 21:28:54,082 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-06 21:28:54,082 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-06 21:28:54,082 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:28:54,082 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:28:54,082 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-06 21:28:54,082 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-06 21:28:54,082 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-06 21:28:54,082 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-06 21:28:54,083 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:28:54,084 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-06 21:28:54,085 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,086 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,087 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:28:54,087 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-06 21:28:54,087 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:28:54,087 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:28:54,087 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:28:54,087 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-06 21:28:54,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:28:54 BoogieIcfgContainer [2018-11-06 21:28:54,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:28:54,117 INFO L168 Benchmark]: Toolchain (without parser) took 78040.74 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 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-11-06 21:28:54,118 INFO L168 Benchmark]: CDTParser took 0.23 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:28:54,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.10 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:28:54,119 INFO L168 Benchmark]: Boogie Procedure Inliner took 259.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.7 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:28:54,121 INFO L168 Benchmark]: Boogie Preprocessor took 115.19 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:28:54,121 INFO L168 Benchmark]: RCFGBuilder took 3508.82 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: 119.4 MB). Peak memory consumption was 119.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:28:54,122 INFO L168 Benchmark]: TraceAbstraction took 73345.93 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 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:28:54,127 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.23 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 806.10 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 259.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.7 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.19 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3508.82 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: 119.4 MB). Peak memory consumption was 119.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73345.93 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 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: 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 Derived loop invariant: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a12 <= 11) && 0 < a12 + 43) || ((a24 == 1 && a15 == 5) && a12 <= 11)) || (((a24 == 1 && a15 == 5) && a12 <= 72) && 19 <= a12)) || (((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8)) || (((a24 == 1 && !(a15 == 8)) && 80 < a12) && a21 == 9)) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || ((a24 == 1 && a21 == 8) && a12 + 526767 <= 0)) || (((((!(7 == a15) && a24 == 1) && a12 <= 11) && a15 <= 8) && !(a21 == 7)) && !(a21 == 10))) || (((a24 == 1 && a21 == 8) && a12 <= 72) && 19 <= a12)) || (a15 == 7 && (a12 + 43 <= 0 && a24 == 1) && a21 == 7)) || (((a24 == 1 && 9 <= a15) && a21 == 10) && a12 <= 11)) || (((a24 == 1 && a21 == 10) && a15 == 5) && 80 < a12)) || (((a24 == 1 && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((((a24 == 1 && 9 <= a15) && a21 == 10) && 80 < a12) || ((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6)) && !(7 == a15)) && !(a15 == 8))) || ((a24 == 1 && a15 == 5) && a21 == 8)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 == 10)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a24 == 1 && 9 <= a15) && a21 == 8) && 80 < a12) || ((a24 == 1 && a21 == 7) && 80 < a12)) || (((a24 == 1 && a21 == 10) && a12 <= 11) && 0 < a12 + 43)) || ((((a12 <= 80 && a15 == 8) && a24 == 1) && !(a21 == 7)) && !(a21 == 10))) || ((a15 == 7 && a24 == 1) && a21 == 8)) || ((((a15 == 7 && a24 == 1) && a12 <= 72) && !(a21 == 7)) && 19 <= a12)) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) || (((a12 <= 73282 && a24 == 1) && a15 == 5) && !(a21 == 10))) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || ((a15 == 8 && a24 == 1) && a12 + 49 <= 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a12 <= 11) && 0 < a12 + 43) || ((a24 == 1 && a15 == 5) && a12 <= 11)) || (((a24 == 1 && a15 == 5) && a12 <= 72) && 19 <= a12)) || (((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8)) || (((a24 == 1 && !(a15 == 8)) && 80 < a12) && a21 == 9)) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || ((a24 == 1 && a21 == 8) && a12 + 526767 <= 0)) || (((((!(7 == a15) && a24 == 1) && a12 <= 11) && a15 <= 8) && !(a21 == 7)) && !(a21 == 10))) || (((a24 == 1 && a21 == 8) && a12 <= 72) && 19 <= a12)) || (a15 == 7 && (a12 + 43 <= 0 && a24 == 1) && a21 == 7)) || (((a24 == 1 && 9 <= a15) && a21 == 10) && a12 <= 11)) || (((a24 == 1 && a21 == 10) && a15 == 5) && 80 < a12)) || (((a24 == 1 && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((((a24 == 1 && 9 <= a15) && a21 == 10) && 80 < a12) || ((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6)) && !(7 == a15)) && !(a15 == 8))) || ((a24 == 1 && a15 == 5) && a21 == 8)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 == 10)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a24 == 1 && 9 <= a15) && a21 == 8) && 80 < a12) || ((a24 == 1 && a21 == 7) && 80 < a12)) || (((a24 == 1 && a21 == 10) && a12 <= 11) && 0 < a12 + 43)) || ((((a12 <= 80 && a15 == 8) && a24 == 1) && !(a21 == 7)) && !(a21 == 10))) || ((a15 == 7 && a24 == 1) && a21 == 8)) || ((((a15 == 7 && a24 == 1) && a12 <= 72) && !(a21 == 7)) && 19 <= a12)) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) || (((a12 <= 73282 && a24 == 1) && a15 == 5) && !(a21 == 10))) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || ((a15 == 8 && a24 == 1) && a12 + 49 <= 0) - 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, 73.2s OverallTime, 14 OverallIterations, 15 TraceHistogramMax, 49.1s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2288 SDtfs, 8463 SDslu, 1702 SDs, 0 SdLazy, 24772 SolverSat, 2647 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2314 GetRequests, 2245 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11501occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 5612 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 156 NumberOfFragments, 779 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5812 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2952 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 13142 NumberOfCodeBlocks, 13142 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 13125 ConstructedInterpolants, 0 QuantifiedInterpolants, 26969950 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2740 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 48143/49010 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...