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_label24_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:01:37,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:01:37,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:01:37,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:01:37,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:01:37,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:01:37,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:01:37,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:01:37,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:01:37,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:01:37,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:01:37,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:01:37,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:01:37,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:01:37,400 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:01:37,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:01:37,403 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:01:37,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:01:37,414 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:01:37,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:01:37,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:01:37,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:01:37,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:01:37,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:01:37,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:01:37,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:01:37,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:01:37,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:01:37,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:01:37,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:01:37,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:01:37,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:01:37,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:01:37,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:01:37,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:01:37,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:01:37,435 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-26 20:01:37,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:01:37,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:01:37,462 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:01:37,462 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:01:37,462 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:01:37,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:01:37,463 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:01:37,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:01:37,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:01:37,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:01:37,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:01:37,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:01:37,464 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:01:37,464 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:01:37,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:01:37,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:01:37,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:01:37,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:01:37,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:01:37,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:01:37,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:01:37,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:01:37,466 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:01:37,466 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:01:37,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:01:37,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:01:37,467 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:01:37,467 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:01:37,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:01:37,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:01:37,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:01:37,536 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:01:37,536 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:01:37,537 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label24_true-unreach-call.c [2018-10-26 20:01:37,599 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ffe23464a/8b967748e2674bbe8df99dd1ecd4be64/FLAG26e58f451 [2018-10-26 20:01:38,244 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:01:38,245 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label24_true-unreach-call.c [2018-10-26 20:01:38,263 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ffe23464a/8b967748e2674bbe8df99dd1ecd4be64/FLAG26e58f451 [2018-10-26 20:01:38,283 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ffe23464a/8b967748e2674bbe8df99dd1ecd4be64 [2018-10-26 20:01:38,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:01:38,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:01:38,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:01:38,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:01:38,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:01:38,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:01:38" (1/1) ... [2018-10-26 20:01:38,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6f7036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:38, skipping insertion in model container [2018-10-26 20:01:38,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:01:38" (1/1) ... [2018-10-26 20:01:38,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:01:38,411 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:01:39,210 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:01:39,216 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:01:39,481 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:01:39,509 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:01:39,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39 WrapperNode [2018-10-26 20:01:39,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:01:39,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:01:39,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:01:39,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:01:39,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:01:39,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:01:39,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:01:39,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:01:39,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (1/1) ... [2018-10-26 20:01:39,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:01:39,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:01:39,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:01:39,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:01:39,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (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-26 20:01:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:01:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:01:40,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:01:45,414 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:01:45,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:01:45 BoogieIcfgContainer [2018-10-26 20:01:45,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:01:45,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:01:45,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:01:45,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:01:45,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:01:38" (1/3) ... [2018-10-26 20:01:45,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b69c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:01:45, skipping insertion in model container [2018-10-26 20:01:45,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:39" (2/3) ... [2018-10-26 20:01:45,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b69c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:01:45, skipping insertion in model container [2018-10-26 20:01:45,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:01:45" (3/3) ... [2018-10-26 20:01:45,425 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label24_true-unreach-call.c [2018-10-26 20:01:45,437 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:01:45,447 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:01:45,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:01:45,504 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:01:45,505 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:01:45,505 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:01:45,505 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:01:45,505 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:01:45,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:01:45,506 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:01:45,506 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:01:45,506 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:01:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:01:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 20:01:45,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:45,557 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] [2018-10-26 20:01:45,560 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:45,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash -835830156, now seen corresponding path program 1 times [2018-10-26 20:01:45,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:45,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:45,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:45,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:45,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:46,565 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-26 20:01:46,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:46,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:46,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:46,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:46,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:46,595 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:01:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:50,082 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-26 20:01:50,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:50,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-10-26 20:01:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:50,110 INFO L225 Difference]: With dead ends: 1027 [2018-10-26 20:01:50,110 INFO L226 Difference]: Without dead ends: 717 [2018-10-26 20:01:50,115 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-26 20:01:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-26 20:01:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-26 20:01:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-26 20:01:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-26 20:01:50,231 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 192 [2018-10-26 20:01:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:50,235 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-26 20:01:50,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-26 20:01:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 20:01:50,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:50,252 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] [2018-10-26 20:01:50,252 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:50,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1798362483, now seen corresponding path program 1 times [2018-10-26 20:01:50,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:50,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:50,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:50,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:50,391 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-26 20:01:50,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:50,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:01:50,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:50,395 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-26 20:01:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:52,502 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-26 20:01:52,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:52,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-10-26 20:01:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:52,512 INFO L225 Difference]: With dead ends: 2058 [2018-10-26 20:01:52,512 INFO L226 Difference]: Without dead ends: 1345 [2018-10-26 20:01:52,522 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-26 20:01:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-26 20:01:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-26 20:01:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-26 20:01:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-26 20:01:52,597 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 201 [2018-10-26 20:01:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:52,597 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-26 20:01:52,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-26 20:01:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-26 20:01:52,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:52,606 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] [2018-10-26 20:01:52,606 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:52,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1616061113, now seen corresponding path program 1 times [2018-10-26 20:01:52,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:52,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:52,940 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-26 20:01:52,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:52,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:52,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:52,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:52,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:52,942 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-26 20:01:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:55,205 INFO L93 Difference]: Finished difference Result 3896 states and 6120 transitions. [2018-10-26 20:01:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:55,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-10-26 20:01:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:55,220 INFO L225 Difference]: With dead ends: 3896 [2018-10-26 20:01:55,220 INFO L226 Difference]: Without dead ends: 2567 [2018-10-26 20:01:55,224 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-26 20:01:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2018-10-26 20:01:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2565. [2018-10-26 20:01:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2018-10-26 20:01:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3748 transitions. [2018-10-26 20:01:55,280 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3748 transitions. Word has length 209 [2018-10-26 20:01:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:55,281 INFO L481 AbstractCegarLoop]: Abstraction has 2565 states and 3748 transitions. [2018-10-26 20:01:55,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3748 transitions. [2018-10-26 20:01:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-26 20:01:55,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:55,291 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2018-10-26 20:01:55,291 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:55,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1010119963, now seen corresponding path program 1 times [2018-10-26 20:01:55,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:55,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:55,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:01:55,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:55,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:55,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:55,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:55,536 INFO L87 Difference]: Start difference. First operand 2565 states and 3748 transitions. Second operand 4 states. [2018-10-26 20:01:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:59,428 INFO L93 Difference]: Finished difference Result 5099 states and 7455 transitions. [2018-10-26 20:01:59,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:59,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-10-26 20:01:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:59,445 INFO L225 Difference]: With dead ends: 5099 [2018-10-26 20:01:59,447 INFO L226 Difference]: Without dead ends: 2536 [2018-10-26 20:01:59,450 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-26 20:01:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2018-10-26 20:01:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2018-10-26 20:01:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2018-10-26 20:01:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3609 transitions. [2018-10-26 20:01:59,495 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3609 transitions. Word has length 220 [2018-10-26 20:01:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:59,495 INFO L481 AbstractCegarLoop]: Abstraction has 2536 states and 3609 transitions. [2018-10-26 20:01:59,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3609 transitions. [2018-10-26 20:01:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-26 20:01:59,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:59,503 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:59,503 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:59,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash 326840886, now seen corresponding path program 1 times [2018-10-26 20:01:59,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:59,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:59,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:59,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:59,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:01:59,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:59,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:59,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:59,800 INFO L87 Difference]: Start difference. First operand 2536 states and 3609 transitions. Second operand 4 states. [2018-10-26 20:02:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:02,494 INFO L93 Difference]: Finished difference Result 10131 states and 14422 transitions. [2018-10-26 20:02:02,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:02,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-10-26 20:02:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:02,531 INFO L225 Difference]: With dead ends: 10131 [2018-10-26 20:02:02,531 INFO L226 Difference]: Without dead ends: 7597 [2018-10-26 20:02:02,537 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-26 20:02:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2018-10-26 20:02:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 7593. [2018-10-26 20:02:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-26 20:02:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 10758 transitions. [2018-10-26 20:02:02,677 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 10758 transitions. Word has length 222 [2018-10-26 20:02:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:02,677 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 10758 transitions. [2018-10-26 20:02:02,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 10758 transitions. [2018-10-26 20:02:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-26 20:02:02,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:02,690 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1] [2018-10-26 20:02:02,690 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:02,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2017837485, now seen corresponding path program 1 times [2018-10-26 20:02:02,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:02,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:02,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:02:02,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:02,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:02,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:02,834 INFO L87 Difference]: Start difference. First operand 7593 states and 10758 transitions. Second operand 3 states. [2018-10-26 20:02:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:04,370 INFO L93 Difference]: Finished difference Result 15190 states and 21526 transitions. [2018-10-26 20:02:04,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:04,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-10-26 20:02:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:04,398 INFO L225 Difference]: With dead ends: 15190 [2018-10-26 20:02:04,398 INFO L226 Difference]: Without dead ends: 7599 [2018-10-26 20:02:04,408 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-26 20:02:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-10-26 20:02:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 7593. [2018-10-26 20:02:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-26 20:02:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 9699 transitions. [2018-10-26 20:02:04,530 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 9699 transitions. Word has length 227 [2018-10-26 20:02:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:04,531 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 9699 transitions. [2018-10-26 20:02:04,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 9699 transitions. [2018-10-26 20:02:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-26 20:02:04,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:04,539 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] [2018-10-26 20:02:04,539 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:04,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1789625224, now seen corresponding path program 1 times [2018-10-26 20:02:04,540 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:04,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:04,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:04,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:04,725 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-26 20:02:04,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:04,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:04,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:04,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:04,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:04,727 INFO L87 Difference]: Start difference. First operand 7593 states and 9699 transitions. Second operand 3 states. [2018-10-26 20:02:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:06,263 INFO L93 Difference]: Finished difference Result 22543 states and 28853 transitions. [2018-10-26 20:02:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:06,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-10-26 20:02:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:06,311 INFO L225 Difference]: With dead ends: 22543 [2018-10-26 20:02:06,312 INFO L226 Difference]: Without dead ends: 14952 [2018-10-26 20:02:06,322 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-26 20:02:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14952 states. [2018-10-26 20:02:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14952 to 14943. [2018-10-26 20:02:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-26 20:02:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 18430 transitions. [2018-10-26 20:02:06,543 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 18430 transitions. Word has length 244 [2018-10-26 20:02:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:06,543 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 18430 transitions. [2018-10-26 20:02:06,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 18430 transitions. [2018-10-26 20:02:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-26 20:02:06,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:06,556 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] [2018-10-26 20:02:06,556 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:06,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 644216978, now seen corresponding path program 1 times [2018-10-26 20:02:06,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:06,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:06,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:06,841 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-26 20:02:06,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:06,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:06,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:06,843 INFO L87 Difference]: Start difference. First operand 14943 states and 18430 transitions. Second operand 4 states. [2018-10-26 20:02:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:08,103 INFO L93 Difference]: Finished difference Result 29884 states and 36858 transitions. [2018-10-26 20:02:08,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:08,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-10-26 20:02:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:08,134 INFO L225 Difference]: With dead ends: 29884 [2018-10-26 20:02:08,135 INFO L226 Difference]: Without dead ends: 14943 [2018-10-26 20:02:08,150 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-26 20:02:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14943 states. [2018-10-26 20:02:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14943 to 14943. [2018-10-26 20:02:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-26 20:02:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 17684 transitions. [2018-10-26 20:02:08,339 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 17684 transitions. Word has length 247 [2018-10-26 20:02:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:08,339 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 17684 transitions. [2018-10-26 20:02:08,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 17684 transitions. [2018-10-26 20:02:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-26 20:02:08,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:08,350 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 20:02:08,350 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:08,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:08,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1376182373, now seen corresponding path program 1 times [2018-10-26 20:02:08,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:08,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:08,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:08,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:08,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:02:08,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:08,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:02:08,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:08,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:08,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:08,494 INFO L87 Difference]: Start difference. First operand 14943 states and 17684 transitions. Second operand 3 states. [2018-10-26 20:02:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:09,878 INFO L93 Difference]: Finished difference Result 37363 states and 44044 transitions. [2018-10-26 20:02:09,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:09,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-10-26 20:02:09,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:09,919 INFO L225 Difference]: With dead ends: 37363 [2018-10-26 20:02:09,920 INFO L226 Difference]: Without dead ends: 22422 [2018-10-26 20:02:09,932 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-26 20:02:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22422 states. [2018-10-26 20:02:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22422 to 22417. [2018-10-26 20:02:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22417 states. [2018-10-26 20:02:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22417 states to 22417 states and 26323 transitions. [2018-10-26 20:02:10,198 INFO L78 Accepts]: Start accepts. Automaton has 22417 states and 26323 transitions. Word has length 256 [2018-10-26 20:02:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:10,199 INFO L481 AbstractCegarLoop]: Abstraction has 22417 states and 26323 transitions. [2018-10-26 20:02:10,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 22417 states and 26323 transitions. [2018-10-26 20:02:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-26 20:02:10,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:10,213 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, 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] [2018-10-26 20:02:10,213 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:10,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1061919249, now seen corresponding path program 1 times [2018-10-26 20:02:10,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:10,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:10,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:10,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:10,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:02:10,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:02:10,560 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-26 20:02:10,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:10,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-26 20:02:10,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:02:10,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-26 20:02:10,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:02:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:02:10,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:10,937 INFO L87 Difference]: Start difference. First operand 22417 states and 26323 transitions. Second operand 6 states. [2018-10-26 20:02:11,110 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-26 20:02:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:17,639 INFO L93 Difference]: Finished difference Result 82311 states and 96881 transitions. [2018-10-26 20:02:17,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:02:17,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2018-10-26 20:02:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:17,772 INFO L225 Difference]: With dead ends: 82311 [2018-10-26 20:02:17,772 INFO L226 Difference]: Without dead ends: 59896 [2018-10-26 20:02:17,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:02:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59896 states. [2018-10-26 20:02:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59896 to 58625. [2018-10-26 20:02:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58625 states. [2018-10-26 20:02:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58625 states to 58625 states and 66514 transitions. [2018-10-26 20:02:19,038 INFO L78 Accepts]: Start accepts. Automaton has 58625 states and 66514 transitions. Word has length 264 [2018-10-26 20:02:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:19,039 INFO L481 AbstractCegarLoop]: Abstraction has 58625 states and 66514 transitions. [2018-10-26 20:02:19,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:02:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 58625 states and 66514 transitions. [2018-10-26 20:02:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-26 20:02:19,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:19,063 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:02:19,063 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:19,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:19,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2050018051, now seen corresponding path program 1 times [2018-10-26 20:02:19,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:19,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:19,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:19,604 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 20:02:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:02:19,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:19,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:02:19,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:02:19,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:02:19,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:02:19,779 INFO L87 Difference]: Start difference. First operand 58625 states and 66514 transitions. Second operand 5 states. [2018-10-26 20:02:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:22,806 INFO L93 Difference]: Finished difference Result 180112 states and 202357 transitions. [2018-10-26 20:02:22,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:02:22,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 275 [2018-10-26 20:02:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:22,969 INFO L225 Difference]: With dead ends: 180112 [2018-10-26 20:02:22,969 INFO L226 Difference]: Without dead ends: 121489 [2018-10-26 20:02:23,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:02:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121489 states. [2018-10-26 20:02:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121489 to 118983. [2018-10-26 20:02:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118983 states. [2018-10-26 20:02:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118983 states to 118983 states and 133148 transitions. [2018-10-26 20:02:24,939 INFO L78 Accepts]: Start accepts. Automaton has 118983 states and 133148 transitions. Word has length 275 [2018-10-26 20:02:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:24,940 INFO L481 AbstractCegarLoop]: Abstraction has 118983 states and 133148 transitions. [2018-10-26 20:02:24,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:02:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 118983 states and 133148 transitions. [2018-10-26 20:02:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-26 20:02:24,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:24,959 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:02:24,959 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:24,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash -788828282, now seen corresponding path program 1 times [2018-10-26 20:02:24,960 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:24,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:24,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:24,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:24,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:25,267 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 20:02:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 20:02:25,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:25,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:25,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:25,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:25,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:25,338 INFO L87 Difference]: Start difference. First operand 118983 states and 133148 transitions. Second operand 4 states. [2018-10-26 20:02:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:29,742 INFO L93 Difference]: Finished difference Result 369405 states and 412155 transitions. [2018-10-26 20:02:29,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:29,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2018-10-26 20:02:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:30,048 INFO L225 Difference]: With dead ends: 369405 [2018-10-26 20:02:30,048 INFO L226 Difference]: Without dead ends: 250424 [2018-10-26 20:02:30,116 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-26 20:02:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250424 states. [2018-10-26 20:02:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250424 to 194005. [2018-10-26 20:02:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194005 states. [2018-10-26 20:02:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194005 states to 194005 states and 215162 transitions. [2018-10-26 20:02:33,228 INFO L78 Accepts]: Start accepts. Automaton has 194005 states and 215162 transitions. Word has length 286 [2018-10-26 20:02:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:33,229 INFO L481 AbstractCegarLoop]: Abstraction has 194005 states and 215162 transitions. [2018-10-26 20:02:33,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 194005 states and 215162 transitions. [2018-10-26 20:02:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-26 20:02:33,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:33,247 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, 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] [2018-10-26 20:02:33,248 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:33,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:33,248 INFO L82 PathProgramCache]: Analyzing trace with hash -450250301, now seen corresponding path program 1 times [2018-10-26 20:02:33,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:33,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:33,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:33,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:33,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:33,861 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-26 20:02:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:34,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:02:34,029 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:02:34,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:34,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 20:02:34,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:02:34,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 20:02:34,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:02:34,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:02:34,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:02:34,271 INFO L87 Difference]: Start difference. First operand 194005 states and 215162 transitions. Second operand 8 states. [2018-10-26 20:02:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:47,638 INFO L93 Difference]: Finished difference Result 1123775 states and 1243131 transitions. [2018-10-26 20:02:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 20:02:47,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 288 [2018-10-26 20:02:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:48,902 INFO L225 Difference]: With dead ends: 1123775 [2018-10-26 20:02:48,902 INFO L226 Difference]: Without dead ends: 929772 [2018-10-26 20:02:49,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:02:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929772 states. [2018-10-26 20:03:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929772 to 563939. [2018-10-26 20:03:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563939 states. [2018-10-26 20:03:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563939 states to 563939 states and 619743 transitions. [2018-10-26 20:03:11,082 INFO L78 Accepts]: Start accepts. Automaton has 563939 states and 619743 transitions. Word has length 288 [2018-10-26 20:03:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:11,083 INFO L481 AbstractCegarLoop]: Abstraction has 563939 states and 619743 transitions. [2018-10-26 20:03:11,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:03:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 563939 states and 619743 transitions. [2018-10-26 20:03:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-26 20:03:11,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:11,111 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:03:11,111 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:11,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:11,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1859485173, now seen corresponding path program 1 times [2018-10-26 20:03:11,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:11,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:11,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:11,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:11,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 20:03:11,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:11,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:03:11,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:11,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:11,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:11,342 INFO L87 Difference]: Start difference. First operand 563939 states and 619743 transitions. Second operand 3 states. [2018-10-26 20:03:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:17,534 INFO L93 Difference]: Finished difference Result 1126613 states and 1237974 transitions. [2018-10-26 20:03:17,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:17,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2018-10-26 20:03:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:20,008 INFO L225 Difference]: With dead ends: 1126613 [2018-10-26 20:03:20,009 INFO L226 Difference]: Without dead ends: 562676 [2018-10-26 20:03:20,243 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-26 20:03:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562676 states. [2018-10-26 20:03:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562676 to 562676. [2018-10-26 20:03:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562676 states. [2018-10-26 20:03:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562676 states to 562676 states and 618181 transitions. [2018-10-26 20:03:38,301 INFO L78 Accepts]: Start accepts. Automaton has 562676 states and 618181 transitions. Word has length 307 [2018-10-26 20:03:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:38,301 INFO L481 AbstractCegarLoop]: Abstraction has 562676 states and 618181 transitions. [2018-10-26 20:03:38,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 562676 states and 618181 transitions. [2018-10-26 20:03:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-26 20:03:38,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:38,335 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:38,336 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:38,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash 418511263, now seen corresponding path program 1 times [2018-10-26 20:03:38,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:38,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:38,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:38,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:38,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 20:03:38,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:38,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:38,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:38,669 INFO L87 Difference]: Start difference. First operand 562676 states and 618181 transitions. Second operand 4 states. [2018-10-26 20:03:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:46,118 INFO L93 Difference]: Finished difference Result 1145499 states and 1258669 transitions. [2018-10-26 20:03:46,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:46,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-10-26 20:03:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:47,007 INFO L225 Difference]: With dead ends: 1145499 [2018-10-26 20:03:47,007 INFO L226 Difference]: Without dead ends: 582825 [2018-10-26 20:03:47,275 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-26 20:03:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582825 states. [2018-10-26 20:03:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582825 to 540914. [2018-10-26 20:03:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540914 states. [2018-10-26 20:03:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540914 states to 540914 states and 594379 transitions. [2018-10-26 20:03:57,032 INFO L78 Accepts]: Start accepts. Automaton has 540914 states and 594379 transitions. Word has length 323 [2018-10-26 20:03:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:57,033 INFO L481 AbstractCegarLoop]: Abstraction has 540914 states and 594379 transitions. [2018-10-26 20:03:57,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 540914 states and 594379 transitions. [2018-10-26 20:03:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-26 20:03:57,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:57,066 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:03:57,067 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:57,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1159608046, now seen corresponding path program 1 times [2018-10-26 20:03:57,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:57,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:57,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:57,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:57,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:03:57,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:57,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:57,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:57,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:57,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:57,339 INFO L87 Difference]: Start difference. First operand 540914 states and 594379 transitions. Second operand 3 states. [2018-10-26 20:04:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:08,949 INFO L93 Difference]: Finished difference Result 1241891 states and 1358969 transitions. [2018-10-26 20:04:08,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:08,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2018-10-26 20:04:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:09,894 INFO L225 Difference]: With dead ends: 1241891 [2018-10-26 20:04:09,895 INFO L226 Difference]: Without dead ends: 700979 [2018-10-26 20:04:10,085 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-26 20:04:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700979 states. [2018-10-26 20:04:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700979 to 694364. [2018-10-26 20:04:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694364 states. [2018-10-26 20:04:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694364 states to 694364 states and 743804 transitions. [2018-10-26 20:04:21,861 INFO L78 Accepts]: Start accepts. Automaton has 694364 states and 743804 transitions. Word has length 334 [2018-10-26 20:04:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:21,861 INFO L481 AbstractCegarLoop]: Abstraction has 694364 states and 743804 transitions. [2018-10-26 20:04:21,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 694364 states and 743804 transitions. [2018-10-26 20:04:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-26 20:04:21,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:21,885 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:04:21,885 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:21,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 944680678, now seen corresponding path program 1 times [2018-10-26 20:04:21,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:21,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:21,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:04:22,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:22,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:22,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:22,262 INFO L87 Difference]: Start difference. First operand 694364 states and 743804 transitions. Second operand 4 states. [2018-10-26 20:04:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:30,597 INFO L93 Difference]: Finished difference Result 1366589 states and 1462924 transitions. [2018-10-26 20:04:30,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:30,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2018-10-26 20:04:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:31,880 INFO L225 Difference]: With dead ends: 1366589 [2018-10-26 20:04:31,881 INFO L226 Difference]: Without dead ends: 672227 [2018-10-26 20:04:32,233 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-26 20:04:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672227 states. [2018-10-26 20:04:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672227 to 599051. [2018-10-26 20:04:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599051 states. [2018-10-26 20:04:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599051 states to 599051 states and 638513 transitions. [2018-10-26 20:04:53,376 INFO L78 Accepts]: Start accepts. Automaton has 599051 states and 638513 transitions. Word has length 335 [2018-10-26 20:04:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:53,377 INFO L481 AbstractCegarLoop]: Abstraction has 599051 states and 638513 transitions. [2018-10-26 20:04:53,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 599051 states and 638513 transitions. [2018-10-26 20:04:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-26 20:04:53,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:53,404 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:04:53,404 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:53,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:53,405 INFO L82 PathProgramCache]: Analyzing trace with hash 177672211, now seen corresponding path program 1 times [2018-10-26 20:04:53,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:53,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:53,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:53,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:53,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:04:53,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:53,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:53,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:53,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:53,721 INFO L87 Difference]: Start difference. First operand 599051 states and 638513 transitions. Second operand 3 states. Received shutdown request... [2018-10-26 20:04:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:53,932 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:04:53,938 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:04:53,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:04:53 BoogieIcfgContainer [2018-10-26 20:04:53,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:04:53,939 INFO L168 Benchmark]: Toolchain (without parser) took 195642.53 ms. Allocated memory was 1.5 GB in the beginning and 6.9 GB in the end (delta: 5.3 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,940 INFO L168 Benchmark]: CDTParser took 0.24 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-26 20:04:53,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1212.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 321.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -886.0 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,942 INFO L168 Benchmark]: Boogie Preprocessor took 137.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 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-26 20:04:53,943 INFO L168 Benchmark]: RCFGBuilder took 5445.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 256.6 MB). Peak memory consumption was 256.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,944 INFO L168 Benchmark]: TraceAbstraction took 188521.34 ms. Allocated memory was 2.3 GB in the beginning and 6.9 GB in the end (delta: 4.5 GB). Free memory was 2.0 GB in the beginning and 3.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,949 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.24 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 1212.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 321.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -886.0 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 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 5445.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 256.6 MB). Peak memory consumption was 256.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188521.34 ms. Allocated memory was 2.3 GB in the beginning and 6.9 GB in the end (delta: 4.5 GB). Free memory was 2.0 GB in the beginning and 3.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1608]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1608). Cancelled while BasicCegarLoop was constructing difference of abstraction (599051states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (610 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 188.4s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 90.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3948 SDtfs, 13905 SDslu, 3070 SDs, 0 SdLazy, 19929 SolverSat, 4229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 582 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=694364occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 90.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 547773 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 5338 NumberOfCodeBlocks, 5338 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2962523 SizeOfPredicates, 2 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 2021/2035 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown