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_label20_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:29:26,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:29:26,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:29:26,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:29:26,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:29:26,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:29:26,364 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:29:26,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:29:26,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:29:26,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:29:26,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:29:26,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:29:26,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:29:26,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:29:26,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:29:26,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:29:26,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:29:26,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:29:26,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:29:26,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:29:26,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:29:26,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:29:26,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:29:26,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:29:26,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:29:26,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:29:26,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:29:26,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:29:26,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:29:26,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:29:26,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:29:26,396 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:29:26,396 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:29:26,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:29:26,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:29:26,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:29:26,399 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:29:26,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:29:26,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:29:26,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:29:26,423 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:29:26,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:29:26,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:29:26,424 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:29:26,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:29:26,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:29:26,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:29:26,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:29:26,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:29:26,425 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:29:26,425 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:29:26,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:29:26,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:29:26,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:29:26,426 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:29:26,426 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:29:26,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:29:26,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:29:26,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:29:26,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:29:26,427 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:29:26,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:29:26,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:29:26,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:29:26,428 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:29:26,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:29:26,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:29:26,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:29:26,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:29:26,496 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:29:26,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label20_false-unreach-call.c [2018-11-06 19:29:26,564 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4841c002/1c1125f776c2421a8523a8b3481ec0ec/FLAG792cf8e49 [2018-11-06 19:29:27,221 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:29:27,223 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label20_false-unreach-call.c [2018-11-06 19:29:27,257 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4841c002/1c1125f776c2421a8523a8b3481ec0ec/FLAG792cf8e49 [2018-11-06 19:29:27,273 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4841c002/1c1125f776c2421a8523a8b3481ec0ec [2018-11-06 19:29:27,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:29:27,285 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:29:27,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:29:27,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:29:27,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:29:27,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:29:27" (1/1) ... [2018-11-06 19:29:27,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca78f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:27, skipping insertion in model container [2018-11-06 19:29:27,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:29:27" (1/1) ... [2018-11-06 19:29:27,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:29:27,424 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:29:28,453 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:29:28,457 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:29:28,887 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:29:28,914 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:29:28,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28 WrapperNode [2018-11-06 19:29:28,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:29:28,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:29:28,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:29:28,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:29:28,927 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:29:28" (1/1) ... [2018-11-06 19:29:29,175 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:29:28" (1/1) ... [2018-11-06 19:29:29,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:29:29,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:29:29,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:29:29,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:29:29,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (1/1) ... [2018-11-06 19:29:29,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (1/1) ... [2018-11-06 19:29:29,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (1/1) ... [2018-11-06 19:29:29,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (1/1) ... [2018-11-06 19:29:29,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (1/1) ... [2018-11-06 19:29:29,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (1/1) ... [2018-11-06 19:29:29,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (1/1) ... [2018-11-06 19:29:29,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:29:29,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:29:29,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:29:29,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:29:29,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (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:29:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:29:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:29:29,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:29:38,210 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:29:38,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:29:38 BoogieIcfgContainer [2018-11-06 19:29:38,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:29:38,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:29:38,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:29:38,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:29:38,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:29:27" (1/3) ... [2018-11-06 19:29:38,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638b00ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:29:38, skipping insertion in model container [2018-11-06 19:29:38,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:29:28" (2/3) ... [2018-11-06 19:29:38,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638b00ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:29:38, skipping insertion in model container [2018-11-06 19:29:38,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:29:38" (3/3) ... [2018-11-06 19:29:38,221 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label20_false-unreach-call.c [2018-11-06 19:29:38,231 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:29:38,241 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:29:38,258 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:29:38,298 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:29:38,299 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:29:38,299 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:29:38,299 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:29:38,299 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:29:38,300 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:29:38,300 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:29:38,300 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:29:38,300 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:29:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 19:29:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-06 19:29:38,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:29:38,346 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] [2018-11-06 19:29:38,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:29:38,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:29:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1740446778, now seen corresponding path program 1 times [2018-11-06 19:29:38,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:29:38,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:29:38,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:29:38,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:29:38,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:29:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:29:38,825 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:29:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:29:38,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:29:38,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:29:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:29:38,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:29:38,859 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 19:29:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:29:46,932 INFO L93 Difference]: Finished difference Result 2097 states and 3909 transitions. [2018-11-06 19:29:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:29:46,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-06 19:29:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:29:46,972 INFO L225 Difference]: With dead ends: 2097 [2018-11-06 19:29:46,972 INFO L226 Difference]: Without dead ends: 1499 [2018-11-06 19:29:46,980 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:29:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2018-11-06 19:29:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1485. [2018-11-06 19:29:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-11-06 19:29:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2304 transitions. [2018-11-06 19:29:47,145 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2304 transitions. Word has length 27 [2018-11-06 19:29:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:29:47,145 INFO L480 AbstractCegarLoop]: Abstraction has 1485 states and 2304 transitions. [2018-11-06 19:29:47,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:29:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2304 transitions. [2018-11-06 19:29:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-06 19:29:47,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:29:47,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:47,150 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:29:47,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:29:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash -911219551, now seen corresponding path program 1 times [2018-11-06 19:29:47,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:29:47,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:29:47,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:29:47,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:29:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:29:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:29:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:29:47,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:29:47,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:29:47,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:29:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:29:47,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:29:47,413 INFO L87 Difference]: Start difference. First operand 1485 states and 2304 transitions. Second operand 4 states. [2018-11-06 19:29:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:29:54,222 INFO L93 Difference]: Finished difference Result 4257 states and 6664 transitions. [2018-11-06 19:29:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:29:54,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-06 19:29:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:29:54,239 INFO L225 Difference]: With dead ends: 4257 [2018-11-06 19:29:54,239 INFO L226 Difference]: Without dead ends: 2774 [2018-11-06 19:29:54,248 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:29:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2018-11-06 19:29:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2774. [2018-11-06 19:29:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2018-11-06 19:29:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3714 transitions. [2018-11-06 19:29:54,308 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3714 transitions. Word has length 95 [2018-11-06 19:29:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:29:54,308 INFO L480 AbstractCegarLoop]: Abstraction has 2774 states and 3714 transitions. [2018-11-06 19:29:54,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:29:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3714 transitions. [2018-11-06 19:29:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-06 19:29:54,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:29:54,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:54,315 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:29:54,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:29:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash 856980078, now seen corresponding path program 1 times [2018-11-06 19:29:54,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:29:54,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:29:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:29:54,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:29:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:29:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:29:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:29:54,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:29:54,865 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:29:54,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:29:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:29:54,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:29:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:29:55,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:29:55,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:29:55,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:29:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:29:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:29:55,243 INFO L87 Difference]: Start difference. First operand 2774 states and 3714 transitions. Second operand 6 states. [2018-11-06 19:30:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:30:37,994 INFO L93 Difference]: Finished difference Result 13681 states and 18832 transitions. [2018-11-06 19:30:37,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:30:37,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-06 19:30:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:30:38,030 INFO L225 Difference]: With dead ends: 13681 [2018-11-06 19:30:38,030 INFO L226 Difference]: Without dead ends: 7021 [2018-11-06 19:30:38,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:30:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7021 states. [2018-11-06 19:30:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7021 to 7016. [2018-11-06 19:30:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2018-11-06 19:30:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8033 transitions. [2018-11-06 19:30:38,171 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8033 transitions. Word has length 98 [2018-11-06 19:30:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:30:38,174 INFO L480 AbstractCegarLoop]: Abstraction has 7016 states and 8033 transitions. [2018-11-06 19:30:38,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:30:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8033 transitions. [2018-11-06 19:30:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-06 19:30:38,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:30:38,184 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:30:38,190 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:30:38,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:30:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash 685901422, now seen corresponding path program 1 times [2018-11-06 19:30:38,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:30:38,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:30:38,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:30:38,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:30:38,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:30:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:30:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:30:38,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:30:38,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:30:38,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:30:38,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:30:38,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:30:38,656 INFO L87 Difference]: Start difference. First operand 7016 states and 8033 transitions. Second operand 4 states. [2018-11-06 19:30:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:30:42,521 INFO L93 Difference]: Finished difference Result 19569 states and 22615 transitions. [2018-11-06 19:30:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:30:42,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-11-06 19:30:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:30:42,591 INFO L225 Difference]: With dead ends: 19569 [2018-11-06 19:30:42,591 INFO L226 Difference]: Without dead ends: 12982 [2018-11-06 19:30:42,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:30:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12982 states. [2018-11-06 19:30:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12982 to 12130. [2018-11-06 19:30:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12130 states. [2018-11-06 19:30:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12130 states to 12130 states and 13568 transitions. [2018-11-06 19:30:42,856 INFO L78 Accepts]: Start accepts. Automaton has 12130 states and 13568 transitions. Word has length 208 [2018-11-06 19:30:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:30:42,857 INFO L480 AbstractCegarLoop]: Abstraction has 12130 states and 13568 transitions. [2018-11-06 19:30:42,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:30:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 12130 states and 13568 transitions. [2018-11-06 19:30:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-06 19:30:42,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:30:42,865 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:30:42,866 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:30:42,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:30:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash 517448071, now seen corresponding path program 1 times [2018-11-06 19:30:42,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:30:42,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:30:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:30:42,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:30:42,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:30:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:30:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-06 19:30:43,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:30:43,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:30:43,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:30:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:30:43,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:30:43,243 INFO L87 Difference]: Start difference. First operand 12130 states and 13568 transitions. Second operand 3 states. [2018-11-06 19:30:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:30:45,876 INFO L93 Difference]: Finished difference Result 28098 states and 31829 transitions. [2018-11-06 19:30:45,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:30:45,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-11-06 19:30:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:30:45,932 INFO L225 Difference]: With dead ends: 28098 [2018-11-06 19:30:45,933 INFO L226 Difference]: Without dead ends: 16397 [2018-11-06 19:30:45,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:30:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16397 states. [2018-11-06 19:30:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16397 to 16391. [2018-11-06 19:30:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16391 states. [2018-11-06 19:30:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16391 states to 16391 states and 18300 transitions. [2018-11-06 19:30:46,163 INFO L78 Accepts]: Start accepts. Automaton has 16391 states and 18300 transitions. Word has length 289 [2018-11-06 19:30:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:30:46,164 INFO L480 AbstractCegarLoop]: Abstraction has 16391 states and 18300 transitions. [2018-11-06 19:30:46,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:30:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 16391 states and 18300 transitions. [2018-11-06 19:30:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-11-06 19:30:46,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:30:46,184 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:46,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:30:46,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:30:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -285714055, now seen corresponding path program 1 times [2018-11-06 19:30:46,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:30:46,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:30:46,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:30:46,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:30:46,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:30:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:30:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-06 19:30:46,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:30:46,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:30:46,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:30:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:30:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:30:46,854 INFO L87 Difference]: Start difference. First operand 16391 states and 18300 transitions. Second operand 3 states. [2018-11-06 19:30:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:30:49,916 INFO L93 Difference]: Finished difference Result 45154 states and 50479 transitions. [2018-11-06 19:30:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:30:49,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 509 [2018-11-06 19:30:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:30:49,970 INFO L225 Difference]: With dead ends: 45154 [2018-11-06 19:30:49,970 INFO L226 Difference]: Without dead ends: 29192 [2018-11-06 19:30:49,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:30:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29192 states. [2018-11-06 19:30:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29192 to 23634. [2018-11-06 19:30:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23634 states. [2018-11-06 19:30:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23634 states to 23634 states and 26648 transitions. [2018-11-06 19:30:50,319 INFO L78 Accepts]: Start accepts. Automaton has 23634 states and 26648 transitions. Word has length 509 [2018-11-06 19:30:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:30:50,320 INFO L480 AbstractCegarLoop]: Abstraction has 23634 states and 26648 transitions. [2018-11-06 19:30:50,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:30:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 23634 states and 26648 transitions. [2018-11-06 19:30:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-11-06 19:30:50,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:30:50,344 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,344 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:30:50,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:30:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash 641630830, now seen corresponding path program 1 times [2018-11-06 19:30:50,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:30:50,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:30:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:30:50,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:30:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:30:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:30:51,106 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-06 19:30:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 238 proven. 83 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-06 19:30:51,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:30:51,730 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:30:51,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:30:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:30:51,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:30:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 238 proven. 83 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-06 19:30:52,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:30:52,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-11-06 19:30:52,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:30:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:30:52,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:30:52,219 INFO L87 Difference]: Start difference. First operand 23634 states and 26648 transitions. Second operand 9 states. [2018-11-06 19:31:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:31:04,333 INFO L93 Difference]: Finished difference Result 48973 states and 55080 transitions. [2018-11-06 19:31:04,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:31:04,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 521 [2018-11-06 19:31:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:31:04,368 INFO L225 Difference]: With dead ends: 48973 [2018-11-06 19:31:04,368 INFO L226 Difference]: Without dead ends: 25341 [2018-11-06 19:31:04,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:31:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25341 states. [2018-11-06 19:31:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25341 to 25337. [2018-11-06 19:31:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25337 states. [2018-11-06 19:31:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25337 states to 25337 states and 28407 transitions. [2018-11-06 19:31:04,669 INFO L78 Accepts]: Start accepts. Automaton has 25337 states and 28407 transitions. Word has length 521 [2018-11-06 19:31:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:31:04,670 INFO L480 AbstractCegarLoop]: Abstraction has 25337 states and 28407 transitions. [2018-11-06 19:31:04,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:31:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25337 states and 28407 transitions. [2018-11-06 19:31:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-11-06 19:31:04,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:31:04,689 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:04,689 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:31:04,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:31:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -570165728, now seen corresponding path program 1 times [2018-11-06 19:31:04,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:31:04,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:31:04,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:31:04,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:31:04,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:31:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:31:05,351 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-06 19:31:05,842 WARN L179 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-11-06 19:31:06,273 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-11-06 19:31:06,631 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-11-06 19:31:07,098 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-11-06 19:31:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 258 proven. 83 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-06 19:31:07,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:31:07,815 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:31:07,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:31:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:31:07,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:31:08,949 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 30 [2018-11-06 19:31:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 74 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:31:11,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:31:11,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2018-11-06 19:31:11,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 19:31:11,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 19:31:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:31:11,096 INFO L87 Difference]: Start difference. First operand 25337 states and 28407 transitions. Second operand 14 states. [2018-11-06 19:31:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:31:37,169 INFO L93 Difference]: Finished difference Result 61346 states and 68444 transitions. [2018-11-06 19:31:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 19:31:37,170 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 541 [2018-11-06 19:31:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:31:37,208 INFO L225 Difference]: With dead ends: 61346 [2018-11-06 19:31:37,208 INFO L226 Difference]: Without dead ends: 36863 [2018-11-06 19:31:37,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 537 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-11-06 19:31:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36863 states. [2018-11-06 19:31:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36863 to 27459. [2018-11-06 19:31:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27459 states. [2018-11-06 19:31:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27459 states to 27459 states and 30531 transitions. [2018-11-06 19:31:37,579 INFO L78 Accepts]: Start accepts. Automaton has 27459 states and 30531 transitions. Word has length 541 [2018-11-06 19:31:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:31:37,579 INFO L480 AbstractCegarLoop]: Abstraction has 27459 states and 30531 transitions. [2018-11-06 19:31:37,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 19:31:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 27459 states and 30531 transitions. [2018-11-06 19:31:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-11-06 19:31:37,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:31:37,599 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:37,599 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:31:37,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:31:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 746322160, now seen corresponding path program 1 times [2018-11-06 19:31:37,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:31:37,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:31:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:31:37,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:31:37,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:31:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:31:38,307 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2018-11-06 19:31:38,609 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 6 [2018-11-06 19:31:38,972 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 6 [2018-11-06 19:31:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-06 19:31:39,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:31:39,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:31:39,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:31:39,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:31:39,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:31:39,281 INFO L87 Difference]: Start difference. First operand 27459 states and 30531 transitions. Second operand 5 states. [2018-11-06 19:31:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:31:48,677 INFO L93 Difference]: Finished difference Result 84820 states and 93978 transitions. [2018-11-06 19:31:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:31:48,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 597 [2018-11-06 19:31:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:31:48,749 INFO L225 Difference]: With dead ends: 84820 [2018-11-06 19:31:48,749 INFO L226 Difference]: Without dead ends: 57789 [2018-11-06 19:31:48,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:31:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57789 states. [2018-11-06 19:31:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57789 to 37683. [2018-11-06 19:31:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37683 states. [2018-11-06 19:31:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37683 states to 37683 states and 41489 transitions. [2018-11-06 19:31:49,620 INFO L78 Accepts]: Start accepts. Automaton has 37683 states and 41489 transitions. Word has length 597 [2018-11-06 19:31:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:31:49,622 INFO L480 AbstractCegarLoop]: Abstraction has 37683 states and 41489 transitions. [2018-11-06 19:31:49,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:31:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 37683 states and 41489 transitions. [2018-11-06 19:31:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-11-06 19:31:49,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:31:49,643 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:49,643 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:31:49,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:31:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash 78520875, now seen corresponding path program 1 times [2018-11-06 19:31:49,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:31:49,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:31:49,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:31:49,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:31:49,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:31:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:31:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-06 19:31:50,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:31:50,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:31:50,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:31:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:31:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:31:50,215 INFO L87 Difference]: Start difference. First operand 37683 states and 41489 transitions. Second operand 3 states. [2018-11-06 19:31:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:31:52,563 INFO L93 Difference]: Finished difference Result 74934 states and 82544 transitions. [2018-11-06 19:31:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:31:52,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 599 [2018-11-06 19:31:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:31:52,611 INFO L225 Difference]: With dead ends: 74934 [2018-11-06 19:31:52,611 INFO L226 Difference]: Without dead ends: 37679 [2018-11-06 19:31:52,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 7 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:31:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37679 states. [2018-11-06 19:31:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37679 to 37679. [2018-11-06 19:31:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37679 states. [2018-11-06 19:31:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37679 states to 37679 states and 41262 transitions. [2018-11-06 19:31:53,085 INFO L78 Accepts]: Start accepts. Automaton has 37679 states and 41262 transitions. Word has length 599 [2018-11-06 19:31:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:31:53,086 INFO L480 AbstractCegarLoop]: Abstraction has 37679 states and 41262 transitions. [2018-11-06 19:31:53,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:31:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37679 states and 41262 transitions. [2018-11-06 19:31:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-11-06 19:31:53,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:31:53,105 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:53,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:31:53,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:31:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1020744260, now seen corresponding path program 1 times [2018-11-06 19:31:53,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:31:53,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:31:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:31:53,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:31:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:31:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:31:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 99 proven. 435 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 19:31:54,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:31:54,635 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:31:54,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:31:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:31:54,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:31:55,375 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 31 [2018-11-06 19:31:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 431 proven. 104 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 19:31:57,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:31:57,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 19:31:57,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:31:57,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:31:57,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:31:57,737 INFO L87 Difference]: Start difference. First operand 37679 states and 41262 transitions. Second operand 9 states. [2018-11-06 19:32:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:32:27,481 INFO L93 Difference]: Finished difference Result 107334 states and 116990 transitions. [2018-11-06 19:32:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 19:32:27,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 602 [2018-11-06 19:32:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:32:27,546 INFO L225 Difference]: With dead ends: 107334 [2018-11-06 19:32:27,547 INFO L226 Difference]: Without dead ends: 64523 [2018-11-06 19:32:27,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 610 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-06 19:32:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64523 states. [2018-11-06 19:32:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64523 to 48314. [2018-11-06 19:32:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48314 states. [2018-11-06 19:32:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48314 states to 48314 states and 51854 transitions. [2018-11-06 19:32:28,053 INFO L78 Accepts]: Start accepts. Automaton has 48314 states and 51854 transitions. Word has length 602 [2018-11-06 19:32:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:32:28,053 INFO L480 AbstractCegarLoop]: Abstraction has 48314 states and 51854 transitions. [2018-11-06 19:32:28,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:32:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 48314 states and 51854 transitions. [2018-11-06 19:32:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2018-11-06 19:32:28,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:32:28,072 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:32:28,072 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:32:28,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:32:28,073 INFO L82 PathProgramCache]: Analyzing trace with hash -107300692, now seen corresponding path program 1 times [2018-11-06 19:32:28,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:32:28,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:32:28,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:32:28,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:32:28,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:32:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:32:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2018-11-06 19:32:28,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:32:28,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:32:28,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:32:28,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:32:28,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:32:28,709 INFO L87 Difference]: Start difference. First operand 48314 states and 51854 transitions. Second operand 3 states. [2018-11-06 19:32:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:32:31,450 INFO L93 Difference]: Finished difference Result 100891 states and 108542 transitions. [2018-11-06 19:32:31,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:32:31,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 752 [2018-11-06 19:32:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:32:31,503 INFO L225 Difference]: With dead ends: 100891 [2018-11-06 19:32:31,503 INFO L226 Difference]: Without dead ends: 51718 [2018-11-06 19:32:31,530 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:32:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51718 states. [2018-11-06 19:32:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51718 to 48731. [2018-11-06 19:32:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48731 states. [2018-11-06 19:32:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48731 states to 48731 states and 52121 transitions. [2018-11-06 19:32:31,944 INFO L78 Accepts]: Start accepts. Automaton has 48731 states and 52121 transitions. Word has length 752 [2018-11-06 19:32:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:32:31,945 INFO L480 AbstractCegarLoop]: Abstraction has 48731 states and 52121 transitions. [2018-11-06 19:32:31,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:32:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48731 states and 52121 transitions. [2018-11-06 19:32:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2018-11-06 19:32:31,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:32:31,960 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:31,961 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:32:31,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:32:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash 734639147, now seen corresponding path program 1 times [2018-11-06 19:32:31,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:32:31,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:32:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:32:31,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:32:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:32:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:32:32,680 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-11-06 19:32:32,856 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2018-11-06 19:32:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-11-06 19:32:33,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:32:33,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:32:33,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:32:33,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:32:33,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:32:33,714 INFO L87 Difference]: Start difference. First operand 48731 states and 52121 transitions. Second operand 4 states. [2018-11-06 19:32:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:32:37,976 INFO L93 Difference]: Finished difference Result 108564 states and 116069 transitions. [2018-11-06 19:32:37,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:32:37,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 796 [2018-11-06 19:32:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:32:38,037 INFO L225 Difference]: With dead ends: 108564 [2018-11-06 19:32:38,038 INFO L226 Difference]: Without dead ends: 57697 [2018-11-06 19:32:38,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:32:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57697 states. [2018-11-06 19:32:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57697 to 54702. [2018-11-06 19:32:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54702 states. [2018-11-06 19:32:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54702 states to 54702 states and 58104 transitions. [2018-11-06 19:32:38,566 INFO L78 Accepts]: Start accepts. Automaton has 54702 states and 58104 transitions. Word has length 796 [2018-11-06 19:32:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:32:38,567 INFO L480 AbstractCegarLoop]: Abstraction has 54702 states and 58104 transitions. [2018-11-06 19:32:38,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:32:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 54702 states and 58104 transitions. [2018-11-06 19:32:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2018-11-06 19:32:38,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:32:38,583 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:38,583 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:32:38,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:32:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash -496634279, now seen corresponding path program 1 times [2018-11-06 19:32:38,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:32:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:32:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:32:38,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:32:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:32:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:32:39,376 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-11-06 19:32:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 982 proven. 80 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-06 19:32:40,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:32:40,312 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:32:40,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:32:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:32:40,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:32:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2018-11-06 19:32:43,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:32:43,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 19:32:43,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:32:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:32:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:32:43,241 INFO L87 Difference]: Start difference. First operand 54702 states and 58104 transitions. Second operand 6 states. [2018-11-06 19:32:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:32:55,193 INFO L93 Difference]: Finished difference Result 122648 states and 130120 transitions. [2018-11-06 19:32:55,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:32:55,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 824 [2018-11-06 19:32:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:32:55,261 INFO L225 Difference]: With dead ends: 122648 [2018-11-06 19:32:55,262 INFO L226 Difference]: Without dead ends: 68374 [2018-11-06 19:32:55,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:32:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68374 states. [2018-11-06 19:32:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68374 to 58537. [2018-11-06 19:32:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58537 states. [2018-11-06 19:32:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58537 states to 58537 states and 61704 transitions. [2018-11-06 19:32:56,136 INFO L78 Accepts]: Start accepts. Automaton has 58537 states and 61704 transitions. Word has length 824 [2018-11-06 19:32:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:32:56,136 INFO L480 AbstractCegarLoop]: Abstraction has 58537 states and 61704 transitions. [2018-11-06 19:32:56,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:32:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 58537 states and 61704 transitions. [2018-11-06 19:32:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2018-11-06 19:32:56,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:32:56,154 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:56,155 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:32:56,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:32:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash 538344873, now seen corresponding path program 1 times [2018-11-06 19:32:56,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:32:56,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:32:56,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:32:56,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:32:56,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:32:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:32:57,470 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 19:32:57,830 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-11-06 19:32:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 100 proven. 634 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 19:32:58,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:32:58,919 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:32:58,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:32:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:32:59,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:32:59,690 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 18 [2018-11-06 19:33:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 432 proven. 303 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 19:33:01,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:33:01,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 19:33:01,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:33:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:33:01,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:33:01,774 INFO L87 Difference]: Start difference. First operand 58537 states and 61704 transitions. Second operand 9 states. [2018-11-06 19:33:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:33:20,109 INFO L93 Difference]: Finished difference Result 129879 states and 136870 transitions. [2018-11-06 19:33:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 19:33:20,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 829 [2018-11-06 19:33:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:33:20,189 INFO L225 Difference]: With dead ends: 129879 [2018-11-06 19:33:20,189 INFO L226 Difference]: Without dead ends: 67924 [2018-11-06 19:33:20,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 830 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:33:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67924 states. [2018-11-06 19:33:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67924 to 58105. [2018-11-06 19:33:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58105 states. [2018-11-06 19:33:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58105 states to 58105 states and 61050 transitions. [2018-11-06 19:33:20,838 INFO L78 Accepts]: Start accepts. Automaton has 58105 states and 61050 transitions. Word has length 829 [2018-11-06 19:33:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:33:20,839 INFO L480 AbstractCegarLoop]: Abstraction has 58105 states and 61050 transitions. [2018-11-06 19:33:20,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:33:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 58105 states and 61050 transitions. [2018-11-06 19:33:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2018-11-06 19:33:20,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:33:20,865 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 19:33:20,865 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:33:20,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:33:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash 52255012, now seen corresponding path program 1 times [2018-11-06 19:33:20,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:33:20,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:33:20,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:33:20,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:33:20,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:33:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-06 19:33:21,334 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-06 19:33:21,340 INFO L168 Benchmark]: Toolchain (without parser) took 234055.99 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -347.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-06 19:33:21,341 INFO L168 Benchmark]: CDTParser took 0.22 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:33:21,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1630.03 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:33:21,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 505.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -900.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:33:21,346 INFO L168 Benchmark]: Boogie Preprocessor took 313.26 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.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:33:21,347 INFO L168 Benchmark]: RCFGBuilder took 8475.85 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: 481.7 MB). Peak memory consumption was 481.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:33:21,348 INFO L168 Benchmark]: TraceAbstraction took 223125.65 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 1.8 GB in the end (delta: -93.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-06 19:33:21,364 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.22 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 1630.03 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 505.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -900.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 313.26 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.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8475.85 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: 481.7 MB). Peak memory consumption was 481.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223125.65 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 1.8 GB in the end (delta: -93.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown