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_label00_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:34,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:34,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:34,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:34,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:34,966 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:34,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:34,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:34,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:34,973 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:34,974 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:34,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:34,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:34,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:34,977 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:34,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:34,978 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:34,980 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:34,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:34,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:34,991 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:34,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:34,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:34,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:34,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:35,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:35,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:35,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:35,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:35,010 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:35,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:35,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:35,011 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:35,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:35,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:35,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:35,013 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 14:53:35,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:35,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:35,039 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:35,039 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:35,043 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:35,043 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:35,043 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:35,044 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:35,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:35,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:35,044 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:35,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:35,045 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:35,045 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:35,045 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:35,045 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:35,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:35,047 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:35,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:35,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:35,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:35,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:35,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:35,048 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:35,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:35,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:35,049 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:35,049 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:35,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:35,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:35,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:35,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:35,139 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:35,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label00_true-unreach-call.c [2018-10-24 14:53:35,204 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/112f95c6d/85e65aa177f34a54a3f84f42ebe547bc/FLAG05f0700fa [2018-10-24 14:53:35,962 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:35,965 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label00_true-unreach-call.c [2018-10-24 14:53:35,983 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/112f95c6d/85e65aa177f34a54a3f84f42ebe547bc/FLAG05f0700fa [2018-10-24 14:53:36,000 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/112f95c6d/85e65aa177f34a54a3f84f42ebe547bc [2018-10-24 14:53:36,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:36,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:36,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:36,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:36,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:36,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:36" (1/1) ... [2018-10-24 14:53:36,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe75bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:36, skipping insertion in model container [2018-10-24 14:53:36,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:36" (1/1) ... [2018-10-24 14:53:36,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:36,134 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:36,881 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:36,888 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:37,149 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:37,188 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:37,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37 WrapperNode [2018-10-24 14:53:37,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:37,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:37,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:37,191 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:37,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:37,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:37,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:37,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:37,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:37,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:37,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:37,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:37,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (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 14:53:37,736 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:37,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:37,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:53:43,352 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:53:43,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:43 BoogieIcfgContainer [2018-10-24 14:53:43,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:53:43,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:53:43,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:53:43,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:53:43,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:36" (1/3) ... [2018-10-24 14:53:43,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a09ccc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:43, skipping insertion in model container [2018-10-24 14:53:43,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (2/3) ... [2018-10-24 14:53:43,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a09ccc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:43, skipping insertion in model container [2018-10-24 14:53:43,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:43" (3/3) ... [2018-10-24 14:53:43,362 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label00_true-unreach-call.c [2018-10-24 14:53:43,373 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:53:43,382 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:53:43,396 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:53:43,433 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:53:43,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:53:43,435 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:53:43,435 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:53:43,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:53:43,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:53:43,435 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:53:43,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:53:43,436 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:53:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:53:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-24 14:53:43,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:43,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:43,493 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:43,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash -140925822, now seen corresponding path program 1 times [2018-10-24 14:53:43,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:43,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:43,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:43,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:43,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:44,549 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 14:53:44,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:44,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:44,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:44,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:44,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:44,582 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:53:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:48,366 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-24 14:53:48,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:48,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2018-10-24 14:53:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:48,394 INFO L225 Difference]: With dead ends: 1027 [2018-10-24 14:53:48,395 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 14:53:48,400 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 14:53:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 14:53:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-24 14:53:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-24 14:53:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-24 14:53:48,505 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 193 [2018-10-24 14:53:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:48,506 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-24 14:53:48,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-24 14:53:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 14:53:48,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:48,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:48,528 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:48,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash -85332637, now seen corresponding path program 1 times [2018-10-24 14:53:48,529 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:48,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:48,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:48,703 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 14:53:48,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:48,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:48,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:48,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:48,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:48,707 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-24 14:53:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:50,851 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-24 14:53:50,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:50,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-24 14:53:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:50,861 INFO L225 Difference]: With dead ends: 2058 [2018-10-24 14:53:50,861 INFO L226 Difference]: Without dead ends: 1345 [2018-10-24 14:53:50,865 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 14:53:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-24 14:53:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-24 14:53:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 14:53:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-24 14:53:50,920 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 202 [2018-10-24 14:53:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:50,920 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-24 14:53:50,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-24 14:53:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-24 14:53:50,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:50,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:50,926 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:50,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1441718287, now seen corresponding path program 1 times [2018-10-24 14:53:50,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:50,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:50,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:50,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:51,197 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 14:53:51,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:51,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:51,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:51,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:51,199 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-24 14:53:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:55,714 INFO L93 Difference]: Finished difference Result 3901 states and 6135 transitions. [2018-10-24 14:53:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:55,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-24 14:53:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:55,731 INFO L225 Difference]: With dead ends: 3901 [2018-10-24 14:53:55,731 INFO L226 Difference]: Without dead ends: 2572 [2018-10-24 14:53:55,734 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 14:53:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2018-10-24 14:53:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2558. [2018-10-24 14:53:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-10-24 14:53:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3854 transitions. [2018-10-24 14:53:55,790 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3854 transitions. Word has length 210 [2018-10-24 14:53:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:55,791 INFO L481 AbstractCegarLoop]: Abstraction has 2558 states and 3854 transitions. [2018-10-24 14:53:55,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3854 transitions. [2018-10-24 14:53:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-24 14:53:55,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:55,800 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:55,800 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:55,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1369914862, now seen corresponding path program 1 times [2018-10-24 14:53:55,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:55,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:55,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:55,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:53:56,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:56,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:56,020 INFO L87 Difference]: Start difference. First operand 2558 states and 3854 transitions. Second operand 3 states. [2018-10-24 14:53:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:57,202 INFO L93 Difference]: Finished difference Result 5091 states and 7675 transitions. [2018-10-24 14:53:57,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:57,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-10-24 14:53:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:57,218 INFO L225 Difference]: With dead ends: 5091 [2018-10-24 14:53:57,218 INFO L226 Difference]: Without dead ends: 2535 [2018-10-24 14:53:57,222 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 14:53:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-10-24 14:53:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2535. [2018-10-24 14:53:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2018-10-24 14:53:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3747 transitions. [2018-10-24 14:53:57,278 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3747 transitions. Word has length 224 [2018-10-24 14:53:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:57,278 INFO L481 AbstractCegarLoop]: Abstraction has 2535 states and 3747 transitions. [2018-10-24 14:53:57,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3747 transitions. [2018-10-24 14:53:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-24 14:53:57,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:57,288 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:57,288 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:57,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:57,289 INFO L82 PathProgramCache]: Analyzing trace with hash 356198142, now seen corresponding path program 1 times [2018-10-24 14:53:57,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:57,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:57,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:57,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:57,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:53:57,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:57,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:57,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:57,560 INFO L87 Difference]: Start difference. First operand 2535 states and 3747 transitions. Second operand 3 states. [2018-10-24 14:53:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:58,859 INFO L93 Difference]: Finished difference Result 7314 states and 10763 transitions. [2018-10-24 14:53:58,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:58,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-10-24 14:53:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:58,881 INFO L225 Difference]: With dead ends: 7314 [2018-10-24 14:53:58,881 INFO L226 Difference]: Without dead ends: 4781 [2018-10-24 14:53:58,886 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 14:53:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2018-10-24 14:53:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2018-10-24 14:53:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2018-10-24 14:53:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6617 transitions. [2018-10-24 14:53:58,972 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6617 transitions. Word has length 245 [2018-10-24 14:53:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:58,972 INFO L481 AbstractCegarLoop]: Abstraction has 4778 states and 6617 transitions. [2018-10-24 14:53:58,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6617 transitions. [2018-10-24 14:53:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-24 14:53:58,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:58,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:58,984 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:58,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1504104924, now seen corresponding path program 1 times [2018-10-24 14:53:58,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:58,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:59,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:59,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:59,216 INFO L87 Difference]: Start difference. First operand 4778 states and 6617 transitions. Second operand 4 states. [2018-10-24 14:54:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:02,262 INFO L93 Difference]: Finished difference Result 17750 states and 24441 transitions. [2018-10-24 14:54:02,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:02,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-10-24 14:54:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:02,312 INFO L225 Difference]: With dead ends: 17750 [2018-10-24 14:54:02,312 INFO L226 Difference]: Without dead ends: 12974 [2018-10-24 14:54:02,322 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 14:54:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12974 states. [2018-10-24 14:54:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12974 to 9063. [2018-10-24 14:54:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-10-24 14:54:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 11954 transitions. [2018-10-24 14:54:02,490 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 11954 transitions. Word has length 248 [2018-10-24 14:54:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:02,491 INFO L481 AbstractCegarLoop]: Abstraction has 9063 states and 11954 transitions. [2018-10-24 14:54:02,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 11954 transitions. [2018-10-24 14:54:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-24 14:54:02,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:02,511 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:02,511 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:02,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:02,511 INFO L82 PathProgramCache]: Analyzing trace with hash 394890776, now seen corresponding path program 1 times [2018-10-24 14:54:02,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:02,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:02,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:02,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:02,730 INFO L87 Difference]: Start difference. First operand 9063 states and 11954 transitions. Second operand 3 states. [2018-10-24 14:54:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:04,320 INFO L93 Difference]: Finished difference Result 26082 states and 34266 transitions. [2018-10-24 14:54:04,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:04,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2018-10-24 14:54:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:04,368 INFO L225 Difference]: With dead ends: 26082 [2018-10-24 14:54:04,368 INFO L226 Difference]: Without dead ends: 17021 [2018-10-24 14:54:04,379 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 14:54:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17021 states. [2018-10-24 14:54:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17021 to 17020. [2018-10-24 14:54:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-10-24 14:54:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 21216 transitions. [2018-10-24 14:54:04,615 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 21216 transitions. Word has length 272 [2018-10-24 14:54:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:04,615 INFO L481 AbstractCegarLoop]: Abstraction has 17020 states and 21216 transitions. [2018-10-24 14:54:04,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 21216 transitions. [2018-10-24 14:54:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-24 14:54:04,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:04,648 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:04,648 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:04,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:04,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1396159378, now seen corresponding path program 1 times [2018-10-24 14:54:04,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:04,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:04,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:04,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:54:04,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:04,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:04,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:04,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:04,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:04,814 INFO L87 Difference]: Start difference. First operand 17020 states and 21216 transitions. Second operand 3 states. [2018-10-24 14:54:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:06,634 INFO L93 Difference]: Finished difference Result 34041 states and 42435 transitions. [2018-10-24 14:54:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:06,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-10-24 14:54:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:06,658 INFO L225 Difference]: With dead ends: 34041 [2018-10-24 14:54:06,658 INFO L226 Difference]: Without dead ends: 17023 [2018-10-24 14:54:06,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 14:54:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17023 states. [2018-10-24 14:54:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17023 to 17020. [2018-10-24 14:54:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-10-24 14:54:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 19940 transitions. [2018-10-24 14:54:06,897 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 19940 transitions. Word has length 279 [2018-10-24 14:54:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:06,897 INFO L481 AbstractCegarLoop]: Abstraction has 17020 states and 19940 transitions. [2018-10-24 14:54:06,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 19940 transitions. [2018-10-24 14:54:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-24 14:54:06,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:06,929 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, 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] [2018-10-24 14:54:06,929 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:06,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:06,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1920303954, now seen corresponding path program 1 times [2018-10-24 14:54:06,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:06,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:06,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:06,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:06,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-24 14:54:07,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:07,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:07,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:07,138 INFO L87 Difference]: Start difference. First operand 17020 states and 19940 transitions. Second operand 3 states. [2018-10-24 14:54:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:09,413 INFO L93 Difference]: Finished difference Result 43268 states and 50595 transitions. [2018-10-24 14:54:09,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:09,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2018-10-24 14:54:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:09,456 INFO L225 Difference]: With dead ends: 43268 [2018-10-24 14:54:09,457 INFO L226 Difference]: Without dead ends: 26250 [2018-10-24 14:54:09,474 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 14:54:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26250 states. [2018-10-24 14:54:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26250 to 26246. [2018-10-24 14:54:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26246 states. [2018-10-24 14:54:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26246 states to 26246 states and 30594 transitions. [2018-10-24 14:54:09,786 INFO L78 Accepts]: Start accepts. Automaton has 26246 states and 30594 transitions. Word has length 288 [2018-10-24 14:54:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:09,786 INFO L481 AbstractCegarLoop]: Abstraction has 26246 states and 30594 transitions. [2018-10-24 14:54:09,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 26246 states and 30594 transitions. [2018-10-24 14:54:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-24 14:54:09,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:09,833 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, 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] [2018-10-24 14:54:09,833 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:09,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:09,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1014461186, now seen corresponding path program 1 times [2018-10-24 14:54:09,834 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:09,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:09,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:09,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:09,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:10,173 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:54:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-24 14:54:10,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:10,257 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 14:54:10,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:10,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-24 14:54:10,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:10,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 14:54:10,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:54:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:54:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:54:10,653 INFO L87 Difference]: Start difference. First operand 26246 states and 30594 transitions. Second operand 6 states. [2018-10-24 14:54:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:16,765 INFO L93 Difference]: Finished difference Result 92652 states and 108452 transitions. [2018-10-24 14:54:16,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:54:16,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 296 [2018-10-24 14:54:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:16,874 INFO L225 Difference]: With dead ends: 92652 [2018-10-24 14:54:16,875 INFO L226 Difference]: Without dead ends: 66408 [2018-10-24 14:54:16,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:54:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66408 states. [2018-10-24 14:54:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66408 to 66395. [2018-10-24 14:54:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66395 states. [2018-10-24 14:54:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66395 states to 66395 states and 74051 transitions. [2018-10-24 14:54:17,849 INFO L78 Accepts]: Start accepts. Automaton has 66395 states and 74051 transitions. Word has length 296 [2018-10-24 14:54:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:17,850 INFO L481 AbstractCegarLoop]: Abstraction has 66395 states and 74051 transitions. [2018-10-24 14:54:17,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:54:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 66395 states and 74051 transitions. [2018-10-24 14:54:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-24 14:54:17,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:17,903 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:54:17,903 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:17,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash 75966581, now seen corresponding path program 1 times [2018-10-24 14:54:17,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:18,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:18,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:18,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:18,245 INFO L87 Difference]: Start difference. First operand 66395 states and 74051 transitions. Second operand 3 states. [2018-10-24 14:54:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:20,490 INFO L93 Difference]: Finished difference Result 172563 states and 192282 transitions. [2018-10-24 14:54:20,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:20,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-10-24 14:54:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:20,667 INFO L225 Difference]: With dead ends: 172563 [2018-10-24 14:54:20,667 INFO L226 Difference]: Without dead ends: 106170 [2018-10-24 14:54:21,289 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 14:54:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106170 states. [2018-10-24 14:54:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106170 to 106165. [2018-10-24 14:54:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106165 states. [2018-10-24 14:54:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106165 states to 106165 states and 118120 transitions. [2018-10-24 14:54:22,631 INFO L78 Accepts]: Start accepts. Automaton has 106165 states and 118120 transitions. Word has length 309 [2018-10-24 14:54:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:22,632 INFO L481 AbstractCegarLoop]: Abstraction has 106165 states and 118120 transitions. [2018-10-24 14:54:22,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 106165 states and 118120 transitions. [2018-10-24 14:54:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-24 14:54:22,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:22,672 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:54:22,672 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:22,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1119691337, now seen corresponding path program 1 times [2018-10-24 14:54:22,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:23,197 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-10-24 14:54:23,518 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-10-24 14:54:23,640 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-10-24 14:54:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:24,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:24,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-24 14:54:24,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 14:54:24,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 14:54:24,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:54:24,140 INFO L87 Difference]: Start difference. First operand 106165 states and 118120 transitions. Second operand 11 states. [2018-10-24 14:54:24,408 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-10-24 14:54:24,680 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-24 14:54:25,748 WARN L179 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-24 14:54:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:31,514 INFO L93 Difference]: Finished difference Result 316695 states and 350556 transitions. [2018-10-24 14:54:31,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:54:31,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 317 [2018-10-24 14:54:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:31,801 INFO L225 Difference]: With dead ends: 316695 [2018-10-24 14:54:31,801 INFO L226 Difference]: Without dead ends: 210532 [2018-10-24 14:54:31,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-10-24 14:54:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210532 states. [2018-10-24 14:54:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210532 to 208205. [2018-10-24 14:54:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208205 states. [2018-10-24 14:54:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208205 states to 208205 states and 229907 transitions. [2018-10-24 14:54:35,086 INFO L78 Accepts]: Start accepts. Automaton has 208205 states and 229907 transitions. Word has length 317 [2018-10-24 14:54:35,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:35,086 INFO L481 AbstractCegarLoop]: Abstraction has 208205 states and 229907 transitions. [2018-10-24 14:54:35,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 14:54:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 208205 states and 229907 transitions. [2018-10-24 14:54:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-24 14:54:35,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:35,166 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:35,167 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:35,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash 638448842, now seen corresponding path program 1 times [2018-10-24 14:54:35,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:35,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-24 14:54:35,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:35,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:35,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:35,475 INFO L87 Difference]: Start difference. First operand 208205 states and 229907 transitions. Second operand 4 states. [2018-10-24 14:54:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:40,321 INFO L93 Difference]: Finished difference Result 611371 states and 673474 transitions. [2018-10-24 14:54:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:40,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-10-24 14:54:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:40,924 INFO L225 Difference]: With dead ends: 611371 [2018-10-24 14:54:40,924 INFO L226 Difference]: Without dead ends: 403168 [2018-10-24 14:54:41,096 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 14:54:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403168 states. [2018-10-24 14:54:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403168 to 398428. [2018-10-24 14:54:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398428 states. [2018-10-24 14:54:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398428 states to 398428 states and 438317 transitions. [2018-10-24 14:54:55,562 INFO L78 Accepts]: Start accepts. Automaton has 398428 states and 438317 transitions. Word has length 352 [2018-10-24 14:54:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:55,563 INFO L481 AbstractCegarLoop]: Abstraction has 398428 states and 438317 transitions. [2018-10-24 14:54:55,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 398428 states and 438317 transitions. [2018-10-24 14:54:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-24 14:54:55,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:55,743 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:55,743 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:55,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1588013163, now seen corresponding path program 1 times [2018-10-24 14:54:55,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:55,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:55,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:55,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:55,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-24 14:54:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:56,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:56,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:56,097 INFO L87 Difference]: Start difference. First operand 398428 states and 438317 transitions. Second operand 4 states. [2018-10-24 14:55:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:00,684 INFO L93 Difference]: Finished difference Result 788779 states and 868194 transitions. [2018-10-24 14:55:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:00,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2018-10-24 14:55:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:01,160 INFO L225 Difference]: With dead ends: 788779 [2018-10-24 14:55:01,160 INFO L226 Difference]: Without dead ends: 390353 [2018-10-24 14:55:01,350 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 14:55:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390353 states. [2018-10-24 14:55:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390353 to 389413. [2018-10-24 14:55:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389413 states. [2018-10-24 14:55:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389413 states to 389413 states and 426656 transitions. [2018-10-24 14:55:08,433 INFO L78 Accepts]: Start accepts. Automaton has 389413 states and 426656 transitions. Word has length 407 [2018-10-24 14:55:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:08,433 INFO L481 AbstractCegarLoop]: Abstraction has 389413 states and 426656 transitions. [2018-10-24 14:55:08,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:55:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 389413 states and 426656 transitions. [2018-10-24 14:55:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-24 14:55:08,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:08,594 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:55:08,594 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:08,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1713250798, now seen corresponding path program 1 times [2018-10-24 14:55:08,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:08,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:08,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:08,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-24 14:55:10,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:10,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:10,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:10,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:10,206 INFO L87 Difference]: Start difference. First operand 389413 states and 426656 transitions. Second operand 4 states. [2018-10-24 14:55:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:14,095 INFO L93 Difference]: Finished difference Result 778894 states and 853437 transitions. [2018-10-24 14:55:14,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:14,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2018-10-24 14:55:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:14,644 INFO L225 Difference]: With dead ends: 778894 [2018-10-24 14:55:14,644 INFO L226 Difference]: Without dead ends: 389483 [2018-10-24 14:55:16,629 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 14:55:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389483 states. [2018-10-24 14:55:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389483 to 389413. [2018-10-24 14:55:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389413 states. [2018-10-24 14:55:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389413 states to 389413 states and 422300 transitions. [2018-10-24 14:55:28,706 INFO L78 Accepts]: Start accepts. Automaton has 389413 states and 422300 transitions. Word has length 421 [2018-10-24 14:55:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:28,707 INFO L481 AbstractCegarLoop]: Abstraction has 389413 states and 422300 transitions. [2018-10-24 14:55:28,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:55:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 389413 states and 422300 transitions. [2018-10-24 14:55:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-24 14:55:28,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:28,850 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:55:28,850 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:28,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1675745500, now seen corresponding path program 1 times [2018-10-24 14:55:28,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:28,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:28,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:28,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-24 14:55:29,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:29,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:29,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:29,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:29,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:29,090 INFO L87 Difference]: Start difference. First operand 389413 states and 422300 transitions. Second operand 3 states. [2018-10-24 14:55:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:33,422 INFO L93 Difference]: Finished difference Result 726612 states and 789610 transitions. [2018-10-24 14:55:33,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:33,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 428 [2018-10-24 14:55:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:33,940 INFO L225 Difference]: With dead ends: 726612 [2018-10-24 14:55:33,941 INFO L226 Difference]: Without dead ends: 337201 [2018-10-24 14:55:34,155 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 14:55:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337201 states. [2018-10-24 14:55:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337201 to 333900. [2018-10-24 14:55:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333900 states. [2018-10-24 14:55:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333900 states to 333900 states and 361760 transitions. [2018-10-24 14:55:40,079 INFO L78 Accepts]: Start accepts. Automaton has 333900 states and 361760 transitions. Word has length 428 [2018-10-24 14:55:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:40,080 INFO L481 AbstractCegarLoop]: Abstraction has 333900 states and 361760 transitions. [2018-10-24 14:55:40,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:55:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 333900 states and 361760 transitions. [2018-10-24 14:55:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-24 14:55:40,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:40,293 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:55:40,294 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:40,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1325914097, now seen corresponding path program 1 times [2018-10-24 14:55:40,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:40,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:40,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:40,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:40,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-10-24 14:55:41,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:41,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:41,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:41,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:41,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:41,647 INFO L87 Difference]: Start difference. First operand 333900 states and 361760 transitions. Second operand 4 states. [2018-10-24 14:55:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:45,736 INFO L93 Difference]: Finished difference Result 686819 states and 744054 transitions. [2018-10-24 14:55:45,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:45,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-10-24 14:55:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:46,193 INFO L225 Difference]: With dead ends: 686819 [2018-10-24 14:55:46,193 INFO L226 Difference]: Without dead ends: 352921 [2018-10-24 14:55:47,819 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 14:55:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352921 states. [2018-10-24 14:55:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352921 to 349616. [2018-10-24 14:55:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349616 states. [2018-10-24 14:56:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349616 states to 349616 states and 376657 transitions. [2018-10-24 14:56:01,103 INFO L78 Accepts]: Start accepts. Automaton has 349616 states and 376657 transitions. Word has length 505 [2018-10-24 14:56:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:01,103 INFO L481 AbstractCegarLoop]: Abstraction has 349616 states and 376657 transitions. [2018-10-24 14:56:01,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 349616 states and 376657 transitions. [2018-10-24 14:56:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-10-24 14:56:01,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:01,310 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:01,311 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:01,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash 300999508, now seen corresponding path program 1 times [2018-10-24 14:56:01,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:01,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:01,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:01,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:01,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-10-24 14:56:01,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:01,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:01,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:01,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:01,776 INFO L87 Difference]: Start difference. First operand 349616 states and 376657 transitions. Second operand 4 states. [2018-10-24 14:56:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:07,018 INFO L93 Difference]: Finished difference Result 1242314 states and 1338493 transitions. [2018-10-24 14:56:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:07,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2018-10-24 14:56:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:09,794 INFO L225 Difference]: With dead ends: 1242314 [2018-10-24 14:56:09,795 INFO L226 Difference]: Without dead ends: 892700 [2018-10-24 14:56:10,051 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 14:56:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892700 states. [2018-10-24 14:56:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892700 to 563316. [2018-10-24 14:56:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563316 states. [2018-10-24 14:56:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563316 states to 563316 states and 607091 transitions. [2018-10-24 14:56:21,320 INFO L78 Accepts]: Start accepts. Automaton has 563316 states and 607091 transitions. Word has length 518 [2018-10-24 14:56:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:21,320 INFO L481 AbstractCegarLoop]: Abstraction has 563316 states and 607091 transitions. [2018-10-24 14:56:21,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 563316 states and 607091 transitions. [2018-10-24 14:56:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-10-24 14:56:21,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:21,570 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:21,570 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:21,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:21,571 INFO L82 PathProgramCache]: Analyzing trace with hash 196498271, now seen corresponding path program 1 times [2018-10-24 14:56:21,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:21,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:21,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:21,928 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 14:56:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-10-24 14:56:22,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:22,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:22,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:22,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:22,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:22,310 INFO L87 Difference]: Start difference. First operand 563316 states and 607091 transitions. Second operand 4 states. [2018-10-24 14:56:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:33,882 INFO L93 Difference]: Finished difference Result 1620908 states and 1746208 transitions. [2018-10-24 14:56:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:33,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 540 [2018-10-24 14:56:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:35,554 INFO L225 Difference]: With dead ends: 1620908 [2018-10-24 14:56:35,555 INFO L226 Difference]: Without dead ends: 1057594 [2018-10-24 14:56:35,765 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 14:56:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057594 states. Received shutdown request... [2018-10-24 14:56:50,275 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:56:50,279 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:56:50,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:56:50 BoogieIcfgContainer [2018-10-24 14:56:50,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:56:50,281 INFO L168 Benchmark]: Toolchain (without parser) took 194268.61 ms. Allocated memory was 1.5 GB in the beginning and 6.9 GB in the end (delta: 5.3 GB). Free memory was 1.4 GB in the beginning and 4.3 GB in the end (delta: -2.9 GB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. [2018-10-24 14:56:50,282 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:56:50,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1175.16 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:50,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 320.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -882.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:50,284 INFO L168 Benchmark]: Boogie Preprocessor took 151.88 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:50,285 INFO L168 Benchmark]: RCFGBuilder took 5690.84 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: 255.4 MB). Peak memory consumption was 255.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:50,286 INFO L168 Benchmark]: TraceAbstraction took 186925.24 ms. Allocated memory was 2.3 GB in the beginning and 6.9 GB in the end (delta: 4.6 GB). Free memory was 1.9 GB in the beginning and 4.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. [2018-10-24 14:56:50,291 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1175.16 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 320.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -882.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.88 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5690.84 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: 255.4 MB). Peak memory consumption was 255.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186925.24 ms. Allocated memory was 2.3 GB in the beginning and 6.9 GB in the end (delta: 4.6 GB). Free memory was 1.9 GB in the beginning and 4.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1611]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1611). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 186.8s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 89.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4559 SDtfs, 11069 SDslu, 2888 SDs, 0 SdLazy, 18422 SolverSat, 3714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563316occurred in iteration=18, 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: 85.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 348037 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 6550 NumberOfCodeBlocks, 6550 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 6530 ConstructedInterpolants, 0 QuantifiedInterpolants, 6540273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 4483/4487 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown