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_label36_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:03:28,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:03:28,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:03:28,173 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:03:28,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:03:28,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:03:28,176 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:03:28,178 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:03:28,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:03:28,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:03:28,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:03:28,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:03:28,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:03:28,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:03:28,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:03:28,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:03:28,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:03:28,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:03:28,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:03:28,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:03:28,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:03:28,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:03:28,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:03:28,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:03:28,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:03:28,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:03:28,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:03:28,199 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:03:28,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:03:28,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:03:28,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:03:28,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:03:28,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:03:28,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:03:28,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:03:28,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:03:28,209 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:03:28,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:03:28,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:03:28,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:03:28,242 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:03:28,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:03:28,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:03:28,244 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:03:28,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:03:28,246 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:03:28,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:03:28,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:03:28,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:03:28,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:03:28,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:03:28,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:03:28,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:03:28,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:03:28,248 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:03:28,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:03:28,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:03:28,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:03:28,249 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:03:28,249 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:03:28,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:03:28,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:03:28,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:03:28,250 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:03:28,250 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:03:28,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:03:28,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:03:28,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:03:28,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:03:28,342 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:03:28,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c [2018-10-26 20:03:28,415 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e75af22c7/f78186ce9c114c8cb4e37dfd701c73b0/FLAGb93190b70 [2018-10-26 20:03:29,116 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:03:29,117 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c [2018-10-26 20:03:29,138 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e75af22c7/f78186ce9c114c8cb4e37dfd701c73b0/FLAGb93190b70 [2018-10-26 20:03:29,152 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e75af22c7/f78186ce9c114c8cb4e37dfd701c73b0 [2018-10-26 20:03:29,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:03:29,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:03:29,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:03:29,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:03:29,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:03:29,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:03:29" (1/1) ... [2018-10-26 20:03:29,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bedfbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:29, skipping insertion in model container [2018-10-26 20:03:29,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:03:29" (1/1) ... [2018-10-26 20:03:29,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:03:29,269 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:03:29,974 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:03:29,981 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:03:30,236 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:03:30,265 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:03:30,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30 WrapperNode [2018-10-26 20:03:30,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:03:30,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:03:30,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:03:30,270 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:03:30,281 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:03:30" (1/1) ... [2018-10-26 20:03:30,321 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:03:30" (1/1) ... [2018-10-26 20:03:30,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:03:30,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:03:30,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:03:30,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:03:30,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (1/1) ... [2018-10-26 20:03:30,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (1/1) ... [2018-10-26 20:03:30,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (1/1) ... [2018-10-26 20:03:30,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (1/1) ... [2018-10-26 20:03:30,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (1/1) ... [2018-10-26 20:03:30,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (1/1) ... [2018-10-26 20:03:30,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (1/1) ... [2018-10-26 20:03:30,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:03:30,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:03:30,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:03:30,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:03:30,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (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:03:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:03:30,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:03:30,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:03:35,561 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:03:35,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:03:35 BoogieIcfgContainer [2018-10-26 20:03:35,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:03:35,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:03:35,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:03:35,567 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:03:35,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:03:29" (1/3) ... [2018-10-26 20:03:35,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721fb068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:03:35, skipping insertion in model container [2018-10-26 20:03:35,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:30" (2/3) ... [2018-10-26 20:03:35,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721fb068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:03:35, skipping insertion in model container [2018-10-26 20:03:35,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:03:35" (3/3) ... [2018-10-26 20:03:35,571 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label36_true-unreach-call.c [2018-10-26 20:03:35,582 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:03:35,591 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:03:35,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:03:35,647 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:03:35,648 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:03:35,648 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:03:35,648 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:03:35,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:03:35,649 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:03:35,649 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:03:35,649 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:03:35,649 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:03:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:03:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 20:03:35,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:35,697 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] [2018-10-26 20:03:35,699 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:35,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:35,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1071522756, now seen corresponding path program 1 times [2018-10-26 20:03:35,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:35,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:35,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:35,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:35,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:36,561 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 20:03:36,662 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:03:36,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:36,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:36,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:36,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:36,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:36,690 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:03:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:39,881 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-26 20:03:39,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:39,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-26 20:03:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:39,909 INFO L225 Difference]: With dead ends: 1075 [2018-10-26 20:03:39,910 INFO L226 Difference]: Without dead ends: 765 [2018-10-26 20:03:39,915 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:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-26 20:03:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-26 20:03:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-26 20:03:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-26 20:03:40,001 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 180 [2018-10-26 20:03:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:40,003 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-26 20:03:40,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-26 20:03:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 20:03:40,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:40,012 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] [2018-10-26 20:03:40,012 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:40,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1664876221, now seen corresponding path program 1 times [2018-10-26 20:03:40,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:40,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:40,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:40,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:40,148 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:03:40,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:40,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:03:40,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:40,153 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-26 20:03:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:42,032 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-26 20:03:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:42,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-26 20:03:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:42,040 INFO L225 Difference]: With dead ends: 1465 [2018-10-26 20:03:42,041 INFO L226 Difference]: Without dead ends: 947 [2018-10-26 20:03:42,044 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:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-26 20:03:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-26 20:03:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-26 20:03:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-26 20:03:42,086 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 189 [2018-10-26 20:03:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:42,087 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-26 20:03:42,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-26 20:03:42,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:03:42,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:42,092 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] [2018-10-26 20:03:42,092 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:42,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1680988393, now seen corresponding path program 1 times [2018-10-26 20:03:42,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:42,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:42,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:42,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:42,410 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:03:42,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:42,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:42,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:42,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:42,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:42,416 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-26 20:03:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:46,160 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-10-26 20:03:46,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:46,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-26 20:03:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:46,177 INFO L225 Difference]: With dead ends: 2693 [2018-10-26 20:03:46,177 INFO L226 Difference]: Without dead ends: 1764 [2018-10-26 20:03:46,180 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:03:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-26 20:03:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-10-26 20:03:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-10-26 20:03:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-10-26 20:03:46,218 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 197 [2018-10-26 20:03:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:46,219 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-10-26 20:03:46,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-10-26 20:03:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 20:03:46,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:46,225 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2018-10-26 20:03:46,225 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:46,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:46,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1712813493, now seen corresponding path program 1 times [2018-10-26 20:03:46,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:46,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:46,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:46,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:46,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:03:46,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:46,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:46,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:46,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:46,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:46,362 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-10-26 20:03:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:47,927 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-10-26 20:03:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:47,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-10-26 20:03:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:47,948 INFO L225 Difference]: With dead ends: 5132 [2018-10-26 20:03:47,949 INFO L226 Difference]: Without dead ends: 3386 [2018-10-26 20:03:47,954 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:03:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-26 20:03:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-10-26 20:03:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-26 20:03:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-10-26 20:03:48,043 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 204 [2018-10-26 20:03:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:48,043 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-10-26 20:03:48,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-10-26 20:03:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 20:03:48,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:48,054 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 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] [2018-10-26 20:03:48,054 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:48,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash -634898385, now seen corresponding path program 1 times [2018-10-26 20:03:48,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:48,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:48,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 20:03:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:48,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:48,341 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-10-26 20:03:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:49,739 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-10-26 20:03:49,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:49,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-26 20:03:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:49,771 INFO L225 Difference]: With dead ends: 10035 [2018-10-26 20:03:49,771 INFO L226 Difference]: Without dead ends: 6652 [2018-10-26 20:03:49,778 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:03:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-10-26 20:03:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-10-26 20:03:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-26 20:03:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-10-26 20:03:49,905 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 211 [2018-10-26 20:03:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:49,905 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-10-26 20:03:49,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-10-26 20:03:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 20:03:49,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:49,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,921 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:49,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:49,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1018946693, now seen corresponding path program 1 times [2018-10-26 20:03:49,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:49,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:49,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:49,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:49,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:50,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:50,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:50,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:50,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:50,210 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-10-26 20:03:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,103 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-10-26 20:03:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-10-26 20:03:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,126 INFO L225 Difference]: With dead ends: 13297 [2018-10-26 20:03:52,127 INFO L226 Difference]: Without dead ends: 6650 [2018-10-26 20:03:52,135 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:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-10-26 20:03:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-10-26 20:03:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-26 20:03:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-10-26 20:03:52,238 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 211 [2018-10-26 20:03:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,238 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-10-26 20:03:52,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-10-26 20:03:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 20:03:52,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,251 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,252 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1841420693, now seen corresponding path program 1 times [2018-10-26 20:03:52,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 20:03:52,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:52,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:03:52,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:52,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:52,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:52,426 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-10-26 20:03:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:53,132 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-10-26 20:03:53,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:53,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-26 20:03:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:53,157 INFO L225 Difference]: With dead ends: 13264 [2018-10-26 20:03:53,158 INFO L226 Difference]: Without dead ends: 6617 [2018-10-26 20:03:53,165 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:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-10-26 20:03:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-10-26 20:03:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-10-26 20:03:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-10-26 20:03:53,257 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 218 [2018-10-26 20:03:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:53,258 INFO L481 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-10-26 20:03:53,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-10-26 20:03:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-26 20:03:53,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:53,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,271 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:53,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash -197633740, now seen corresponding path program 1 times [2018-10-26 20:03:53,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:53,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:53,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:03:53,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:53,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:53,527 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-10-26 20:03:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:55,320 INFO L93 Difference]: Finished difference Result 15690 states and 19149 transitions. [2018-10-26 20:03:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:55,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-26 20:03:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:55,338 INFO L225 Difference]: With dead ends: 15690 [2018-10-26 20:03:55,339 INFO L226 Difference]: Without dead ends: 9075 [2018-10-26 20:03:55,346 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:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2018-10-26 20:03:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 9074. [2018-10-26 20:03:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2018-10-26 20:03:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 10935 transitions. [2018-10-26 20:03:55,474 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 10935 transitions. Word has length 222 [2018-10-26 20:03:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:55,474 INFO L481 AbstractCegarLoop]: Abstraction has 9074 states and 10935 transitions. [2018-10-26 20:03:55,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 10935 transitions. [2018-10-26 20:03:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-26 20:03:55,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:55,492 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,493 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:55,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:55,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1273676320, now seen corresponding path program 1 times [2018-10-26 20:03:55,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:55,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:55,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:55,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:03:55,825 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:03:55,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:55,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:03:56,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:03:56,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 20:03:56,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:03:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:03:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:03:56,113 INFO L87 Difference]: Start difference. First operand 9074 states and 10935 transitions. Second operand 7 states. [2018-10-26 20:04:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:00,669 INFO L93 Difference]: Finished difference Result 34490 states and 42017 transitions. [2018-10-26 20:04:00,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:04:00,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2018-10-26 20:04:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:00,721 INFO L225 Difference]: With dead ends: 34490 [2018-10-26 20:04:00,722 INFO L226 Difference]: Without dead ends: 25418 [2018-10-26 20:04:00,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:04:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25418 states. [2018-10-26 20:04:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25418 to 25412. [2018-10-26 20:04:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25412 states. [2018-10-26 20:04:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25412 states to 25412 states and 28705 transitions. [2018-10-26 20:04:01,080 INFO L78 Accepts]: Start accepts. Automaton has 25412 states and 28705 transitions. Word has length 230 [2018-10-26 20:04:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:01,081 INFO L481 AbstractCegarLoop]: Abstraction has 25412 states and 28705 transitions. [2018-10-26 20:04:01,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:04:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25412 states and 28705 transitions. [2018-10-26 20:04:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-26 20:04:01,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:01,121 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,121 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:01,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:01,122 INFO L82 PathProgramCache]: Analyzing trace with hash 582135979, now seen corresponding path program 1 times [2018-10-26 20:04:01,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:01,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:01,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 20:04:01,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:01,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:01,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:01,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:01,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:01,454 INFO L87 Difference]: Start difference. First operand 25412 states and 28705 transitions. Second operand 4 states. [2018-10-26 20:04:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:03,455 INFO L93 Difference]: Finished difference Result 50218 states and 56784 transitions. [2018-10-26 20:04:03,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:03,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2018-10-26 20:04:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:03,506 INFO L225 Difference]: With dead ends: 50218 [2018-10-26 20:04:03,506 INFO L226 Difference]: Without dead ends: 24808 [2018-10-26 20:04:03,535 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:04:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24808 states. [2018-10-26 20:04:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24808 to 24797. [2018-10-26 20:04:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24797 states. [2018-10-26 20:04:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24797 states to 24797 states and 27813 transitions. [2018-10-26 20:04:03,833 INFO L78 Accepts]: Start accepts. Automaton has 24797 states and 27813 transitions. Word has length 321 [2018-10-26 20:04:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:03,833 INFO L481 AbstractCegarLoop]: Abstraction has 24797 states and 27813 transitions. [2018-10-26 20:04:03,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 24797 states and 27813 transitions. [2018-10-26 20:04:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-26 20:04:03,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:03,870 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,871 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:03,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1125602268, now seen corresponding path program 1 times [2018-10-26 20:04:03,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:03,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:03,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:03,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:03,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-26 20:04:04,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:04,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:04,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:04,255 INFO L87 Difference]: Start difference. First operand 24797 states and 27813 transitions. Second operand 4 states. [2018-10-26 20:04:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:06,418 INFO L93 Difference]: Finished difference Result 51849 states and 58266 transitions. [2018-10-26 20:04:06,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:06,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-26 20:04:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:06,459 INFO L225 Difference]: With dead ends: 51849 [2018-10-26 20:04:06,459 INFO L226 Difference]: Without dead ends: 27054 [2018-10-26 20:04:06,480 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:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27054 states. [2018-10-26 20:04:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27054 to 27047. [2018-10-26 20:04:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27047 states. [2018-10-26 20:04:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27047 states to 27047 states and 30335 transitions. [2018-10-26 20:04:06,823 INFO L78 Accepts]: Start accepts. Automaton has 27047 states and 30335 transitions. Word has length 342 [2018-10-26 20:04:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:06,824 INFO L481 AbstractCegarLoop]: Abstraction has 27047 states and 30335 transitions. [2018-10-26 20:04:06,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27047 states and 30335 transitions. [2018-10-26 20:04:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-26 20:04:06,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:06,854 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,854 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:06,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1562798004, now seen corresponding path program 1 times [2018-10-26 20:04:06,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:06,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:06,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:06,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:06,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-26 20:04:07,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:07,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:07,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:07,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:07,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:07,175 INFO L87 Difference]: Start difference. First operand 27047 states and 30335 transitions. Second operand 3 states. [2018-10-26 20:04:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:08,827 INFO L93 Difference]: Finished difference Result 52660 states and 59076 transitions. [2018-10-26 20:04:08,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:08,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 363 [2018-10-26 20:04:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:08,860 INFO L225 Difference]: With dead ends: 52660 [2018-10-26 20:04:08,860 INFO L226 Difference]: Without dead ends: 25615 [2018-10-26 20:04:08,879 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:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25615 states. [2018-10-26 20:04:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25615 to 25612. [2018-10-26 20:04:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25612 states. [2018-10-26 20:04:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25612 states to 25612 states and 28117 transitions. [2018-10-26 20:04:09,204 INFO L78 Accepts]: Start accepts. Automaton has 25612 states and 28117 transitions. Word has length 363 [2018-10-26 20:04:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:09,205 INFO L481 AbstractCegarLoop]: Abstraction has 25612 states and 28117 transitions. [2018-10-26 20:04:09,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 25612 states and 28117 transitions. [2018-10-26 20:04:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-26 20:04:09,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:09,234 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:04:09,234 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:09,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash -921422517, now seen corresponding path program 1 times [2018-10-26 20:04:09,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:09,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:09,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-26 20:04:09,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:09,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:09,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:09,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:09,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:09,837 INFO L87 Difference]: Start difference. First operand 25612 states and 28117 transitions. Second operand 4 states. [2018-10-26 20:04:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:11,220 INFO L93 Difference]: Finished difference Result 99169 states and 109018 transitions. [2018-10-26 20:04:11,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:11,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2018-10-26 20:04:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:11,302 INFO L225 Difference]: With dead ends: 99169 [2018-10-26 20:04:11,302 INFO L226 Difference]: Without dead ends: 73559 [2018-10-26 20:04:11,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73559 states. [2018-10-26 20:04:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73559 to 48356. [2018-10-26 20:04:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48356 states. [2018-10-26 20:04:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48356 states to 48356 states and 53197 transitions. [2018-10-26 20:04:11,959 INFO L78 Accepts]: Start accepts. Automaton has 48356 states and 53197 transitions. Word has length 370 [2018-10-26 20:04:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:11,959 INFO L481 AbstractCegarLoop]: Abstraction has 48356 states and 53197 transitions. [2018-10-26 20:04:11,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 48356 states and 53197 transitions. [2018-10-26 20:04:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-26 20:04:11,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:11,982 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,982 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:11,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1816538621, now seen corresponding path program 1 times [2018-10-26 20:04:11,983 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:11,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:11,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:11,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:11,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:12,531 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 20:04:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-10-26 20:04:12,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:12,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:12,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:04:12,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:04:12,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:04:12,641 INFO L87 Difference]: Start difference. First operand 48356 states and 53197 transitions. Second operand 5 states. [2018-10-26 20:04:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:15,184 INFO L93 Difference]: Finished difference Result 134847 states and 148793 transitions. [2018-10-26 20:04:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:04:15,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2018-10-26 20:04:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:15,271 INFO L225 Difference]: With dead ends: 134847 [2018-10-26 20:04:15,271 INFO L226 Difference]: Without dead ends: 86493 [2018-10-26 20:04:15,309 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:04:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86493 states. [2018-10-26 20:04:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86493 to 84417. [2018-10-26 20:04:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84417 states. [2018-10-26 20:04:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84417 states to 84417 states and 92902 transitions. [2018-10-26 20:04:16,875 INFO L78 Accepts]: Start accepts. Automaton has 84417 states and 92902 transitions. Word has length 373 [2018-10-26 20:04:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:16,875 INFO L481 AbstractCegarLoop]: Abstraction has 84417 states and 92902 transitions. [2018-10-26 20:04:16,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:04:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 84417 states and 92902 transitions. [2018-10-26 20:04:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-26 20:04:16,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:16,908 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:04:16,908 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:16,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1602254634, now seen corresponding path program 1 times [2018-10-26 20:04:16,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:16,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:16,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-26 20:04:17,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:04:17,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:17,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:17,290 INFO L87 Difference]: Start difference. First operand 84417 states and 92902 transitions. Second operand 3 states. [2018-10-26 20:04:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:18,463 INFO L93 Difference]: Finished difference Result 199174 states and 218905 transitions. [2018-10-26 20:04:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:18,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-10-26 20:04:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:18,612 INFO L225 Difference]: With dead ends: 199174 [2018-10-26 20:04:18,612 INFO L226 Difference]: Without dead ends: 114759 [2018-10-26 20:04:18,680 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:04:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114759 states. [2018-10-26 20:04:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114759 to 114759. [2018-10-26 20:04:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114759 states. [2018-10-26 20:04:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114759 states to 114759 states and 125859 transitions. [2018-10-26 20:04:20,745 INFO L78 Accepts]: Start accepts. Automaton has 114759 states and 125859 transitions. Word has length 392 [2018-10-26 20:04:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:20,745 INFO L481 AbstractCegarLoop]: Abstraction has 114759 states and 125859 transitions. [2018-10-26 20:04:20,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 114759 states and 125859 transitions. [2018-10-26 20:04:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2018-10-26 20:04:20,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:20,802 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 20:04:20,803 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:20,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash 593917864, now seen corresponding path program 1 times [2018-10-26 20:04:20,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:20,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:20,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:20,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:20,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-10-26 20:04:21,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:21,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:21,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:21,356 INFO L87 Difference]: Start difference. First operand 114759 states and 125859 transitions. Second operand 3 states. [2018-10-26 20:04:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:22,449 INFO L93 Difference]: Finished difference Result 309033 states and 338482 transitions. [2018-10-26 20:04:22,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:22,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 693 [2018-10-26 20:04:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:22,621 INFO L225 Difference]: With dead ends: 309033 [2018-10-26 20:04:22,621 INFO L226 Difference]: Without dead ends: 194276 [2018-10-26 20:04:22,690 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:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194276 states. [2018-10-26 20:04:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194276 to 194274. [2018-10-26 20:04:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194274 states. [2018-10-26 20:04:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194274 states to 194274 states and 211398 transitions. [2018-10-26 20:04:25,845 INFO L78 Accepts]: Start accepts. Automaton has 194274 states and 211398 transitions. Word has length 693 [2018-10-26 20:04:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:25,846 INFO L481 AbstractCegarLoop]: Abstraction has 194274 states and 211398 transitions. [2018-10-26 20:04:25,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 194274 states and 211398 transitions. [2018-10-26 20:04:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2018-10-26 20:04:25,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:25,989 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 20:04:25,989 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:25,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash 374868588, now seen corresponding path program 1 times [2018-10-26 20:04:25,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:25,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:25,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:25,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:25,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:26,639 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:04:26,856 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:04:27,105 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 20:04:27,311 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 20:04:27,629 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:04:27,929 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-26 20:04:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 732 proven. 29 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2018-10-26 20:04:30,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:04:30,114 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:04:30,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:30,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2018-10-26 20:04:30,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:04:30,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-10-26 20:04:30,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:04:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:04:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:04:30,835 INFO L87 Difference]: Start difference. First operand 194274 states and 211398 transitions. Second operand 11 states. [2018-10-26 20:04:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:53,834 INFO L93 Difference]: Finished difference Result 1596964 states and 1736457 transitions. [2018-10-26 20:04:53,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-26 20:04:53,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 695 [2018-10-26 20:04:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:56,841 INFO L225 Difference]: With dead ends: 1596964 [2018-10-26 20:04:56,841 INFO L226 Difference]: Without dead ends: 1402680 [2018-10-26 20:04:57,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 694 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:04:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402680 states. [2018-10-26 20:05:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402680 to 1317555. [2018-10-26 20:05:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317555 states. [2018-10-26 20:05:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317555 states to 1317555 states and 1434262 transitions. [2018-10-26 20:05:35,764 INFO L78 Accepts]: Start accepts. Automaton has 1317555 states and 1434262 transitions. Word has length 695 [2018-10-26 20:05:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:35,765 INFO L481 AbstractCegarLoop]: Abstraction has 1317555 states and 1434262 transitions. [2018-10-26 20:05:35,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 20:05:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1317555 states and 1434262 transitions. [2018-10-26 20:05:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-10-26 20:05:36,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:36,694 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:36,695 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:36,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash 460198062, now seen corresponding path program 1 times [2018-10-26 20:05:36,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:36,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:36,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:36,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:36,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 966 proven. 40 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-10-26 20:05:40,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:40,203 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:05:40,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:40,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 1143 proven. 0 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2018-10-26 20:05:41,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:05:41,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-26 20:05:41,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 20:05:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 20:05:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:05:41,476 INFO L87 Difference]: Start difference. First operand 1317555 states and 1434262 transitions. Second operand 14 states. [2018-10-26 20:05:41,825 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 Received shutdown request... [2018-10-26 20:06:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-26 20:06:46,080 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:06:46,086 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:06:46,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:06:46 BoogieIcfgContainer [2018-10-26 20:06:46,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:06:46,087 INFO L168 Benchmark]: Toolchain (without parser) took 196925.13 ms. Allocated memory was 1.5 GB in the beginning and 7.3 GB in the end (delta: 5.8 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. [2018-10-26 20:06:46,089 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:06:46,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1103.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:06:46,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 321.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -887.0 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-26 20:06:46,091 INFO L168 Benchmark]: Boogie Preprocessor took 136.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:06:46,092 INFO L168 Benchmark]: RCFGBuilder took 4836.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 275.2 MB). Peak memory consumption was 275.2 MB. Max. memory is 7.1 GB. [2018-10-26 20:06:46,092 INFO L168 Benchmark]: TraceAbstraction took 190522.87 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 5.0 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. [2018-10-26 20:06:46,097 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1103.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 321.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -887.0 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4836.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 275.2 MB). Peak memory consumption was 275.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190522.87 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 5.0 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1572]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1572). Cancelled while BasicCegarLoop was constructing difference of abstraction (1317555states) and FLOYD_HOARE automaton (currently 61 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (5142913 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 190.4s OverallTime, 18 OverallIterations, 12 TraceHistogramMax, 124.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5470 SDtfs, 20776 SDslu, 5139 SDs, 0 SdLazy, 28259 SolverSat, 5840 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1911 GetRequests, 1791 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1317555occurred in iteration=17, 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: 47.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 112716 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 7934 NumberOfCodeBlocks, 7934 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 7913 ConstructedInterpolants, 0 QuantifiedInterpolants, 12451117 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2897 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 10537/10610 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown