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-0fd1304 [2018-10-23 18:49:48,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:49:48,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:49:48,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:49:48,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:49:48,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:49:48,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:49:48,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:49:48,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:49:48,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:49:48,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:49:48,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:49:48,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:49:48,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:49:48,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:49:48,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:49:48,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:49:48,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:49:48,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:49:48,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:49:48,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:49:48,309 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:49:48,312 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:49:48,312 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:49:48,313 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:49:48,314 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:49:48,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:49:48,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:49:48,317 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:49:48,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:49:48,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:49:48,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:49:48,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:49:48,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:49:48,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:49:48,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:49:48,323 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-23 18:49:48,351 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:49:48,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:49:48,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:49:48,352 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:49:48,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:49:48,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:49:48,353 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:49:48,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:49:48,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:49:48,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:49:48,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:49:48,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:49:48,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:49:48,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:49:48,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:49:48,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:49:48,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:49:48,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:49:48,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:49:48,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:49:48,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:49:48,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:49:48,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:49:48,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:49:48,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:49:48,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:49:48,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:49:48,357 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:49:48,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:49:48,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:49:48,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:49:48,440 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:49:48,440 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:49:48,441 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-23 18:49:48,507 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4878fb3d0/a62ba08b7b744b4ea398e010cfb47d8d/FLAG7cf8389a0 [2018-10-23 18:49:49,168 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:49:49,169 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label00_true-unreach-call.c [2018-10-23 18:49:49,191 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4878fb3d0/a62ba08b7b744b4ea398e010cfb47d8d/FLAG7cf8389a0 [2018-10-23 18:49:49,211 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4878fb3d0/a62ba08b7b744b4ea398e010cfb47d8d [2018-10-23 18:49:49,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:49:49,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:49:49,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:49:49,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:49:49,233 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:49:49,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:49:49" (1/1) ... [2018-10-23 18:49:49,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f2d59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:49, skipping insertion in model container [2018-10-23 18:49:49,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:49:49" (1/1) ... [2018-10-23 18:49:49,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:49:49,341 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:49:50,115 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:49:50,121 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:49:50,405 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:49:50,428 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:49:50,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50 WrapperNode [2018-10-23 18:49:50,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:49:50,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:49:50,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:49:50,431 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:49:50,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:49:50,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:49:50,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:49:50,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:49:50,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:49:50,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:49:50,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:49:50,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:49:50,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (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-23 18:49:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:49:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:49:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:49:56,390 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:49:56,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:49:56 BoogieIcfgContainer [2018-10-23 18:49:56,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:49:56,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:49:56,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:49:56,396 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:49:56,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:49:49" (1/3) ... [2018-10-23 18:49:56,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eed3607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:49:56, skipping insertion in model container [2018-10-23 18:49:56,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50" (2/3) ... [2018-10-23 18:49:56,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eed3607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:49:56, skipping insertion in model container [2018-10-23 18:49:56,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:49:56" (3/3) ... [2018-10-23 18:49:56,400 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label00_true-unreach-call.c [2018-10-23 18:49:56,411 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:49:56,420 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:49:56,437 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:49:56,475 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:49:56,476 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:49:56,476 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:49:56,476 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:49:56,476 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:49:56,477 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:49:56,477 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:49:56,477 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:49:56,477 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:49:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:49:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-23 18:49:56,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:49:56,527 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-23 18:49:56,529 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:49:56,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:49:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash -140925822, now seen corresponding path program 1 times [2018-10-23 18:49:56,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:49:56,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:49:56,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:49:56,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:49:56,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:49:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:49:57,509 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-23 18:49:57,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:49:57,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:49:57,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:49:57,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:49:57,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:49:57,540 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:50:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:01,502 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-23 18:50:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:01,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2018-10-23 18:50:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:01,541 INFO L225 Difference]: With dead ends: 1027 [2018-10-23 18:50:01,541 INFO L226 Difference]: Without dead ends: 717 [2018-10-23 18:50:01,549 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-23 18:50:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-23 18:50:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-23 18:50:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-23 18:50:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-23 18:50:01,671 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 193 [2018-10-23 18:50:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:01,672 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-23 18:50:01,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-23 18:50:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-23 18:50:01,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:01,694 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-23 18:50:01,694 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:01,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash -85332637, now seen corresponding path program 1 times [2018-10-23 18:50:01,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:01,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:01,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:01,846 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-23 18:50:01,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:01,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:01,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:01,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:01,851 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-23 18:50:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:04,008 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-23 18:50:04,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:04,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-23 18:50:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:04,017 INFO L225 Difference]: With dead ends: 2058 [2018-10-23 18:50:04,018 INFO L226 Difference]: Without dead ends: 1345 [2018-10-23 18:50:04,022 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-23 18:50:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-23 18:50:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-23 18:50:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-23 18:50:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-23 18:50:04,073 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 202 [2018-10-23 18:50:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:04,074 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-23 18:50:04,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-23 18:50:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-23 18:50:04,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:04,080 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-23 18:50:04,080 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:04,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1441718287, now seen corresponding path program 1 times [2018-10-23 18:50:04,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:04,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:04,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:04,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:04,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:04,362 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-23 18:50:04,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:04,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:04,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:04,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:04,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:04,364 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-23 18:50:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:07,834 INFO L93 Difference]: Finished difference Result 3901 states and 6135 transitions. [2018-10-23 18:50:07,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:07,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-23 18:50:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:07,849 INFO L225 Difference]: With dead ends: 3901 [2018-10-23 18:50:07,850 INFO L226 Difference]: Without dead ends: 2572 [2018-10-23 18:50:07,852 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-23 18:50:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2018-10-23 18:50:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2558. [2018-10-23 18:50:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-10-23 18:50:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3854 transitions. [2018-10-23 18:50:07,906 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3854 transitions. Word has length 210 [2018-10-23 18:50:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:07,906 INFO L481 AbstractCegarLoop]: Abstraction has 2558 states and 3854 transitions. [2018-10-23 18:50:07,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3854 transitions. [2018-10-23 18:50:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-23 18:50:07,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:07,914 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-23 18:50:07,915 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:07,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:07,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1369914862, now seen corresponding path program 1 times [2018-10-23 18:50:07,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:07,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:07,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:07,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:07,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:08,093 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-23 18:50:08,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:08,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:08,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:08,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:08,096 INFO L87 Difference]: Start difference. First operand 2558 states and 3854 transitions. Second operand 3 states. [2018-10-23 18:50:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:10,192 INFO L93 Difference]: Finished difference Result 5091 states and 7675 transitions. [2018-10-23 18:50:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:10,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-10-23 18:50:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:10,207 INFO L225 Difference]: With dead ends: 5091 [2018-10-23 18:50:10,208 INFO L226 Difference]: Without dead ends: 2535 [2018-10-23 18:50:10,212 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-23 18:50:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-10-23 18:50:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2535. [2018-10-23 18:50:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2018-10-23 18:50:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3747 transitions. [2018-10-23 18:50:10,269 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3747 transitions. Word has length 224 [2018-10-23 18:50:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:10,269 INFO L481 AbstractCegarLoop]: Abstraction has 2535 states and 3747 transitions. [2018-10-23 18:50:10,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3747 transitions. [2018-10-23 18:50:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-23 18:50:10,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:10,278 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-23 18:50:10,279 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:10,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:10,279 INFO L82 PathProgramCache]: Analyzing trace with hash 356198142, now seen corresponding path program 1 times [2018-10-23 18:50:10,279 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:10,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:10,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:10,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:10,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:10,513 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-23 18:50:10,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:10,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:10,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:10,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:10,515 INFO L87 Difference]: Start difference. First operand 2535 states and 3747 transitions. Second operand 3 states. [2018-10-23 18:50:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:12,073 INFO L93 Difference]: Finished difference Result 7314 states and 10763 transitions. [2018-10-23 18:50:12,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:12,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-10-23 18:50:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:12,096 INFO L225 Difference]: With dead ends: 7314 [2018-10-23 18:50:12,096 INFO L226 Difference]: Without dead ends: 4781 [2018-10-23 18:50:12,101 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-23 18:50:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2018-10-23 18:50:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2018-10-23 18:50:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2018-10-23 18:50:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6617 transitions. [2018-10-23 18:50:12,188 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6617 transitions. Word has length 245 [2018-10-23 18:50:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:12,188 INFO L481 AbstractCegarLoop]: Abstraction has 4778 states and 6617 transitions. [2018-10-23 18:50:12,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6617 transitions. [2018-10-23 18:50:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-23 18:50:12,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:12,201 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-23 18:50:12,201 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:12,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1504104924, now seen corresponding path program 1 times [2018-10-23 18:50:12,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:12,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:12,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:12,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:12,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:12,528 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-23 18:50:12,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:12,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:12,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:12,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:12,530 INFO L87 Difference]: Start difference. First operand 4778 states and 6617 transitions. Second operand 4 states. [2018-10-23 18:50:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:15,303 INFO L93 Difference]: Finished difference Result 17750 states and 24441 transitions. [2018-10-23 18:50:15,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:15,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-10-23 18:50:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:15,358 INFO L225 Difference]: With dead ends: 17750 [2018-10-23 18:50:15,358 INFO L226 Difference]: Without dead ends: 12974 [2018-10-23 18:50:15,368 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-23 18:50:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12974 states. [2018-10-23 18:50:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12974 to 9063. [2018-10-23 18:50:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-10-23 18:50:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 11954 transitions. [2018-10-23 18:50:15,532 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 11954 transitions. Word has length 248 [2018-10-23 18:50:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:15,533 INFO L481 AbstractCegarLoop]: Abstraction has 9063 states and 11954 transitions. [2018-10-23 18:50:15,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 11954 transitions. [2018-10-23 18:50:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-23 18:50:15,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:15,552 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-23 18:50:15,553 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:15,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash 394890776, now seen corresponding path program 1 times [2018-10-23 18:50:15,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:15,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:15,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:15,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:15,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:15,778 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-23 18:50:15,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:15,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:15,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:15,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:15,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:15,784 INFO L87 Difference]: Start difference. First operand 9063 states and 11954 transitions. Second operand 3 states. [2018-10-23 18:50:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:17,335 INFO L93 Difference]: Finished difference Result 26082 states and 34266 transitions. [2018-10-23 18:50:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:17,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2018-10-23 18:50:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:17,373 INFO L225 Difference]: With dead ends: 26082 [2018-10-23 18:50:17,374 INFO L226 Difference]: Without dead ends: 17021 [2018-10-23 18:50:17,385 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-23 18:50:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17021 states. [2018-10-23 18:50:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17021 to 17020. [2018-10-23 18:50:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-10-23 18:50:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 21216 transitions. [2018-10-23 18:50:17,614 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 21216 transitions. Word has length 272 [2018-10-23 18:50:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:17,614 INFO L481 AbstractCegarLoop]: Abstraction has 17020 states and 21216 transitions. [2018-10-23 18:50:17,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 21216 transitions. [2018-10-23 18:50:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-23 18:50:17,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:17,647 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-23 18:50:17,647 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:17,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1396159378, now seen corresponding path program 1 times [2018-10-23 18:50:17,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:17,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:17,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-23 18:50:17,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:17,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:17,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:17,813 INFO L87 Difference]: Start difference. First operand 17020 states and 21216 transitions. Second operand 3 states. [2018-10-23 18:50:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:19,447 INFO L93 Difference]: Finished difference Result 34041 states and 42435 transitions. [2018-10-23 18:50:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:19,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-10-23 18:50:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:19,480 INFO L225 Difference]: With dead ends: 34041 [2018-10-23 18:50:19,480 INFO L226 Difference]: Without dead ends: 17023 [2018-10-23 18:50:19,497 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-23 18:50:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17023 states. [2018-10-23 18:50:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17023 to 17020. [2018-10-23 18:50:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-10-23 18:50:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 19940 transitions. [2018-10-23 18:50:19,695 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 19940 transitions. Word has length 279 [2018-10-23 18:50:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:19,695 INFO L481 AbstractCegarLoop]: Abstraction has 17020 states and 19940 transitions. [2018-10-23 18:50:19,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 19940 transitions. [2018-10-23 18:50:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-23 18:50:19,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:19,724 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-23 18:50:19,725 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:19,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1920303954, now seen corresponding path program 1 times [2018-10-23 18:50:19,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:19,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:19,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:19,939 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-23 18:50:19,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:19,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:19,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:19,940 INFO L87 Difference]: Start difference. First operand 17020 states and 19940 transitions. Second operand 3 states. [2018-10-23 18:50:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:21,727 INFO L93 Difference]: Finished difference Result 43268 states and 50595 transitions. [2018-10-23 18:50:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:21,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2018-10-23 18:50:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:21,763 INFO L225 Difference]: With dead ends: 43268 [2018-10-23 18:50:21,763 INFO L226 Difference]: Without dead ends: 26250 [2018-10-23 18:50:21,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26250 states. [2018-10-23 18:50:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26250 to 26246. [2018-10-23 18:50:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26246 states. [2018-10-23 18:50:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26246 states to 26246 states and 30594 transitions. [2018-10-23 18:50:22,093 INFO L78 Accepts]: Start accepts. Automaton has 26246 states and 30594 transitions. Word has length 288 [2018-10-23 18:50:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:22,094 INFO L481 AbstractCegarLoop]: Abstraction has 26246 states and 30594 transitions. [2018-10-23 18:50:22,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 26246 states and 30594 transitions. [2018-10-23 18:50:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-23 18:50:22,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:22,131 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-23 18:50:22,131 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:22,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1014461186, now seen corresponding path program 1 times [2018-10-23 18:50:22,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:22,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:22,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:22,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:22,487 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:50:22,676 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-23 18:50:22,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:50:22,676 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-23 18:50:22,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:22,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:50:23,095 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-23 18:50:23,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:50:23,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-23 18:50:23,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:50:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:50:23,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:50:23,131 INFO L87 Difference]: Start difference. First operand 26246 states and 30594 transitions. Second operand 6 states. [2018-10-23 18:50:23,278 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 18:50:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:31,750 INFO L93 Difference]: Finished difference Result 92652 states and 108452 transitions. [2018-10-23 18:50:31,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:50:31,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 296 [2018-10-23 18:50:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:31,854 INFO L225 Difference]: With dead ends: 92652 [2018-10-23 18:50:31,854 INFO L226 Difference]: Without dead ends: 66408 [2018-10-23 18:50:31,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:50:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66408 states. [2018-10-23 18:50:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66408 to 66395. [2018-10-23 18:50:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66395 states. [2018-10-23 18:50:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66395 states to 66395 states and 74051 transitions. [2018-10-23 18:50:32,873 INFO L78 Accepts]: Start accepts. Automaton has 66395 states and 74051 transitions. Word has length 296 [2018-10-23 18:50:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:32,873 INFO L481 AbstractCegarLoop]: Abstraction has 66395 states and 74051 transitions. [2018-10-23 18:50:32,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:50:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 66395 states and 74051 transitions. [2018-10-23 18:50:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-23 18:50:32,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:32,911 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-23 18:50:32,912 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:32,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:32,912 INFO L82 PathProgramCache]: Analyzing trace with hash 75966581, now seen corresponding path program 1 times [2018-10-23 18:50:32,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:32,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:32,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:33,317 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-23 18:50:33,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:33,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:33,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:33,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:33,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:33,319 INFO L87 Difference]: Start difference. First operand 66395 states and 74051 transitions. Second operand 3 states. [2018-10-23 18:50:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:35,987 INFO L93 Difference]: Finished difference Result 172563 states and 192282 transitions. [2018-10-23 18:50:35,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:35,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-10-23 18:50:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:36,595 INFO L225 Difference]: With dead ends: 172563 [2018-10-23 18:50:36,595 INFO L226 Difference]: Without dead ends: 106170 [2018-10-23 18:50:36,642 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-23 18:50:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106170 states. [2018-10-23 18:50:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106170 to 106165. [2018-10-23 18:50:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106165 states. [2018-10-23 18:50:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106165 states to 106165 states and 118120 transitions. [2018-10-23 18:50:37,740 INFO L78 Accepts]: Start accepts. Automaton has 106165 states and 118120 transitions. Word has length 309 [2018-10-23 18:50:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:37,741 INFO L481 AbstractCegarLoop]: Abstraction has 106165 states and 118120 transitions. [2018-10-23 18:50:37,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 106165 states and 118120 transitions. [2018-10-23 18:50:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-23 18:50:37,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:37,784 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-23 18:50:37,784 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:37,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1119691337, now seen corresponding path program 1 times [2018-10-23 18:50:37,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:37,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:37,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:37,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:37,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:38,208 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 18:50:38,615 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-23 18:50:38,975 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-23 18:50:39,961 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-23 18:50:39,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:39,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-23 18:50:39,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 18:50:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 18:50:39,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-23 18:50:39,963 INFO L87 Difference]: Start difference. First operand 106165 states and 118120 transitions. Second operand 11 states. [2018-10-23 18:50:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:47,341 INFO L93 Difference]: Finished difference Result 316695 states and 350556 transitions. [2018-10-23 18:50:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 18:50:47,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 317 [2018-10-23 18:50:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:47,597 INFO L225 Difference]: With dead ends: 316695 [2018-10-23 18:50:47,598 INFO L226 Difference]: Without dead ends: 210532 [2018-10-23 18:50:47,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-10-23 18:50:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210532 states. [2018-10-23 18:50:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210532 to 208205. [2018-10-23 18:50:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208205 states. [2018-10-23 18:50:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208205 states to 208205 states and 229907 transitions. [2018-10-23 18:50:50,807 INFO L78 Accepts]: Start accepts. Automaton has 208205 states and 229907 transitions. Word has length 317 [2018-10-23 18:50:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:50,807 INFO L481 AbstractCegarLoop]: Abstraction has 208205 states and 229907 transitions. [2018-10-23 18:50:50,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 18:50:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 208205 states and 229907 transitions. [2018-10-23 18:50:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-23 18:50:50,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:50,881 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-23 18:50:50,881 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:50,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash 638448842, now seen corresponding path program 1 times [2018-10-23 18:50:50,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:51,096 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-23 18:50:51,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:51,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:51,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:51,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:51,097 INFO L87 Difference]: Start difference. First operand 208205 states and 229907 transitions. Second operand 4 states. [2018-10-23 18:50:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:55,740 INFO L93 Difference]: Finished difference Result 611371 states and 673474 transitions. [2018-10-23 18:50:55,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:55,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-10-23 18:50:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:56,326 INFO L225 Difference]: With dead ends: 611371 [2018-10-23 18:50:56,326 INFO L226 Difference]: Without dead ends: 403168 [2018-10-23 18:50:56,487 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-23 18:50:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403168 states. [2018-10-23 18:51:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403168 to 398428. [2018-10-23 18:51:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398428 states. [2018-10-23 18:51:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398428 states to 398428 states and 438317 transitions. [2018-10-23 18:51:03,512 INFO L78 Accepts]: Start accepts. Automaton has 398428 states and 438317 transitions. Word has length 352 [2018-10-23 18:51:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:03,512 INFO L481 AbstractCegarLoop]: Abstraction has 398428 states and 438317 transitions. [2018-10-23 18:51:03,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:51:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 398428 states and 438317 transitions. [2018-10-23 18:51:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-23 18:51:03,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:03,644 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-23 18:51:03,644 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:03,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1588013163, now seen corresponding path program 1 times [2018-10-23 18:51:03,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:03,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:03,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:04,079 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-23 18:51:04,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:04,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:04,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:04,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:04,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:04,081 INFO L87 Difference]: Start difference. First operand 398428 states and 438317 transitions. Second operand 4 states. [2018-10-23 18:51:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:14,027 INFO L93 Difference]: Finished difference Result 788779 states and 868194 transitions. [2018-10-23 18:51:14,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:51:14,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2018-10-23 18:51:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:14,562 INFO L225 Difference]: With dead ends: 788779 [2018-10-23 18:51:14,562 INFO L226 Difference]: Without dead ends: 390353 [2018-10-23 18:51:14,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390353 states. [2018-10-23 18:51:20,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390353 to 389413. [2018-10-23 18:51:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389413 states. [2018-10-23 18:51:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389413 states to 389413 states and 426656 transitions. [2018-10-23 18:51:20,874 INFO L78 Accepts]: Start accepts. Automaton has 389413 states and 426656 transitions. Word has length 407 [2018-10-23 18:51:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:20,875 INFO L481 AbstractCegarLoop]: Abstraction has 389413 states and 426656 transitions. [2018-10-23 18:51:20,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:51:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 389413 states and 426656 transitions. [2018-10-23 18:51:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-23 18:51:21,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:21,019 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-23 18:51:21,019 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:21,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1713250798, now seen corresponding path program 1 times [2018-10-23 18:51:21,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:21,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:21,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:21,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:21,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:22,605 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-23 18:51:22,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:22,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:22,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:22,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:22,606 INFO L87 Difference]: Start difference. First operand 389413 states and 426656 transitions. Second operand 4 states. [2018-10-23 18:51:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:26,282 INFO L93 Difference]: Finished difference Result 778894 states and 853437 transitions. [2018-10-23 18:51:26,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:51:26,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2018-10-23 18:51:26,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:28,214 INFO L225 Difference]: With dead ends: 778894 [2018-10-23 18:51:28,215 INFO L226 Difference]: Without dead ends: 389483 [2018-10-23 18:51:28,367 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-23 18:51:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389483 states. [2018-10-23 18:51:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389483 to 389413. [2018-10-23 18:51:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389413 states. [2018-10-23 18:51:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389413 states to 389413 states and 422300 transitions. [2018-10-23 18:51:41,195 INFO L78 Accepts]: Start accepts. Automaton has 389413 states and 422300 transitions. Word has length 421 [2018-10-23 18:51:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:41,196 INFO L481 AbstractCegarLoop]: Abstraction has 389413 states and 422300 transitions. [2018-10-23 18:51:41,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:51:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 389413 states and 422300 transitions. [2018-10-23 18:51:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-23 18:51:41,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:41,323 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-23 18:51:41,323 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:41,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1675745500, now seen corresponding path program 1 times [2018-10-23 18:51:41,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:41,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:41,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:41,584 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-23 18:51:41,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:41,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:41,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:51:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:51:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:41,586 INFO L87 Difference]: Start difference. First operand 389413 states and 422300 transitions. Second operand 3 states. [2018-10-23 18:51:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:45,833 INFO L93 Difference]: Finished difference Result 726612 states and 789610 transitions. [2018-10-23 18:51:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:51:45,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 428 [2018-10-23 18:51:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:46,282 INFO L225 Difference]: With dead ends: 726612 [2018-10-23 18:51:46,283 INFO L226 Difference]: Without dead ends: 337201 [2018-10-23 18:51:46,476 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-23 18:51:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337201 states. [2018-10-23 18:51:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337201 to 333900. [2018-10-23 18:51:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333900 states. [2018-10-23 18:51:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333900 states to 333900 states and 361760 transitions. [2018-10-23 18:51:52,341 INFO L78 Accepts]: Start accepts. Automaton has 333900 states and 361760 transitions. Word has length 428 [2018-10-23 18:51:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:52,341 INFO L481 AbstractCegarLoop]: Abstraction has 333900 states and 361760 transitions. [2018-10-23 18:51:52,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:51:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 333900 states and 361760 transitions. [2018-10-23 18:51:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-23 18:51:52,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:52,531 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-23 18:51:52,531 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:52,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1325914097, now seen corresponding path program 1 times [2018-10-23 18:51:52,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:52,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:52,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:54,062 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-23 18:51:54,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:54,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:54,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:54,064 INFO L87 Difference]: Start difference. First operand 333900 states and 361760 transitions. Second operand 4 states. [2018-10-23 18:52:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:00,261 INFO L93 Difference]: Finished difference Result 686819 states and 744054 transitions. [2018-10-23 18:52:00,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:00,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-10-23 18:52:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:00,728 INFO L225 Difference]: With dead ends: 686819 [2018-10-23 18:52:00,728 INFO L226 Difference]: Without dead ends: 352921 [2018-10-23 18:52:00,826 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-23 18:52:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352921 states. [2018-10-23 18:52:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352921 to 349616. [2018-10-23 18:52:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349616 states. [2018-10-23 18:52:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349616 states to 349616 states and 376657 transitions. [2018-10-23 18:52:06,354 INFO L78 Accepts]: Start accepts. Automaton has 349616 states and 376657 transitions. Word has length 505 [2018-10-23 18:52:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:06,355 INFO L481 AbstractCegarLoop]: Abstraction has 349616 states and 376657 transitions. [2018-10-23 18:52:06,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 349616 states and 376657 transitions. [2018-10-23 18:52:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-10-23 18:52:06,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:06,554 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-23 18:52:06,555 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:06,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 300999508, now seen corresponding path program 1 times [2018-10-23 18:52:06,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:06,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:06,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:07,122 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-23 18:52:07,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:07,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:07,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:07,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:07,125 INFO L87 Difference]: Start difference. First operand 349616 states and 376657 transitions. Second operand 4 states. [2018-10-23 18:52:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:17,878 INFO L93 Difference]: Finished difference Result 1242314 states and 1338493 transitions. [2018-10-23 18:52:17,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:17,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2018-10-23 18:52:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:18,965 INFO L225 Difference]: With dead ends: 1242314 [2018-10-23 18:52:18,965 INFO L226 Difference]: Without dead ends: 892700 [2018-10-23 18:52:19,150 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-23 18:52:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892700 states. [2018-10-23 18:52:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892700 to 563316. [2018-10-23 18:52:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563316 states. [2018-10-23 18:52:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563316 states to 563316 states and 607091 transitions. [2018-10-23 18:52:29,985 INFO L78 Accepts]: Start accepts. Automaton has 563316 states and 607091 transitions. Word has length 518 [2018-10-23 18:52:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:29,986 INFO L481 AbstractCegarLoop]: Abstraction has 563316 states and 607091 transitions. [2018-10-23 18:52:29,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 563316 states and 607091 transitions. [2018-10-23 18:52:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-10-23 18:52:30,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:30,201 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-23 18:52:30,201 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:30,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:30,202 INFO L82 PathProgramCache]: Analyzing trace with hash 196498271, now seen corresponding path program 1 times [2018-10-23 18:52:30,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:30,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:30,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:30,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:30,705 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-23 18:52:30,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:30,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:30,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:30,707 INFO L87 Difference]: Start difference. First operand 563316 states and 607091 transitions. Second operand 4 states. [2018-10-23 18:52:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:41,674 INFO L93 Difference]: Finished difference Result 1620908 states and 1746208 transitions. [2018-10-23 18:52:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:41,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 540 [2018-10-23 18:52:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:43,086 INFO L225 Difference]: With dead ends: 1620908 [2018-10-23 18:52:43,086 INFO L226 Difference]: Without dead ends: 1057594 [2018-10-23 18:52:43,291 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-23 18:52:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057594 states. Received shutdown request... [2018-10-23 18:53:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057594 to 1022783. [2018-10-23 18:53:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022783 states. [2018-10-23 18:53:09,161 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:53:09,166 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:53:09,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:53:09 BoogieIcfgContainer [2018-10-23 18:53:09,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:53:09,167 INFO L168 Benchmark]: Toolchain (without parser) took 199942.14 ms. Allocated memory was 1.5 GB in the beginning and 6.7 GB in the end (delta: 5.2 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:09,168 INFO L168 Benchmark]: CDTParser took 0.20 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-23 18:53:09,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1202.26 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: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:09,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 305.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -863.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:09,171 INFO L168 Benchmark]: Boogie Preprocessor took 126.60 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:09,171 INFO L168 Benchmark]: RCFGBuilder took 5527.82 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: 256.0 MB). Peak memory consumption was 256.0 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:09,172 INFO L168 Benchmark]: TraceAbstraction took 192774.17 ms. Allocated memory was 2.3 GB in the beginning and 6.7 GB in the end (delta: 4.4 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:09,178 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.20 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 1202.26 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: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 305.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -863.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.60 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5527.82 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: 256.0 MB). Peak memory consumption was 256.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192774.17 ms. Allocated memory was 2.3 GB in the beginning and 6.7 GB in the end (delta: 4.4 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.5 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 ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.7s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 99.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4559 SDtfs, 11069 SDslu, 2888 SDs, 0 SdLazy, 18422 SolverSat, 3714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.3s 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: 80.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 348037 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s 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