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_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:47:22,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:47:22,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:47:22,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:47:22,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:47:22,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:47:22,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:47:22,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:47:22,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:47:22,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:47:22,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:47:22,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:47:22,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:47:22,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:47:22,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:47:22,347 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:47:22,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:47:22,353 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:47:22,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:47:22,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:47:22,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:47:22,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:47:22,372 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:47:22,372 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:47:22,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:47:22,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:47:22,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:47:22,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:47:22,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:47:22,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:47:22,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:47:22,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:47:22,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:47:22,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:47:22,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:47:22,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:47:22,391 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:47:22,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:47:22,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:47:22,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:47:22,426 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:47:22,426 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:47:22,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:47:22,427 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:47:22,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:47:22,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:47:22,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:47:22,428 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:47:22,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:47:22,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:47:22,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:47:22,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:47:22,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:47:22,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:47:22,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:47:22,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:47:22,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:47:22,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:47:22,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:47:22,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:47:22,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:47:22,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:47:22,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:47:22,431 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:47:22,431 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:47:22,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:47:22,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:47:22,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:47:22,499 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:47:22,500 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:47:22,500 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label44_true-unreach-call.c [2018-11-06 21:47:22,580 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8e24617/41465ffe1a9e4d82bd81f50f63155d3b/FLAG750608f82 [2018-11-06 21:47:23,401 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:47:23,402 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label44_true-unreach-call.c [2018-11-06 21:47:23,425 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8e24617/41465ffe1a9e4d82bd81f50f63155d3b/FLAG750608f82 [2018-11-06 21:47:23,440 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd8e24617/41465ffe1a9e4d82bd81f50f63155d3b [2018-11-06 21:47:23,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:47:23,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:47:23,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:47:23,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:47:23,459 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:47:23,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:47:23" (1/1) ... [2018-11-06 21:47:23,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193d11b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:23, skipping insertion in model container [2018-11-06 21:47:23,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:47:23" (1/1) ... [2018-11-06 21:47:23,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:47:23,585 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:47:24,606 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:47:24,611 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:47:25,057 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:47:25,082 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:47:25,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25 WrapperNode [2018-11-06 21:47:25,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:47:25,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:47:25,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:47:25,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:47:25,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:47:25,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:47:25,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:47:25,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:47:25,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... [2018-11-06 21:47:25,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:47:25,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:47:25,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:47:25,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:47:25,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:47:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:47:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:47:25,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:47:35,081 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:47:35,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:47:35 BoogieIcfgContainer [2018-11-06 21:47:35,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:47:35,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:47:35,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:47:35,086 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:47:35,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:47:23" (1/3) ... [2018-11-06 21:47:35,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b4c8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:47:35, skipping insertion in model container [2018-11-06 21:47:35,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:25" (2/3) ... [2018-11-06 21:47:35,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b4c8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:47:35, skipping insertion in model container [2018-11-06 21:47:35,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:47:35" (3/3) ... [2018-11-06 21:47:35,094 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label44_true-unreach-call.c [2018-11-06 21:47:35,103 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:47:35,116 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:47:35,134 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:47:35,178 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:47:35,178 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:47:35,179 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:47:35,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:47:35,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:47:35,179 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:47:35,179 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:47:35,179 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:47:35,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:47:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 21:47:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-06 21:47:35,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:35,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:47:35,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:35,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1502078046, now seen corresponding path program 1 times [2018-11-06 21:47:35,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:35,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:35,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:47:35,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:35,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:47:35,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:47:35,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:47:35,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:47:35,688 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 21:47:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:43,841 INFO L93 Difference]: Finished difference Result 2078 states and 3883 transitions. [2018-11-06 21:47:43,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:47:43,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-06 21:47:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:43,874 INFO L225 Difference]: With dead ends: 2078 [2018-11-06 21:47:43,874 INFO L226 Difference]: Without dead ends: 1480 [2018-11-06 21:47:43,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:47:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2018-11-06 21:47:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1019. [2018-11-06 21:47:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2018-11-06 21:47:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1572 transitions. [2018-11-06 21:47:44,007 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1572 transitions. Word has length 36 [2018-11-06 21:47:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:44,009 INFO L480 AbstractCegarLoop]: Abstraction has 1019 states and 1572 transitions. [2018-11-06 21:47:44,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:47:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1572 transitions. [2018-11-06 21:47:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-06 21:47:44,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:44,015 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:47:44,016 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:44,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:44,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1524085169, now seen corresponding path program 1 times [2018-11-06 21:47:44,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:44,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:44,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:44,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:44,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:47:44,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:47:44,450 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:47:44,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:44,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:47:45,037 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 23 [2018-11-06 21:47:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:47:45,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:47:45,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:47:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:47:45,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:47:45,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:47:45,234 INFO L87 Difference]: Start difference. First operand 1019 states and 1572 transitions. Second operand 7 states. [2018-11-06 21:49:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:49:37,139 INFO L93 Difference]: Finished difference Result 7805 states and 12807 transitions. [2018-11-06 21:49:37,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:49:37,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-06 21:49:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:49:37,177 INFO L225 Difference]: With dead ends: 7805 [2018-11-06 21:49:37,177 INFO L226 Difference]: Without dead ends: 6788 [2018-11-06 21:49:37,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:49:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6788 states. [2018-11-06 21:49:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6788 to 6737. [2018-11-06 21:49:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6737 states. [2018-11-06 21:49:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 8903 transitions. [2018-11-06 21:49:37,330 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 8903 transitions. Word has length 107 [2018-11-06 21:49:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:49:37,331 INFO L480 AbstractCegarLoop]: Abstraction has 6737 states and 8903 transitions. [2018-11-06 21:49:37,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:49:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 8903 transitions. [2018-11-06 21:49:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-06 21:49:37,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:49:37,340 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:49:37,341 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:49:37,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:49:37,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1964947355, now seen corresponding path program 1 times [2018-11-06 21:49:37,341 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:49:37,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:49:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:37,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:49:37,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:49:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:49:37,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:49:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:49:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:49:37,838 INFO L87 Difference]: Start difference. First operand 6737 states and 8903 transitions. Second operand 4 states. [2018-11-06 21:49:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:49:42,888 INFO L93 Difference]: Finished difference Result 22807 states and 30790 transitions. [2018-11-06 21:49:42,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:49:42,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-11-06 21:49:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:49:42,950 INFO L225 Difference]: With dead ends: 22807 [2018-11-06 21:49:42,951 INFO L226 Difference]: Without dead ends: 12570 [2018-11-06 21:49:42,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:49:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12570 states. [2018-11-06 21:49:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12570 to 12570. [2018-11-06 21:49:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12570 states. [2018-11-06 21:49:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 14525 transitions. [2018-11-06 21:49:43,187 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 14525 transitions. Word has length 166 [2018-11-06 21:49:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:49:43,187 INFO L480 AbstractCegarLoop]: Abstraction has 12570 states and 14525 transitions. [2018-11-06 21:49:43,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:49:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 14525 transitions. [2018-11-06 21:49:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-06 21:49:43,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:49:43,192 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:49:43,193 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:49:43,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:49:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash -59204028, now seen corresponding path program 1 times [2018-11-06 21:49:43,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:49:43,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:49:43,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:43,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 21:49:43,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:49:43,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:49:43,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:49:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:49:43,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:49:43,531 INFO L87 Difference]: Start difference. First operand 12570 states and 14525 transitions. Second operand 4 states. [2018-11-06 21:49:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:49:47,830 INFO L93 Difference]: Finished difference Result 26405 states and 30447 transitions. [2018-11-06 21:49:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:49:47,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2018-11-06 21:49:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:49:47,878 INFO L225 Difference]: With dead ends: 26405 [2018-11-06 21:49:47,878 INFO L226 Difference]: Without dead ends: 14269 [2018-11-06 21:49:47,893 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 21:49:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14269 states. [2018-11-06 21:49:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14269 to 12564. [2018-11-06 21:49:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12564 states. [2018-11-06 21:49:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12564 states to 12564 states and 14361 transitions. [2018-11-06 21:49:48,144 INFO L78 Accepts]: Start accepts. Automaton has 12564 states and 14361 transitions. Word has length 226 [2018-11-06 21:49:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:49:48,145 INFO L480 AbstractCegarLoop]: Abstraction has 12564 states and 14361 transitions. [2018-11-06 21:49:48,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:49:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 12564 states and 14361 transitions. [2018-11-06 21:49:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-06 21:49:48,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:49:48,151 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:49:48,151 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:49:48,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:49:48,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1770141246, now seen corresponding path program 1 times [2018-11-06 21:49:48,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:49:48,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:49:48,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:48,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:48,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-06 21:49:48,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:49:48,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:49:48,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:49:48,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:49:48,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:49:48,423 INFO L87 Difference]: Start difference. First operand 12564 states and 14361 transitions. Second operand 3 states. [2018-11-06 21:49:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:49:51,551 INFO L93 Difference]: Finished difference Result 33211 states and 37734 transitions. [2018-11-06 21:49:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:49:51,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-11-06 21:49:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:49:51,585 INFO L225 Difference]: With dead ends: 33211 [2018-11-06 21:49:51,585 INFO L226 Difference]: Without dead ends: 18466 [2018-11-06 21:49:51,600 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 21:49:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18466 states. [2018-11-06 21:49:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18466 to 17177. [2018-11-06 21:49:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17177 states. [2018-11-06 21:49:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17177 states to 17177 states and 19114 transitions. [2018-11-06 21:49:51,831 INFO L78 Accepts]: Start accepts. Automaton has 17177 states and 19114 transitions. Word has length 309 [2018-11-06 21:49:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:49:51,832 INFO L480 AbstractCegarLoop]: Abstraction has 17177 states and 19114 transitions. [2018-11-06 21:49:51,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:49:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17177 states and 19114 transitions. [2018-11-06 21:49:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-11-06 21:49:51,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:49:51,843 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:49:51,844 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:49:51,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:49:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1235976453, now seen corresponding path program 1 times [2018-11-06 21:49:51,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:49:51,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:49:51,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:51,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:51,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 254 proven. 83 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-06 21:49:52,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:49:52,773 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:49:52,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:52,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:49:53,157 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 15 [2018-11-06 21:49:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-06 21:49:53,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:49:53,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:49:53,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:49:53,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:49:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:49:53,371 INFO L87 Difference]: Start difference. First operand 17177 states and 19114 transitions. Second operand 6 states. [2018-11-06 21:50:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:27,942 INFO L93 Difference]: Finished difference Result 57828 states and 64592 transitions. [2018-11-06 21:50:27,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:50:27,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 380 [2018-11-06 21:50:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:27,998 INFO L225 Difference]: With dead ends: 57828 [2018-11-06 21:50:27,998 INFO L226 Difference]: Without dead ends: 41079 [2018-11-06 21:50:28,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:50:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41079 states. [2018-11-06 21:50:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41079 to 40208. [2018-11-06 21:50:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40208 states. [2018-11-06 21:50:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40208 states to 40208 states and 43347 transitions. [2018-11-06 21:50:28,513 INFO L78 Accepts]: Start accepts. Automaton has 40208 states and 43347 transitions. Word has length 380 [2018-11-06 21:50:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:28,514 INFO L480 AbstractCegarLoop]: Abstraction has 40208 states and 43347 transitions. [2018-11-06 21:50:28,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:50:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40208 states and 43347 transitions. [2018-11-06 21:50:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-11-06 21:50:28,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:28,569 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:50:28,570 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:28,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:28,570 INFO L82 PathProgramCache]: Analyzing trace with hash -765229317, now seen corresponding path program 1 times [2018-11-06 21:50:28,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:28,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:28,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:28,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-06 21:50:29,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:29,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:50:29,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:50:29,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:50:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:29,140 INFO L87 Difference]: Start difference. First operand 40208 states and 43347 transitions. Second operand 3 states. [2018-11-06 21:50:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:32,290 INFO L93 Difference]: Finished difference Result 86397 states and 93594 transitions. [2018-11-06 21:50:32,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:50:32,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 632 [2018-11-06 21:50:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:32,346 INFO L225 Difference]: With dead ends: 86397 [2018-11-06 21:50:32,346 INFO L226 Difference]: Without dead ends: 47469 [2018-11-06 21:50:32,378 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 21:50:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47469 states. [2018-11-06 21:50:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47469 to 47451. [2018-11-06 21:50:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47451 states. [2018-11-06 21:50:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47451 states to 47451 states and 51458 transitions. [2018-11-06 21:50:32,933 INFO L78 Accepts]: Start accepts. Automaton has 47451 states and 51458 transitions. Word has length 632 [2018-11-06 21:50:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:32,934 INFO L480 AbstractCegarLoop]: Abstraction has 47451 states and 51458 transitions. [2018-11-06 21:50:32,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:50:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 47451 states and 51458 transitions. [2018-11-06 21:50:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2018-11-06 21:50:33,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:33,016 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:50:33,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:33,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1995659252, now seen corresponding path program 1 times [2018-11-06 21:50:33,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:33,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:33,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:33,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:33,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-06 21:50:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:34,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:50:34,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:50:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:50:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:34,003 INFO L87 Difference]: Start difference. First operand 47451 states and 51458 transitions. Second operand 3 states. [2018-11-06 21:50:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:37,108 INFO L93 Difference]: Finished difference Result 101285 states and 110390 transitions. [2018-11-06 21:50:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:50:37,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 722 [2018-11-06 21:50:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:37,190 INFO L225 Difference]: With dead ends: 101285 [2018-11-06 21:50:37,191 INFO L226 Difference]: Without dead ends: 54688 [2018-11-06 21:50:37,237 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 21:50:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54688 states. [2018-11-06 21:50:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54688 to 53836. [2018-11-06 21:50:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53836 states. [2018-11-06 21:50:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53836 states to 53836 states and 58568 transitions. [2018-11-06 21:50:37,878 INFO L78 Accepts]: Start accepts. Automaton has 53836 states and 58568 transitions. Word has length 722 [2018-11-06 21:50:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:37,878 INFO L480 AbstractCegarLoop]: Abstraction has 53836 states and 58568 transitions. [2018-11-06 21:50:37,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:50:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 53836 states and 58568 transitions. [2018-11-06 21:50:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-11-06 21:50:37,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:37,956 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:50:37,957 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:37,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:37,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1544243198, now seen corresponding path program 1 times [2018-11-06 21:50:37,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:37,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:37,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:37,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:37,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-06 21:50:39,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:39,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:50:39,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:50:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:50:39,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:50:39,582 INFO L87 Difference]: Start difference. First operand 53836 states and 58568 transitions. Second operand 4 states. [2018-11-06 21:50:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:45,682 INFO L93 Difference]: Finished difference Result 129000 states and 140030 transitions. [2018-11-06 21:50:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:50:45,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 771 [2018-11-06 21:50:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:45,768 INFO L225 Difference]: With dead ends: 129000 [2018-11-06 21:50:45,769 INFO L226 Difference]: Without dead ends: 76445 [2018-11-06 21:50:45,813 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 21:50:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76445 states. [2018-11-06 21:50:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76445 to 58522. [2018-11-06 21:50:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58522 states. [2018-11-06 21:50:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58522 states to 58522 states and 63443 transitions. [2018-11-06 21:50:46,423 INFO L78 Accepts]: Start accepts. Automaton has 58522 states and 63443 transitions. Word has length 771 [2018-11-06 21:50:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:46,424 INFO L480 AbstractCegarLoop]: Abstraction has 58522 states and 63443 transitions. [2018-11-06 21:50:46,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:50:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 58522 states and 63443 transitions. [2018-11-06 21:50:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2018-11-06 21:50:46,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:46,466 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:50:46,466 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:46,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1135267625, now seen corresponding path program 1 times [2018-11-06 21:50:46,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:46,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:46,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 379 proven. 461 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:50:48,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:50:48,170 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:50:48,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:48,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:50:48,750 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 20 [2018-11-06 21:50:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 445 proven. 83 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-06 21:50:49,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:50:49,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2018-11-06 21:50:49,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:50:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:50:49,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:50:49,813 INFO L87 Difference]: Start difference. First operand 58522 states and 63443 transitions. Second operand 8 states. [2018-11-06 21:51:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:51:02,499 INFO L93 Difference]: Finished difference Result 149492 states and 161705 transitions. [2018-11-06 21:51:02,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 21:51:02,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 787 [2018-11-06 21:51:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:51:02,591 INFO L225 Difference]: With dead ends: 149492 [2018-11-06 21:51:02,591 INFO L226 Difference]: Without dead ends: 91825 [2018-11-06 21:51:02,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 785 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:51:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91825 states. [2018-11-06 21:51:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91825 to 85827. [2018-11-06 21:51:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85827 states. [2018-11-06 21:51:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85827 states to 85827 states and 92590 transitions. [2018-11-06 21:51:03,867 INFO L78 Accepts]: Start accepts. Automaton has 85827 states and 92590 transitions. Word has length 787 [2018-11-06 21:51:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:51:03,868 INFO L480 AbstractCegarLoop]: Abstraction has 85827 states and 92590 transitions. [2018-11-06 21:51:03,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:51:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 85827 states and 92590 transitions. [2018-11-06 21:51:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2018-11-06 21:51:03,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:51:03,914 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:51:03,914 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:51:03,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:51:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1425409144, now seen corresponding path program 1 times [2018-11-06 21:51:03,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:51:03,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:51:03,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:03,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:51:03,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:51:04,575 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-06 21:51:05,005 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2018-11-06 21:51:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 690 proven. 83 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-06 21:51:05,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:51:05,603 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:51:05,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:51:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:51:05,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:51:06,117 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 29 [2018-11-06 21:51:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2018-11-06 21:51:08,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:51:08,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 21:51:08,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:51:08,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:51:08,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:51:08,914 INFO L87 Difference]: Start difference. First operand 85827 states and 92590 transitions. Second operand 7 states. [2018-11-06 21:51:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:51:18,748 INFO L93 Difference]: Finished difference Result 183604 states and 197589 transitions. [2018-11-06 21:51:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:51:18,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 910 [2018-11-06 21:51:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:51:18,846 INFO L225 Difference]: With dead ends: 183604 [2018-11-06 21:51:18,846 INFO L226 Difference]: Without dead ends: 97779 [2018-11-06 21:51:18,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:51:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97779 states. [2018-11-06 21:51:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97779 to 89668. [2018-11-06 21:51:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89668 states. [2018-11-06 21:51:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89668 states to 89668 states and 96223 transitions. [2018-11-06 21:51:19,870 INFO L78 Accepts]: Start accepts. Automaton has 89668 states and 96223 transitions. Word has length 910 [2018-11-06 21:51:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:51:19,870 INFO L480 AbstractCegarLoop]: Abstraction has 89668 states and 96223 transitions. [2018-11-06 21:51:19,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:51:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 89668 states and 96223 transitions. [2018-11-06 21:51:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2018-11-06 21:51:19,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:51:19,918 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:51:19,919 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:51:19,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:51:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash -607256136, now seen corresponding path program 1 times [2018-11-06 21:51:19,919 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:51:19,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:51:19,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:19,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:51:19,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:51:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 789 proven. 0 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2018-11-06 21:51:21,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:51:21,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:51:21,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:51:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:51:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:51:21,882 INFO L87 Difference]: Start difference. First operand 89668 states and 96223 transitions. Second operand 3 states. Received shutdown request... [2018-11-06 21:51:23,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:51:23,503 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:51:23,509 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:51:23,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:51:23 BoogieIcfgContainer [2018-11-06 21:51:23,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:51:23,510 INFO L168 Benchmark]: Toolchain (without parser) took 240058.42 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -585.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-06 21:51:23,511 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:51:23,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1629.69 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: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:23,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 520.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -894.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:23,514 INFO L168 Benchmark]: Boogie Preprocessor took 283.50 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: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:23,515 INFO L168 Benchmark]: RCFGBuilder took 9192.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 464.8 MB). Peak memory consumption was 464.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:23,515 INFO L168 Benchmark]: TraceAbstraction took 228427.02 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.6 GB in the beginning and 2.0 GB in the end (delta: -349.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-06 21:51:23,520 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.91 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 1629.69 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: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 520.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -894.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 283.50 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: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9192.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 464.8 MB). Peak memory consumption was 464.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228427.02 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.6 GB in the beginning and 2.0 GB in the end (delta: -349.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 113). Cancelled while BasicCegarLoop was constructing difference of abstraction (89668states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (89232 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 228.3s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 204.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4634 SDtfs, 16753 SDslu, 2276 SDs, 0 SdLazy, 47623 SolverSat, 6187 SolverUnsat, 84 SolverUnknown, 0 SolverNotchecked, 187.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2241 GetRequests, 2194 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89668occurred in iteration=11, 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: 5.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 37279 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 8215 NumberOfCodeBlocks, 8215 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 8199 ConstructedInterpolants, 419 QuantifiedInterpolants, 26112760 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2686 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 8872/9615 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown