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/Problem17_label57_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:33:35,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:33:35,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:33:35,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:33:35,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:33:35,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:33:35,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:33:35,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:33:35,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:33:35,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:33:35,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:33:35,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:33:35,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:33:35,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:33:35,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:33:35,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:33:35,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:33:35,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:33:35,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:33:35,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:33:35,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:33:35,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:33:35,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:33:35,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:33:35,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:33:35,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:33:35,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:33:35,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:33:35,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:33:35,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:33:35,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:33:35,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:33:35,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:33:35,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:33:35,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:33:35,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:33:35,204 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 19:33:35,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:33:35,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:33:35,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:33:35,222 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:33:35,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:33:35,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:33:35,223 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:33:35,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:33:35,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:33:35,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:33:35,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:33:35,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:33:35,224 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:33:35,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:33:35,224 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:33:35,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:33:35,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:33:35,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:33:35,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:33:35,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:33:35,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:33:35,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:33:35,226 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:33:35,226 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:33:35,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:33:35,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:33:35,226 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:33:35,227 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:33:35,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:33:35,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:33:35,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:33:35,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:33:35,323 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:33:35,324 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label57_false-unreach-call.c [2018-11-06 19:33:35,384 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f00b0e77/428244dd192d49d1a4e7e02a27256e67/FLAGa60629dad [2018-11-06 19:33:36,156 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:33:36,157 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label57_false-unreach-call.c [2018-11-06 19:33:36,186 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f00b0e77/428244dd192d49d1a4e7e02a27256e67/FLAGa60629dad [2018-11-06 19:33:36,210 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f00b0e77/428244dd192d49d1a4e7e02a27256e67 [2018-11-06 19:33:36,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:33:36,229 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:33:36,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:33:36,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:33:36,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:33:36,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:33:36" (1/1) ... [2018-11-06 19:33:36,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35039c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:36, skipping insertion in model container [2018-11-06 19:33:36,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:33:36" (1/1) ... [2018-11-06 19:33:36,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:33:36,398 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:33:37,392 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:33:37,397 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:33:37,851 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:33:37,877 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:33:37,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37 WrapperNode [2018-11-06 19:33:37,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:33:37,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:33:37,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:33:37,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:33:37,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:33:38,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:33:38,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:33:38,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:33:38,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (1/1) ... [2018-11-06 19:33:38,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:33:38,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:33:38,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:33:38,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:33:38,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (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 19:33:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:33:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:33:38,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:33:48,520 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:33:48,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:33:48 BoogieIcfgContainer [2018-11-06 19:33:48,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:33:48,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:33:48,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:33:48,526 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:33:48,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:33:36" (1/3) ... [2018-11-06 19:33:48,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b58e941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:33:48, skipping insertion in model container [2018-11-06 19:33:48,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:37" (2/3) ... [2018-11-06 19:33:48,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b58e941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:33:48, skipping insertion in model container [2018-11-06 19:33:48,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:33:48" (3/3) ... [2018-11-06 19:33:48,530 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label57_false-unreach-call.c [2018-11-06 19:33:48,541 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:33:48,550 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:33:48,566 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:33:48,608 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:33:48,609 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:33:48,609 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:33:48,609 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:33:48,609 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:33:48,609 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:33:48,610 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:33:48,610 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:33:48,610 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:33:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 19:33:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-06 19:33:48,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:33:48,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:33:48,660 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:33:48,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:33:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash 670581594, now seen corresponding path program 1 times [2018-11-06 19:33:48,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:33:48,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:33:48,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:33:48,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:33:48,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:33:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:33:49,023 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 19:33:49,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:33:49,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:33:49,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:33:49,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:33:49,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:33:49,048 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 19:33:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:33:57,611 INFO L93 Difference]: Finished difference Result 2126 states and 3956 transitions. [2018-11-06 19:33:57,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:33:57,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-06 19:33:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:33:57,652 INFO L225 Difference]: With dead ends: 2126 [2018-11-06 19:33:57,652 INFO L226 Difference]: Without dead ends: 1528 [2018-11-06 19:33:57,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:33:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-11-06 19:33:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1048. [2018-11-06 19:33:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-11-06 19:33:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1826 transitions. [2018-11-06 19:33:57,789 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1826 transitions. Word has length 18 [2018-11-06 19:33:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:33:57,790 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1826 transitions. [2018-11-06 19:33:57,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:33:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1826 transitions. [2018-11-06 19:33:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-06 19:33:57,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:33:57,795 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:33:57,797 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:33:57,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:33:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash -659555608, now seen corresponding path program 1 times [2018-11-06 19:33:57,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:33:57,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:33:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:33:57,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:33:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:33:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:33:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:33:58,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:33:58,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:33:58,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:33:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:33:58,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:33:58,129 INFO L87 Difference]: Start difference. First operand 1048 states and 1826 transitions. Second operand 4 states. [2018-11-06 19:34:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:06,451 INFO L93 Difference]: Finished difference Result 3810 states and 6822 transitions. [2018-11-06 19:34:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:34:06,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-06 19:34:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:06,467 INFO L225 Difference]: With dead ends: 3810 [2018-11-06 19:34:06,468 INFO L226 Difference]: Without dead ends: 2764 [2018-11-06 19:34:06,474 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 19:34:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2018-11-06 19:34:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2018-11-06 19:34:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2764 states. [2018-11-06 19:34:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 4043 transitions. [2018-11-06 19:34:06,537 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 4043 transitions. Word has length 90 [2018-11-06 19:34:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:06,538 INFO L480 AbstractCegarLoop]: Abstraction has 2764 states and 4043 transitions. [2018-11-06 19:34:06,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:34:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 4043 transitions. [2018-11-06 19:34:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-06 19:34:06,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:06,546 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:34:06,546 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:06,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash 483122712, now seen corresponding path program 1 times [2018-11-06 19:34:06,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:06,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:06,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:34:06,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:34:06,977 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 19:34:06,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:07,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:34:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:34:07,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:34:07,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-11-06 19:34:07,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:34:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:34:07,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:34:07,412 INFO L87 Difference]: Start difference. First operand 2764 states and 4043 transitions. Second operand 5 states. [2018-11-06 19:34:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:18,777 INFO L93 Difference]: Finished difference Result 11102 states and 16163 transitions. [2018-11-06 19:34:18,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:34:18,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-11-06 19:34:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:18,819 INFO L225 Difference]: With dead ends: 11102 [2018-11-06 19:34:18,819 INFO L226 Difference]: Without dead ends: 6550 [2018-11-06 19:34:18,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:34:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2018-11-06 19:34:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6549. [2018-11-06 19:34:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6549 states. [2018-11-06 19:34:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 7902 transitions. [2018-11-06 19:34:18,948 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 7902 transitions. Word has length 174 [2018-11-06 19:34:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:18,954 INFO L480 AbstractCegarLoop]: Abstraction has 6549 states and 7902 transitions. [2018-11-06 19:34:18,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:34:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 7902 transitions. [2018-11-06 19:34:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-06 19:34:18,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:18,963 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:34:18,965 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:18,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2094923541, now seen corresponding path program 1 times [2018-11-06 19:34:18,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:18,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:18,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:18,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:18,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 19:34:19,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:19,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:34:19,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:34:19,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:34:19,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:34:19,228 INFO L87 Difference]: Start difference. First operand 6549 states and 7902 transitions. Second operand 3 states. [2018-11-06 19:34:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:21,622 INFO L93 Difference]: Finished difference Result 12662 states and 15359 transitions. [2018-11-06 19:34:21,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:34:21,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-11-06 19:34:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:21,651 INFO L225 Difference]: With dead ends: 12662 [2018-11-06 19:34:21,651 INFO L226 Difference]: Without dead ends: 6548 [2018-11-06 19:34:21,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:34:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2018-11-06 19:34:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 6548. [2018-11-06 19:34:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2018-11-06 19:34:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 7482 transitions. [2018-11-06 19:34:21,774 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 7482 transitions. Word has length 240 [2018-11-06 19:34:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:21,775 INFO L480 AbstractCegarLoop]: Abstraction has 6548 states and 7482 transitions. [2018-11-06 19:34:21,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:34:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 7482 transitions. [2018-11-06 19:34:21,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-06 19:34:21,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:21,783 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:34:21,784 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:21,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1222067300, now seen corresponding path program 1 times [2018-11-06 19:34:21,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:21,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:21,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:21,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:21,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 323 proven. 83 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-06 19:34:22,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:34:22,619 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 19:34:22,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:22,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:34:24,484 WARN L179 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 866 DAG size of output: 23 [2018-11-06 19:34:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-11-06 19:34:24,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:34:24,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:34:24,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:34:24,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:34:24,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:34:24,712 INFO L87 Difference]: Start difference. First operand 6548 states and 7482 transitions. Second operand 6 states. [2018-11-06 19:34:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:38,466 INFO L93 Difference]: Finished difference Result 28044 states and 32177 transitions. [2018-11-06 19:34:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:34:38,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 353 [2018-11-06 19:34:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:38,524 INFO L225 Difference]: With dead ends: 28044 [2018-11-06 19:34:38,524 INFO L226 Difference]: Without dead ends: 18914 [2018-11-06 19:34:38,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:34:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18914 states. [2018-11-06 19:34:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18914 to 14631. [2018-11-06 19:34:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14631 states. [2018-11-06 19:34:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14631 states to 14631 states and 16037 transitions. [2018-11-06 19:34:38,781 INFO L78 Accepts]: Start accepts. Automaton has 14631 states and 16037 transitions. Word has length 353 [2018-11-06 19:34:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:38,781 INFO L480 AbstractCegarLoop]: Abstraction has 14631 states and 16037 transitions. [2018-11-06 19:34:38,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:34:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 14631 states and 16037 transitions. [2018-11-06 19:34:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-11-06 19:34:38,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:38,795 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:38,795 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:38,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash 322321842, now seen corresponding path program 1 times [2018-11-06 19:34:38,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:38,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:38,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:38,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:38,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:39,280 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-06 19:34:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-06 19:34:39,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:39,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:34:39,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:34:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:34:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:34:39,553 INFO L87 Difference]: Start difference. First operand 14631 states and 16037 transitions. Second operand 3 states. [2018-11-06 19:34:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:42,796 INFO L93 Difference]: Finished difference Result 37355 states and 41131 transitions. [2018-11-06 19:34:42,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:34:42,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 430 [2018-11-06 19:34:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:42,840 INFO L225 Difference]: With dead ends: 37355 [2018-11-06 19:34:42,841 INFO L226 Difference]: Without dead ends: 22720 [2018-11-06 19:34:42,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:34:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22720 states. [2018-11-06 19:34:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22720 to 22716. [2018-11-06 19:34:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22716 states. [2018-11-06 19:34:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22716 states to 22716 states and 24523 transitions. [2018-11-06 19:34:43,164 INFO L78 Accepts]: Start accepts. Automaton has 22716 states and 24523 transitions. Word has length 430 [2018-11-06 19:34:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:43,165 INFO L480 AbstractCegarLoop]: Abstraction has 22716 states and 24523 transitions. [2018-11-06 19:34:43,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:34:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 22716 states and 24523 transitions. [2018-11-06 19:34:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-11-06 19:34:43,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:43,182 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:43,182 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:43,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:43,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2125171592, now seen corresponding path program 1 times [2018-11-06 19:34:43,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:43,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:43,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:43,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:43,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-06 19:34:43,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:43,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:34:43,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:34:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:34:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:34:43,838 INFO L87 Difference]: Start difference. First operand 22716 states and 24523 transitions. Second operand 3 states. [2018-11-06 19:34:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:47,543 INFO L93 Difference]: Finished difference Result 53097 states and 57429 transitions. [2018-11-06 19:34:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:34:47,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 455 [2018-11-06 19:34:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:47,588 INFO L225 Difference]: With dead ends: 53097 [2018-11-06 19:34:47,588 INFO L226 Difference]: Without dead ends: 30810 [2018-11-06 19:34:47,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:34:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30810 states. [2018-11-06 19:34:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30810 to 23132. [2018-11-06 19:34:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23132 states. [2018-11-06 19:34:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23132 states to 23132 states and 24944 transitions. [2018-11-06 19:34:47,920 INFO L78 Accepts]: Start accepts. Automaton has 23132 states and 24944 transitions. Word has length 455 [2018-11-06 19:34:47,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:47,921 INFO L480 AbstractCegarLoop]: Abstraction has 23132 states and 24944 transitions. [2018-11-06 19:34:47,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:34:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23132 states and 24944 transitions. [2018-11-06 19:34:47,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-11-06 19:34:47,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:47,944 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:34:47,944 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:47,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:47,945 INFO L82 PathProgramCache]: Analyzing trace with hash 289460499, now seen corresponding path program 1 times [2018-11-06 19:34:47,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:47,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:47,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:47,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:47,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-11-06 19:34:48,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:48,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:34:48,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:34:48,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:34:48,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:34:48,568 INFO L87 Difference]: Start difference. First operand 23132 states and 24944 transitions. Second operand 5 states. [2018-11-06 19:34:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:55,071 INFO L93 Difference]: Finished difference Result 64187 states and 69406 transitions. [2018-11-06 19:34:55,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:34:55,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 490 [2018-11-06 19:34:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:55,109 INFO L225 Difference]: With dead ends: 64187 [2018-11-06 19:34:55,110 INFO L226 Difference]: Without dead ends: 40206 [2018-11-06 19:34:55,128 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 19:34:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40206 states. [2018-11-06 19:34:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40206 to 33384. [2018-11-06 19:34:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33384 states. [2018-11-06 19:34:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33384 states to 33384 states and 35889 transitions. [2018-11-06 19:34:55,509 INFO L78 Accepts]: Start accepts. Automaton has 33384 states and 35889 transitions. Word has length 490 [2018-11-06 19:34:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:55,510 INFO L480 AbstractCegarLoop]: Abstraction has 33384 states and 35889 transitions. [2018-11-06 19:34:55,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:34:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33384 states and 35889 transitions. [2018-11-06 19:34:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-11-06 19:34:55,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:55,533 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:34:55,533 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2019481928, now seen corresponding path program 1 times [2018-11-06 19:34:55,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 208 proven. 344 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-06 19:34:56,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:34:56,262 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 19:34:56,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:56,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:34:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 379 proven. 83 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-06 19:34:57,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:34:57,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-11-06 19:34:57,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:34:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:34:57,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:34:57,104 INFO L87 Difference]: Start difference. First operand 33384 states and 35889 transitions. Second operand 9 states. [2018-11-06 19:35:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:04,045 INFO L93 Difference]: Finished difference Result 72123 states and 77337 transitions. [2018-11-06 19:35:04,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:35:04,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 495 [2018-11-06 19:35:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:04,081 INFO L225 Difference]: With dead ends: 72123 [2018-11-06 19:35:04,081 INFO L226 Difference]: Without dead ends: 38741 [2018-11-06 19:35:04,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 494 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-06 19:35:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38741 states. [2018-11-06 19:35:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38741 to 37217. [2018-11-06 19:35:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37217 states. [2018-11-06 19:35:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37217 states to 37217 states and 39848 transitions. [2018-11-06 19:35:04,526 INFO L78 Accepts]: Start accepts. Automaton has 37217 states and 39848 transitions. Word has length 495 [2018-11-06 19:35:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:04,526 INFO L480 AbstractCegarLoop]: Abstraction has 37217 states and 39848 transitions. [2018-11-06 19:35:04,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:35:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 37217 states and 39848 transitions. [2018-11-06 19:35:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-11-06 19:35:04,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:04,542 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:35:04,543 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:04,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:04,543 INFO L82 PathProgramCache]: Analyzing trace with hash 507428842, now seen corresponding path program 1 times [2018-11-06 19:35:04,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:04,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:04,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:04,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:05,149 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-06 19:35:05,619 WARN L179 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-11-06 19:35:06,112 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-11-06 19:35:06,714 WARN L179 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-11-06 19:35:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 399 proven. 83 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-06 19:35:07,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:35:07,702 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:35:07,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:07,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:35:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 399 proven. 83 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-06 19:35:09,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:35:09,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-11-06 19:35:09,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 19:35:09,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 19:35:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-06 19:35:09,180 INFO L87 Difference]: Start difference. First operand 37217 states and 39848 transitions. Second operand 13 states. [2018-11-06 19:35:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:19,895 INFO L93 Difference]: Finished difference Result 81059 states and 86883 transitions. [2018-11-06 19:35:19,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 19:35:19,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 515 [2018-11-06 19:35:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:19,936 INFO L225 Difference]: With dead ends: 81059 [2018-11-06 19:35:19,936 INFO L226 Difference]: Without dead ends: 45974 [2018-11-06 19:35:19,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-06 19:35:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45974 states. [2018-11-06 19:35:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45974 to 44454. [2018-11-06 19:35:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44454 states. [2018-11-06 19:35:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44454 states to 44454 states and 47286 transitions. [2018-11-06 19:35:20,361 INFO L78 Accepts]: Start accepts. Automaton has 44454 states and 47286 transitions. Word has length 515 [2018-11-06 19:35:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:20,361 INFO L480 AbstractCegarLoop]: Abstraction has 44454 states and 47286 transitions. [2018-11-06 19:35:20,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 19:35:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 44454 states and 47286 transitions. [2018-11-06 19:35:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-11-06 19:35:20,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:20,381 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:35:20,382 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:20,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash -536300365, now seen corresponding path program 1 times [2018-11-06 19:35:20,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:20,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:20,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:20,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:20,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 661 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-06 19:35:21,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:21,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:35:21,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:35:21,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:35:21,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:35:21,020 INFO L87 Difference]: Start difference. First operand 44454 states and 47286 transitions. Second operand 3 states. [2018-11-06 19:35:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:23,606 INFO L93 Difference]: Finished difference Result 87202 states and 92818 transitions. [2018-11-06 19:35:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:35:23,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 629 [2018-11-06 19:35:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:23,653 INFO L225 Difference]: With dead ends: 87202 [2018-11-06 19:35:23,653 INFO L226 Difference]: Without dead ends: 44880 [2018-11-06 19:35:23,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:35:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44880 states. [2018-11-06 19:35:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44880 to 44880. [2018-11-06 19:35:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44880 states. [2018-11-06 19:35:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44880 states to 44880 states and 47716 transitions. [2018-11-06 19:35:24,507 INFO L78 Accepts]: Start accepts. Automaton has 44880 states and 47716 transitions. Word has length 629 [2018-11-06 19:35:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:24,507 INFO L480 AbstractCegarLoop]: Abstraction has 44880 states and 47716 transitions. [2018-11-06 19:35:24,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:35:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 44880 states and 47716 transitions. [2018-11-06 19:35:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-11-06 19:35:24,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:24,526 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:24,527 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:24,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1398222246, now seen corresponding path program 1 times [2018-11-06 19:35:24,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:24,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:24,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-11-06 19:35:25,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:25,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:35:25,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:35:25,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:35:25,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:35:25,169 INFO L87 Difference]: Start difference. First operand 44880 states and 47716 transitions. Second operand 4 states. [2018-11-06 19:35:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:29,304 INFO L93 Difference]: Finished difference Result 104712 states and 111973 transitions. [2018-11-06 19:35:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:35:29,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 651 [2018-11-06 19:35:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:29,364 INFO L225 Difference]: With dead ends: 104712 [2018-11-06 19:35:29,364 INFO L226 Difference]: Without dead ends: 61961 [2018-11-06 19:35:29,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:35:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61961 states. [2018-11-06 19:35:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61961 to 58537. [2018-11-06 19:35:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58537 states. [2018-11-06 19:35:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58537 states to 58537 states and 61540 transitions. [2018-11-06 19:35:29,930 INFO L78 Accepts]: Start accepts. Automaton has 58537 states and 61540 transitions. Word has length 651 [2018-11-06 19:35:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:29,931 INFO L480 AbstractCegarLoop]: Abstraction has 58537 states and 61540 transitions. [2018-11-06 19:35:29,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:35:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 58537 states and 61540 transitions. [2018-11-06 19:35:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2018-11-06 19:35:29,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:29,947 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 19:35:29,947 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:29,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2005766395, now seen corresponding path program 1 times [2018-11-06 19:35:29,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:29,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:29,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2018-11-06 19:35:30,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:30,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:35:30,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:35:30,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:35:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:35:30,997 INFO L87 Difference]: Start difference. First operand 58537 states and 61540 transitions. Second operand 3 states. [2018-11-06 19:35:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:33,568 INFO L93 Difference]: Finished difference Result 122612 states and 129359 transitions. [2018-11-06 19:35:33,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:35:33,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 671 [2018-11-06 19:35:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:33,640 INFO L225 Difference]: With dead ends: 122612 [2018-11-06 19:35:33,640 INFO L226 Difference]: Without dead ends: 66207 [2018-11-06 19:35:33,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:35:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66207 states. [2018-11-06 19:35:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66207 to 63647. [2018-11-06 19:35:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63647 states. [2018-11-06 19:35:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63647 states to 63647 states and 66749 transitions. [2018-11-06 19:35:34,253 INFO L78 Accepts]: Start accepts. Automaton has 63647 states and 66749 transitions. Word has length 671 [2018-11-06 19:35:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:34,254 INFO L480 AbstractCegarLoop]: Abstraction has 63647 states and 66749 transitions. [2018-11-06 19:35:34,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:35:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 63647 states and 66749 transitions. [2018-11-06 19:35:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2018-11-06 19:35:34,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:34,270 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:35:34,270 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:34,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash -375388349, now seen corresponding path program 1 times [2018-11-06 19:35:34,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:34,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:34,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-06 19:35:35,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:35,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:35:35,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:35:35,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:35:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:35:35,075 INFO L87 Difference]: Start difference. First operand 63647 states and 66749 transitions. Second operand 5 states. [2018-11-06 19:35:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:42,682 INFO L93 Difference]: Finished difference Result 144773 states and 151945 transitions. [2018-11-06 19:35:42,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:35:42,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 738 [2018-11-06 19:35:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:42,767 INFO L225 Difference]: With dead ends: 144773 [2018-11-06 19:35:42,767 INFO L226 Difference]: Without dead ends: 83258 [2018-11-06 19:35:42,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:35:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83258 states. [2018-11-06 19:35:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83258 to 64925. [2018-11-06 19:35:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64925 states. [2018-11-06 19:35:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64925 states to 64925 states and 68103 transitions. [2018-11-06 19:35:43,428 INFO L78 Accepts]: Start accepts. Automaton has 64925 states and 68103 transitions. Word has length 738 [2018-11-06 19:35:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:43,429 INFO L480 AbstractCegarLoop]: Abstraction has 64925 states and 68103 transitions. [2018-11-06 19:35:43,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:35:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 64925 states and 68103 transitions. [2018-11-06 19:35:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2018-11-06 19:35:43,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:43,443 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:43,443 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:43,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash -225984292, now seen corresponding path program 1 times [2018-11-06 19:35:43,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:43,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:43,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:44,506 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 6 [2018-11-06 19:35:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 558 proven. 149 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 19:35:45,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:35:45,576 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:35:45,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:45,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:35:49,443 WARN L179 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 1068 DAG size of output: 33 [2018-11-06 19:35:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 558 proven. 149 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 19:35:52,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:35:52,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-06 19:35:52,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:35:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:35:52,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:35:52,775 INFO L87 Difference]: Start difference. First operand 64925 states and 68103 transitions. Second operand 7 states. [2018-11-06 19:36:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:07,896 INFO L93 Difference]: Finished difference Result 155916 states and 163695 transitions. [2018-11-06 19:36:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 19:36:07,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 776 [2018-11-06 19:36:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:08,013 INFO L225 Difference]: With dead ends: 155916 [2018-11-06 19:36:08,013 INFO L226 Difference]: Without dead ends: 92696 [2018-11-06 19:36:08,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 782 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-06 19:36:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92696 states. [2018-11-06 19:36:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92696 to 66190. [2018-11-06 19:36:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66190 states. [2018-11-06 19:36:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66190 states to 66190 states and 68892 transitions. [2018-11-06 19:36:08,926 INFO L78 Accepts]: Start accepts. Automaton has 66190 states and 68892 transitions. Word has length 776 [2018-11-06 19:36:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:08,927 INFO L480 AbstractCegarLoop]: Abstraction has 66190 states and 68892 transitions. [2018-11-06 19:36:08,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:36:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 66190 states and 68892 transitions. [2018-11-06 19:36:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2018-11-06 19:36:08,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:08,947 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:36:08,947 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:08,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -586985948, now seen corresponding path program 1 times [2018-11-06 19:36:08,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:08,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 656 proven. 248 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-06 19:36:10,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:36:10,510 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:36:10,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:10,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:36:11,200 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 25 [2018-11-06 19:36:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2018-11-06 19:36:14,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:36:14,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-11-06 19:36:14,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:36:14,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:36:14,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:36:14,217 INFO L87 Difference]: Start difference. First operand 66190 states and 68892 transitions. Second operand 9 states. [2018-11-06 19:37:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:37:14,411 INFO L93 Difference]: Finished difference Result 159698 states and 166011 transitions. [2018-11-06 19:37:14,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 19:37:14,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 809 [2018-11-06 19:37:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:37:14,515 INFO L225 Difference]: With dead ends: 159698 [2018-11-06 19:37:14,515 INFO L226 Difference]: Without dead ends: 95214 [2018-11-06 19:37:14,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 814 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-06 19:37:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95214 states. [2018-11-06 19:37:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95214 to 84097. [2018-11-06 19:37:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84097 states. [2018-11-06 19:37:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84097 states to 84097 states and 87051 transitions. [2018-11-06 19:37:15,734 INFO L78 Accepts]: Start accepts. Automaton has 84097 states and 87051 transitions. Word has length 809 [2018-11-06 19:37:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:37:15,735 INFO L480 AbstractCegarLoop]: Abstraction has 84097 states and 87051 transitions. [2018-11-06 19:37:15,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:37:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 84097 states and 87051 transitions. [2018-11-06 19:37:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2018-11-06 19:37:15,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:37:15,757 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:37:15,757 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:37:15,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:37:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash -770628989, now seen corresponding path program 1 times [2018-11-06 19:37:15,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:37:15,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:37:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:15,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:15,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 1492 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-06 19:37:17,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:37:17,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:37:17,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:37:17,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:37:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:37:17,008 INFO L87 Difference]: Start difference. First operand 84097 states and 87051 transitions. Second operand 5 states. [2018-11-06 19:37:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:37:23,167 INFO L93 Difference]: Finished difference Result 189098 states and 195749 transitions. [2018-11-06 19:37:23,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:37:23,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 847 [2018-11-06 19:37:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:37:23,285 INFO L225 Difference]: With dead ends: 189098 [2018-11-06 19:37:23,285 INFO L226 Difference]: Without dead ends: 106707 [2018-11-06 19:37:23,318 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 19:37:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106707 states. [2018-11-06 19:37:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106707 to 85809. [2018-11-06 19:37:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85809 states. [2018-11-06 19:37:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85809 states to 85809 states and 88806 transitions. [2018-11-06 19:37:24,168 INFO L78 Accepts]: Start accepts. Automaton has 85809 states and 88806 transitions. Word has length 847 [2018-11-06 19:37:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:37:24,169 INFO L480 AbstractCegarLoop]: Abstraction has 85809 states and 88806 transitions. [2018-11-06 19:37:24,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:37:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 85809 states and 88806 transitions. [2018-11-06 19:37:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2018-11-06 19:37:24,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:37:24,184 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:37:24,184 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:37:24,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:37:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1864710667, now seen corresponding path program 1 times [2018-11-06 19:37:24,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:37:24,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:37:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:24,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:24,926 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2018-11-06 19:37:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-06 19:37:25,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:37:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:37:25,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:37:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:37:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:25,783 INFO L87 Difference]: Start difference. First operand 85809 states and 88806 transitions. Second operand 4 states. Received shutdown request... [2018-11-06 19:37:26,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:37:26,848 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:37:26,854 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:37:26,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:37:26 BoogieIcfgContainer [2018-11-06 19:37:26,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:37:26,855 INFO L168 Benchmark]: Toolchain (without parser) took 230627.70 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 618.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:26,857 INFO L168 Benchmark]: CDTParser took 0.25 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 19:37:26,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1648.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:26,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 525.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -893.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:26,859 INFO L168 Benchmark]: Boogie Preprocessor took 410.99 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:26,860 INFO L168 Benchmark]: RCFGBuilder took 9705.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 486.1 MB). Peak memory consumption was 486.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:26,860 INFO L168 Benchmark]: TraceAbstraction took 218332.32 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 3.2 GB in the end (delta: -1.6 GB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:26,865 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.25 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 1648.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 525.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -893.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 410.99 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9705.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 486.1 MB). Peak memory consumption was 486.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218332.32 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 3.2 GB in the end (delta: -1.6 GB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 59). Cancelled while BasicCegarLoop was constructing difference of abstraction (85809states) and FLOYD_HOARE automaton (currently 3 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (605 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 218.2s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 176.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6211 SDtfs, 25288 SDslu, 3455 SDs, 0 SdLazy, 73948 SolverSat, 7635 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 151.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3238 GetRequests, 3149 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85809occurred in iteration=17, 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: 7.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 105150 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 12364 NumberOfCodeBlocks, 12364 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 12340 ConstructedInterpolants, 788 QuantifiedInterpolants, 46972703 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3945 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 15079/16443 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown