java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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/Problem03_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:01:55,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:01:55,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:01:55,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:01:55,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:01:55,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:01:55,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:01:55,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:01:55,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:01:55,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:01:55,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:01:55,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:01:55,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:01:55,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:01:55,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:01:55,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:01:55,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:01:55,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:01:55,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:01:55,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:01:55,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:01:55,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:01:55,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:01:55,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:01:55,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:01:55,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:01:55,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:01:55,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:01:55,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:01:55,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:01:55,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:01:55,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:01:55,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:01:55,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:01:55,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:01:55,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:01:55,333 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 15:01:55,348 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:01:55,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:01:55,349 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:01:55,349 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:01:55,350 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:01:55,350 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:01:55,350 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:01:55,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:01:55,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:01:55,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:01:55,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:01:55,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:01:55,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:01:55,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:01:55,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:01:55,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:01:55,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:01:55,353 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:01:55,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:01:55,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:01:55,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:01:55,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:01:55,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:01:55,354 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:01:55,354 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:01:55,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:01:55,355 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:01:55,355 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:01:55,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:01:55,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:01:55,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:01:55,422 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:01:55,423 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:01:55,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label56_true-unreach-call.c [2018-10-24 15:01:55,491 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1ec47629a/b57f4cf9fafe47869990e7cbe8b93355/FLAG49693464c [2018-10-24 15:01:56,132 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:01:56,133 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label56_true-unreach-call.c [2018-10-24 15:01:56,150 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1ec47629a/b57f4cf9fafe47869990e7cbe8b93355/FLAG49693464c [2018-10-24 15:01:56,166 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1ec47629a/b57f4cf9fafe47869990e7cbe8b93355 [2018-10-24 15:01:56,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:01:56,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:01:56,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:01:56,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:01:56,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:01:56,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:01:56" (1/1) ... [2018-10-24 15:01:56,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea74f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:56, skipping insertion in model container [2018-10-24 15:01:56,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:01:56" (1/1) ... [2018-10-24 15:01:56,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:01:56,308 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:01:57,109 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:01:57,115 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:01:57,371 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:01:57,398 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:01:57,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57 WrapperNode [2018-10-24 15:01:57,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:01:57,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:01:57,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:01:57,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:01:57,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:01:57,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:01:57,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:01:57,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:01:57,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... [2018-10-24 15:01:57,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:01:57,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:01:57,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:01:57,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:01:57,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:01:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:01:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:01:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:02:03,398 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:02:03,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:02:03 BoogieIcfgContainer [2018-10-24 15:02:03,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:02:03,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:02:03,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:02:03,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:02:03,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:01:56" (1/3) ... [2018-10-24 15:02:03,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148dab79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:02:03, skipping insertion in model container [2018-10-24 15:02:03,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:01:57" (2/3) ... [2018-10-24 15:02:03,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148dab79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:02:03, skipping insertion in model container [2018-10-24 15:02:03,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:02:03" (3/3) ... [2018-10-24 15:02:03,411 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label56_true-unreach-call.c [2018-10-24 15:02:03,422 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:02:03,434 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:02:03,453 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:02:03,500 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:02:03,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:02:03,501 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:02:03,501 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:02:03,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:02:03,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:02:03,502 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:02:03,502 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:02:03,502 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:02:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:02:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-24 15:02:03,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:03,552 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:02:03,555 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:03,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 87318124, now seen corresponding path program 1 times [2018-10-24 15:02:03,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:03,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:03,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:04,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:04,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:04,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:04,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:04,659 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 15:02:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:08,407 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-10-24 15:02:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:08,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-10-24 15:02:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:08,438 INFO L225 Difference]: With dead ends: 1079 [2018-10-24 15:02:08,439 INFO L226 Difference]: Without dead ends: 769 [2018-10-24 15:02:08,444 INFO L605 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-10-24 15:02:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-24 15:02:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-10-24 15:02:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-24 15:02:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-10-24 15:02:08,569 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 174 [2018-10-24 15:02:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:08,573 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-10-24 15:02:08,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-10-24 15:02:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 15:02:08,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:08,589 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 15:02:08,589 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:08,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:08,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2060318933, now seen corresponding path program 1 times [2018-10-24 15:02:08,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:08,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:08,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:08,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:08,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:02:08,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:08,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:08,838 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-10-24 15:02:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:11,236 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-10-24 15:02:11,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:11,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-24 15:02:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:11,244 INFO L225 Difference]: With dead ends: 1449 [2018-10-24 15:02:11,244 INFO L226 Difference]: Without dead ends: 938 [2018-10-24 15:02:11,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 15:02:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-24 15:02:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-10-24 15:02:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 15:02:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 15:02:11,280 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 183 [2018-10-24 15:02:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:11,280 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 15:02:11,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:02:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 15:02:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-24 15:02:11,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:11,285 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 15:02:11,285 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:11,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2090442349, now seen corresponding path program 1 times [2018-10-24 15:02:11,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:11,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:11,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:11,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:11,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:11,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:11,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:11,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:11,419 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 4 states. [2018-10-24 15:02:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:15,179 INFO L93 Difference]: Finished difference Result 3530 states and 5871 transitions. [2018-10-24 15:02:15,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:15,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-24 15:02:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:15,195 INFO L225 Difference]: With dead ends: 3530 [2018-10-24 15:02:15,195 INFO L226 Difference]: Without dead ends: 2609 [2018-10-24 15:02:15,198 INFO L605 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-10-24 15:02:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2018-10-24 15:02:15,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1750. [2018-10-24 15:02:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-24 15:02:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2700 transitions. [2018-10-24 15:02:15,246 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2700 transitions. Word has length 184 [2018-10-24 15:02:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:15,246 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 2700 transitions. [2018-10-24 15:02:15,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2700 transitions. [2018-10-24 15:02:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-24 15:02:15,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:15,252 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 15:02:15,252 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:15,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash -805935034, now seen corresponding path program 1 times [2018-10-24 15:02:15,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:15,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:15,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:15,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:15,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:02:15,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:15,385 INFO L87 Difference]: Start difference. First operand 1750 states and 2700 transitions. Second operand 3 states. [2018-10-24 15:02:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:16,822 INFO L93 Difference]: Finished difference Result 4327 states and 6643 transitions. [2018-10-24 15:02:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:16,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2018-10-24 15:02:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:16,838 INFO L225 Difference]: With dead ends: 4327 [2018-10-24 15:02:16,838 INFO L226 Difference]: Without dead ends: 2579 [2018-10-24 15:02:16,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 15:02:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2018-10-24 15:02:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2578. [2018-10-24 15:02:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2018-10-24 15:02:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3889 transitions. [2018-10-24 15:02:16,904 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3889 transitions. Word has length 185 [2018-10-24 15:02:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:16,905 INFO L481 AbstractCegarLoop]: Abstraction has 2578 states and 3889 transitions. [2018-10-24 15:02:16,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:02:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3889 transitions. [2018-10-24 15:02:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-24 15:02:16,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:16,913 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:02:16,913 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:16,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:16,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1997399041, now seen corresponding path program 1 times [2018-10-24 15:02:16,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:16,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:16,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:02:17,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:17,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:17,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:17,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:17,306 INFO L87 Difference]: Start difference. First operand 2578 states and 3889 transitions. Second operand 3 states. [2018-10-24 15:02:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:19,280 INFO L93 Difference]: Finished difference Result 7609 states and 11523 transitions. [2018-10-24 15:02:19,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:19,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-10-24 15:02:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:19,305 INFO L225 Difference]: With dead ends: 7609 [2018-10-24 15:02:19,305 INFO L226 Difference]: Without dead ends: 5033 [2018-10-24 15:02:19,310 INFO L605 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-10-24 15:02:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2018-10-24 15:02:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 5032. [2018-10-24 15:02:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5032 states. [2018-10-24 15:02:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 7054 transitions. [2018-10-24 15:02:19,404 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 7054 transitions. Word has length 191 [2018-10-24 15:02:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:19,405 INFO L481 AbstractCegarLoop]: Abstraction has 5032 states and 7054 transitions. [2018-10-24 15:02:19,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:02:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 7054 transitions. [2018-10-24 15:02:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-24 15:02:19,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:19,419 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:02:19,420 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:19,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash -469460966, now seen corresponding path program 1 times [2018-10-24 15:02:19,421 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:19,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:19,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:19,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:19,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:19,912 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 15:02:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:20,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:02:20,027 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:02:20,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:20,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:02:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:02:20,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:02:20,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 15:02:20,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 15:02:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 15:02:20,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:02:20,380 INFO L87 Difference]: Start difference. First operand 5032 states and 7054 transitions. Second operand 7 states. [2018-10-24 15:02:21,887 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:02:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:27,399 INFO L93 Difference]: Finished difference Result 22542 states and 31619 transitions. [2018-10-24 15:02:27,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 15:02:27,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2018-10-24 15:02:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:27,467 INFO L225 Difference]: With dead ends: 22542 [2018-10-24 15:02:27,467 INFO L226 Difference]: Without dead ends: 17512 [2018-10-24 15:02:27,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-24 15:02:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17512 states. [2018-10-24 15:02:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17512 to 16278. [2018-10-24 15:02:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16278 states. [2018-10-24 15:02:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16278 states to 16278 states and 19571 transitions. [2018-10-24 15:02:27,823 INFO L78 Accepts]: Start accepts. Automaton has 16278 states and 19571 transitions. Word has length 193 [2018-10-24 15:02:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:27,823 INFO L481 AbstractCegarLoop]: Abstraction has 16278 states and 19571 transitions. [2018-10-24 15:02:27,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:02:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 16278 states and 19571 transitions. [2018-10-24 15:02:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-24 15:02:27,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:27,856 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:02:27,857 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:27,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:27,857 INFO L82 PathProgramCache]: Analyzing trace with hash -61273728, now seen corresponding path program 1 times [2018-10-24 15:02:27,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:27,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 15:02:28,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:28,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:28,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:28,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:28,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:28,211 INFO L87 Difference]: Start difference. First operand 16278 states and 19571 transitions. Second operand 4 states. [2018-10-24 15:02:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:29,778 INFO L93 Difference]: Finished difference Result 32349 states and 38826 transitions. [2018-10-24 15:02:29,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:29,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2018-10-24 15:02:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:29,821 INFO L225 Difference]: With dead ends: 32349 [2018-10-24 15:02:29,823 INFO L226 Difference]: Without dead ends: 16073 [2018-10-24 15:02:29,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16073 states. [2018-10-24 15:02:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16073 to 16072. [2018-10-24 15:02:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16072 states. [2018-10-24 15:02:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 18562 transitions. [2018-10-24 15:02:30,077 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 18562 transitions. Word has length 218 [2018-10-24 15:02:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:30,078 INFO L481 AbstractCegarLoop]: Abstraction has 16072 states and 18562 transitions. [2018-10-24 15:02:30,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 18562 transitions. [2018-10-24 15:02:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-24 15:02:30,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:30,106 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:02:30,106 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:30,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1151906626, now seen corresponding path program 1 times [2018-10-24 15:02:30,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:30,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:30,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:30,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:30,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:30,603 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 15:02:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:30,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:30,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:30,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:30,661 INFO L87 Difference]: Start difference. First operand 16072 states and 18562 transitions. Second operand 4 states. [2018-10-24 15:02:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:33,046 INFO L93 Difference]: Finished difference Result 39551 states and 45542 transitions. [2018-10-24 15:02:33,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:33,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-10-24 15:02:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:33,094 INFO L225 Difference]: With dead ends: 39551 [2018-10-24 15:02:33,095 INFO L226 Difference]: Without dead ends: 23481 [2018-10-24 15:02:33,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23481 states. [2018-10-24 15:02:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23481 to 18126. [2018-10-24 15:02:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18126 states. [2018-10-24 15:02:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18126 states to 18126 states and 20829 transitions. [2018-10-24 15:02:33,393 INFO L78 Accepts]: Start accepts. Automaton has 18126 states and 20829 transitions. Word has length 238 [2018-10-24 15:02:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:33,393 INFO L481 AbstractCegarLoop]: Abstraction has 18126 states and 20829 transitions. [2018-10-24 15:02:33,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 18126 states and 20829 transitions. [2018-10-24 15:02:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-24 15:02:33,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:33,424 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:02:33,424 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:33,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1089644182, now seen corresponding path program 1 times [2018-10-24 15:02:33,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:33,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:33,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:02:33,680 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:02:33,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:33,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:02:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:02:33,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:02:33,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 15:02:33,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 15:02:33,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 15:02:33,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 15:02:33,952 INFO L87 Difference]: Start difference. First operand 18126 states and 20829 transitions. Second operand 6 states. [2018-10-24 15:02:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:38,877 INFO L93 Difference]: Finished difference Result 58010 states and 67052 transitions. [2018-10-24 15:02:38,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 15:02:38,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2018-10-24 15:02:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:39,174 INFO L225 Difference]: With dead ends: 58010 [2018-10-24 15:02:39,174 INFO L226 Difference]: Without dead ends: 39886 [2018-10-24 15:02:39,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-24 15:02:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39886 states. [2018-10-24 15:02:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39886 to 33951. [2018-10-24 15:02:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33951 states. [2018-10-24 15:02:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33951 states to 33951 states and 38016 transitions. [2018-10-24 15:02:39,703 INFO L78 Accepts]: Start accepts. Automaton has 33951 states and 38016 transitions. Word has length 246 [2018-10-24 15:02:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:39,703 INFO L481 AbstractCegarLoop]: Abstraction has 33951 states and 38016 transitions. [2018-10-24 15:02:39,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 15:02:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 33951 states and 38016 transitions. [2018-10-24 15:02:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-24 15:02:39,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:39,743 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:02:39,743 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:39,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash -263270503, now seen corresponding path program 1 times [2018-10-24 15:02:39,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:39,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:39,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-24 15:02:39,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:39,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:02:39,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:39,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:39,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:39,914 INFO L87 Difference]: Start difference. First operand 33951 states and 38016 transitions. Second operand 3 states. [2018-10-24 15:02:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:41,280 INFO L93 Difference]: Finished difference Result 63552 states and 71066 transitions. [2018-10-24 15:02:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:41,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-10-24 15:02:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:41,320 INFO L225 Difference]: With dead ends: 63552 [2018-10-24 15:02:41,320 INFO L226 Difference]: Without dead ends: 29603 [2018-10-24 15:02:41,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 15:02:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29603 states. [2018-10-24 15:02:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29603 to 26332. [2018-10-24 15:02:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26332 states. [2018-10-24 15:02:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26332 states to 26332 states and 29322 transitions. [2018-10-24 15:02:41,682 INFO L78 Accepts]: Start accepts. Automaton has 26332 states and 29322 transitions. Word has length 248 [2018-10-24 15:02:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:41,683 INFO L481 AbstractCegarLoop]: Abstraction has 26332 states and 29322 transitions. [2018-10-24 15:02:41,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:02:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 26332 states and 29322 transitions. [2018-10-24 15:02:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-24 15:02:41,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:41,698 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:02:41,698 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:41,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1007711525, now seen corresponding path program 1 times [2018-10-24 15:02:41,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:41,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:41,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 15:02:41,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:41,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:41,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:41,970 INFO L87 Difference]: Start difference. First operand 26332 states and 29322 transitions. Second operand 4 states. [2018-10-24 15:02:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:44,199 INFO L93 Difference]: Finished difference Result 85396 states and 94836 transitions. [2018-10-24 15:02:44,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:44,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2018-10-24 15:02:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:44,265 INFO L225 Difference]: With dead ends: 85396 [2018-10-24 15:02:44,265 INFO L226 Difference]: Without dead ends: 59066 [2018-10-24 15:02:44,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59066 states. [2018-10-24 15:02:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59066 to 44078. [2018-10-24 15:02:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44078 states. [2018-10-24 15:02:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44078 states to 44078 states and 48660 transitions. [2018-10-24 15:02:44,836 INFO L78 Accepts]: Start accepts. Automaton has 44078 states and 48660 transitions. Word has length 263 [2018-10-24 15:02:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:44,837 INFO L481 AbstractCegarLoop]: Abstraction has 44078 states and 48660 transitions. [2018-10-24 15:02:44,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 44078 states and 48660 transitions. [2018-10-24 15:02:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-24 15:02:44,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:44,853 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 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] [2018-10-24 15:02:44,853 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:44,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash 738292085, now seen corresponding path program 1 times [2018-10-24 15:02:44,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:44,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:44,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:44,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:44,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:45,382 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 15:02:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 15:02:45,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:45,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:02:45,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:02:45,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:02:45,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:02:45,445 INFO L87 Difference]: Start difference. First operand 44078 states and 48660 transitions. Second operand 5 states. [2018-10-24 15:02:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:47,734 INFO L93 Difference]: Finished difference Result 111945 states and 123537 transitions. [2018-10-24 15:02:47,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:02:47,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-10-24 15:02:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:47,808 INFO L225 Difference]: With dead ends: 111945 [2018-10-24 15:02:47,809 INFO L226 Difference]: Without dead ends: 67869 [2018-10-24 15:02:47,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:02:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67869 states. [2018-10-24 15:02:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67869 to 63549. [2018-10-24 15:02:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63549 states. [2018-10-24 15:02:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63549 states to 63549 states and 69942 transitions. [2018-10-24 15:02:48,603 INFO L78 Accepts]: Start accepts. Automaton has 63549 states and 69942 transitions. Word has length 269 [2018-10-24 15:02:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:48,604 INFO L481 AbstractCegarLoop]: Abstraction has 63549 states and 69942 transitions. [2018-10-24 15:02:48,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:02:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 63549 states and 69942 transitions. [2018-10-24 15:02:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-24 15:02:48,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:48,622 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:02:48,623 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:48,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1364505268, now seen corresponding path program 1 times [2018-10-24 15:02:48,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:48,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:48,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:49,336 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-24 15:02:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:49,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:49,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:02:49,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:02:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:02:49,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:02:49,855 INFO L87 Difference]: Start difference. First operand 63549 states and 69942 transitions. Second operand 5 states. [2018-10-24 15:02:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:53,772 INFO L93 Difference]: Finished difference Result 301104 states and 331112 transitions. [2018-10-24 15:02:53,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:02:53,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-10-24 15:02:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:54,110 INFO L225 Difference]: With dead ends: 301104 [2018-10-24 15:02:54,110 INFO L226 Difference]: Without dead ends: 237557 [2018-10-24 15:02:54,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:02:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237557 states. [2018-10-24 15:02:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237557 to 174215. [2018-10-24 15:02:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174215 states. [2018-10-24 15:02:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174215 states to 174215 states and 191324 transitions. [2018-10-24 15:02:57,414 INFO L78 Accepts]: Start accepts. Automaton has 174215 states and 191324 transitions. Word has length 284 [2018-10-24 15:02:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:57,414 INFO L481 AbstractCegarLoop]: Abstraction has 174215 states and 191324 transitions. [2018-10-24 15:02:57,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:02:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 174215 states and 191324 transitions. [2018-10-24 15:02:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-24 15:02:57,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:57,440 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:02:57,441 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:57,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash 382011990, now seen corresponding path program 1 times [2018-10-24 15:02:57,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:57,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:57,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:57,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:57,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 15:02:57,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:57,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:02:57,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:57,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:57,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:57,803 INFO L87 Difference]: Start difference. First operand 174215 states and 191324 transitions. Second operand 4 states. [2018-10-24 15:03:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:00,608 INFO L93 Difference]: Finished difference Result 355421 states and 389897 transitions. [2018-10-24 15:03:00,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:00,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2018-10-24 15:03:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:00,843 INFO L225 Difference]: With dead ends: 355421 [2018-10-24 15:03:00,844 INFO L226 Difference]: Without dead ends: 181208 [2018-10-24 15:03:00,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181208 states. [2018-10-24 15:03:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181208 to 173803. [2018-10-24 15:03:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173803 states. [2018-10-24 15:03:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173803 states to 173803 states and 189632 transitions. [2018-10-24 15:03:04,319 INFO L78 Accepts]: Start accepts. Automaton has 173803 states and 189632 transitions. Word has length 370 [2018-10-24 15:03:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:04,319 INFO L481 AbstractCegarLoop]: Abstraction has 173803 states and 189632 transitions. [2018-10-24 15:03:04,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 173803 states and 189632 transitions. [2018-10-24 15:03:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-24 15:03:04,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:04,351 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:03:04,352 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:04,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:04,352 INFO L82 PathProgramCache]: Analyzing trace with hash 327372158, now seen corresponding path program 1 times [2018-10-24 15:03:04,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:04,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:04,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:04,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-10-24 15:03:04,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:04,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:04,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:04,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:04,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:04,712 INFO L87 Difference]: Start difference. First operand 173803 states and 189632 transitions. Second operand 4 states. [2018-10-24 15:03:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:09,341 INFO L93 Difference]: Finished difference Result 503641 states and 547654 transitions. [2018-10-24 15:03:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:09,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2018-10-24 15:03:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:09,786 INFO L225 Difference]: With dead ends: 503641 [2018-10-24 15:03:09,786 INFO L226 Difference]: Without dead ends: 329840 [2018-10-24 15:03:09,911 INFO L605 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-10-24 15:03:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329840 states. [2018-10-24 15:03:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329840 to 324307. [2018-10-24 15:03:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324307 states. [2018-10-24 15:03:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324307 states to 324307 states and 351944 transitions. [2018-10-24 15:03:19,983 INFO L78 Accepts]: Start accepts. Automaton has 324307 states and 351944 transitions. Word has length 376 [2018-10-24 15:03:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:19,983 INFO L481 AbstractCegarLoop]: Abstraction has 324307 states and 351944 transitions. [2018-10-24 15:03:19,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 324307 states and 351944 transitions. [2018-10-24 15:03:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-24 15:03:20,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:20,011 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:20,012 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:20,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2139616138, now seen corresponding path program 1 times [2018-10-24 15:03:20,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:20,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:20,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:20,671 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-24 15:03:20,900 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-10-24 15:03:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 203 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 15:03:21,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:03:21,046 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:03:21,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:21,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:03:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 15:03:21,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:03:21,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-24 15:03:21,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 15:03:21,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 15:03:21,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 15:03:21,386 INFO L87 Difference]: Start difference. First operand 324307 states and 351944 transitions. Second operand 8 states. [2018-10-24 15:03:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:45,520 INFO L93 Difference]: Finished difference Result 3034105 states and 3282455 transitions. [2018-10-24 15:03:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 15:03:45,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 397 [2018-10-24 15:03:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:04:06,680 INFO L225 Difference]: With dead ends: 3034105 [2018-10-24 15:04:06,680 INFO L226 Difference]: Without dead ends: 2703240 [2018-10-24 15:04:07,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 396 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-24 15:04:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703240 states. [2018-10-24 15:04:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703240 to 1679271. [2018-10-24 15:04:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679271 states. [2018-10-24 15:05:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679271 states to 1679271 states and 1803974 transitions. [2018-10-24 15:05:03,539 INFO L78 Accepts]: Start accepts. Automaton has 1679271 states and 1803974 transitions. Word has length 397 [2018-10-24 15:05:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:05:03,539 INFO L481 AbstractCegarLoop]: Abstraction has 1679271 states and 1803974 transitions. [2018-10-24 15:05:03,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 15:05:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1679271 states and 1803974 transitions. [2018-10-24 15:05:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-24 15:05:03,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:05:03,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:05:03,612 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:05:03,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:05:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1787065866, now seen corresponding path program 1 times [2018-10-24 15:05:03,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:05:03,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:05:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:05:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:05:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:05:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:05:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 15:05:04,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:05:04,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:05:04,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:05:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:05:04,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:05:04,026 INFO L87 Difference]: Start difference. First operand 1679271 states and 1803974 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 15:05:13,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:05:13,935 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:05:13,941 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:05:13,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:05:13 BoogieIcfgContainer [2018-10-24 15:05:13,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:05:13,942 INFO L168 Benchmark]: Toolchain (without parser) took 197764.06 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 4.4 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-24 15:05:13,943 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:05:13,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1219.36 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:05:13,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 312.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -857.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:05:13,945 INFO L168 Benchmark]: Boogie Preprocessor took 161.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2018-10-24 15:05:13,946 INFO L168 Benchmark]: RCFGBuilder took 5525.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.4 MB). Peak memory consumption was 253.4 MB. Max. memory is 7.1 GB. [2018-10-24 15:05:13,947 INFO L168 Benchmark]: TraceAbstraction took 190539.95 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-24 15:05:13,952 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1219.36 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 312.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -857.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5525.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.4 MB). Peak memory consumption was 253.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190539.95 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1554]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1554). Cancelled while BasicCegarLoop was constructing difference of abstraction (1679271states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (128606 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 190.4s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 104.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4520 SDtfs, 18772 SDslu, 5296 SDs, 0 SdLazy, 21764 SolverSat, 5304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 921 GetRequests, 857 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1679271occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 76.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1136485 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 5292 NumberOfCodeBlocks, 5292 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5272 ConstructedInterpolants, 0 QuantifiedInterpolants, 3389546 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 2605/2623 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown