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/Problem13_label33_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:23:15,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:23:15,194 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:23:15,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:23:15,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:23:15,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:23:15,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:23:15,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:23:15,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:23:15,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:23:15,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:23:15,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:23:15,215 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:23:15,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:23:15,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:23:15,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:23:15,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:23:15,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:23:15,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:23:15,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:23:15,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:23:15,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:23:15,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:23:15,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:23:15,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:23:15,230 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:23:15,231 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:23:15,232 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:23:15,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:23:15,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:23:15,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:23:15,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:23:15,235 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:23:15,236 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:23:15,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:23:15,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:23:15,238 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:23:15,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:23:15,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:23:15,261 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:23:15,262 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:23:15,265 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:23:15,265 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:23:15,266 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:23:15,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:23:15,266 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:23:15,266 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:23:15,266 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:23:15,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:23:15,267 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:23:15,267 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:23:15,267 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:23:15,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:23:15,268 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:23:15,268 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:23:15,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:23:15,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:23:15,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:23:15,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:23:15,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:23:15,269 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:23:15,269 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:23:15,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:23:15,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:23:15,270 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:23:15,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:23:15,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:23:15,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:23:15,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:23:15,344 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:23:15,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label33_true-unreach-call.c [2018-10-24 16:23:15,401 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b22c11c6c/9c403f8578ed4205ad27837e93741d80/FLAG4dc3948b6 [2018-10-24 16:23:16,210 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:23:16,212 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label33_true-unreach-call.c [2018-10-24 16:23:16,253 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b22c11c6c/9c403f8578ed4205ad27837e93741d80/FLAG4dc3948b6 [2018-10-24 16:23:16,274 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b22c11c6c/9c403f8578ed4205ad27837e93741d80 [2018-10-24 16:23:16,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:23:16,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:23:16,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:23:16,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:23:16,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:23:16,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:16" (1/1) ... [2018-10-24 16:23:16,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1086b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:16, skipping insertion in model container [2018-10-24 16:23:16,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:16" (1/1) ... [2018-10-24 16:23:16,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:23:16,495 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:23:18,056 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:23:18,062 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:23:18,791 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:23:18,829 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:23:18,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18 WrapperNode [2018-10-24 16:23:18,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:23:18,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:23:18,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:23:18,832 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:23:18,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:18,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:19,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:23:19,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:23:19,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:23:19,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:23:19,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:19,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:19,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:19,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:20,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:20,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:20,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... [2018-10-24 16:23:20,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:23:20,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:23:20,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:23:20,365 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:23:20,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:23:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:23:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:23:20,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:23:36,050 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:23:36,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:23:36 BoogieIcfgContainer [2018-10-24 16:23:36,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:23:36,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:23:36,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:23:36,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:23:36,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:23:16" (1/3) ... [2018-10-24 16:23:36,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e6156b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:23:36, skipping insertion in model container [2018-10-24 16:23:36,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:18" (2/3) ... [2018-10-24 16:23:36,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e6156b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:23:36, skipping insertion in model container [2018-10-24 16:23:36,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:23:36" (3/3) ... [2018-10-24 16:23:36,062 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label33_true-unreach-call.c [2018-10-24 16:23:36,072 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:23:36,081 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:23:36,099 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:23:36,144 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:23:36,145 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:23:36,145 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:23:36,145 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:23:36,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:23:36,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:23:36,145 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:23:36,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:23:36,146 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:23:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-24 16:23:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 16:23:36,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:23:36,194 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] [2018-10-24 16:23:36,197 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:23:36,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:23:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1502078046, now seen corresponding path program 1 times [2018-10-24 16:23:36,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:23:36,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:23:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:23:36,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:23:36,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:23:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:23:36,696 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 16:23:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:23:36,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:23:36,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:23:36,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:23:36,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:23:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:23:36,812 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-24 16:23:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:23:53,548 INFO L93 Difference]: Finished difference Result 3870 states and 7276 transitions. [2018-10-24 16:23:53,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:23:53,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-24 16:23:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:23:53,601 INFO L225 Difference]: With dead ends: 3870 [2018-10-24 16:23:53,601 INFO L226 Difference]: Without dead ends: 2764 [2018-10-24 16:23:53,610 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-24 16:23:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2018-10-24 16:23:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2736. [2018-10-24 16:23:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2736 states. [2018-10-24 16:23:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 4487 transitions. [2018-10-24 16:23:53,794 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 4487 transitions. Word has length 36 [2018-10-24 16:23:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:23:53,795 INFO L481 AbstractCegarLoop]: Abstraction has 2736 states and 4487 transitions. [2018-10-24 16:23:53,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:23:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 4487 transitions. [2018-10-24 16:23:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-24 16:23:53,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:23:53,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:23:53,803 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:23:53,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:23:53,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1804251206, now seen corresponding path program 1 times [2018-10-24 16:23:53,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:23:53,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:23:53,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:23:53,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:23:53,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:23:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:23:54,488 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-24 16:23:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:23:54,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:23:54,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:23:54,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:23:54,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:23:54,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:23:54,814 INFO L87 Difference]: Start difference. First operand 2736 states and 4487 transitions. Second operand 5 states. [2018-10-24 16:23:55,055 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-24 16:24:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:12,695 INFO L93 Difference]: Finished difference Result 9428 states and 14930 transitions. [2018-10-24 16:24:12,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:24:12,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-24 16:24:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:12,729 INFO L225 Difference]: With dead ends: 9428 [2018-10-24 16:24:12,729 INFO L226 Difference]: Without dead ends: 6694 [2018-10-24 16:24:12,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:24:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2018-10-24 16:24:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6693. [2018-10-24 16:24:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6693 states. [2018-10-24 16:24:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 9417 transitions. [2018-10-24 16:24:12,868 INFO L78 Accepts]: Start accepts. Automaton has 6693 states and 9417 transitions. Word has length 142 [2018-10-24 16:24:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:12,869 INFO L481 AbstractCegarLoop]: Abstraction has 6693 states and 9417 transitions. [2018-10-24 16:24:12,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:24:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6693 states and 9417 transitions. [2018-10-24 16:24:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-24 16:24:12,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:12,884 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:24:12,884 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:12,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1951560992, now seen corresponding path program 1 times [2018-10-24 16:24:12,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:12,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:12,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:24:13,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:24:13,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:24:13,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:24:13,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:24:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:24:13,357 INFO L87 Difference]: Start difference. First operand 6693 states and 9417 transitions. Second operand 4 states. [2018-10-24 16:24:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:25,836 INFO L93 Difference]: Finished difference Result 15792 states and 23310 transitions. [2018-10-24 16:24:25,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:24:25,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2018-10-24 16:24:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:25,880 INFO L225 Difference]: With dead ends: 15792 [2018-10-24 16:24:25,881 INFO L226 Difference]: Without dead ends: 9889 [2018-10-24 16:24:25,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 16:24:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9889 states. [2018-10-24 16:24:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9889 to 9863. [2018-10-24 16:24:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9863 states. [2018-10-24 16:24:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 13541 transitions. [2018-10-24 16:24:26,052 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 13541 transitions. Word has length 212 [2018-10-24 16:24:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:26,053 INFO L481 AbstractCegarLoop]: Abstraction has 9863 states and 13541 transitions. [2018-10-24 16:24:26,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:24:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 13541 transitions. [2018-10-24 16:24:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-24 16:24:26,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:26,061 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:24:26,061 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:26,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:26,062 INFO L82 PathProgramCache]: Analyzing trace with hash -818940230, now seen corresponding path program 1 times [2018-10-24 16:24:26,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:26,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:26,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:24:26,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:24:26,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:24:26,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:24:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:24:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:24:26,505 INFO L87 Difference]: Start difference. First operand 9863 states and 13541 transitions. Second operand 5 states. [2018-10-24 16:24:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:45,476 INFO L93 Difference]: Finished difference Result 43673 states and 61710 transitions. [2018-10-24 16:24:45,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:24:45,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2018-10-24 16:24:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:45,574 INFO L225 Difference]: With dead ends: 43673 [2018-10-24 16:24:45,574 INFO L226 Difference]: Without dead ends: 34600 [2018-10-24 16:24:45,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:24:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34600 states. [2018-10-24 16:24:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34600 to 34418. [2018-10-24 16:24:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34418 states. [2018-10-24 16:24:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34418 states to 34418 states and 45210 transitions. [2018-10-24 16:24:46,054 INFO L78 Accepts]: Start accepts. Automaton has 34418 states and 45210 transitions. Word has length 219 [2018-10-24 16:24:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:46,055 INFO L481 AbstractCegarLoop]: Abstraction has 34418 states and 45210 transitions. [2018-10-24 16:24:46,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:24:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34418 states and 45210 transitions. [2018-10-24 16:24:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-24 16:24:46,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:46,062 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:24:46,063 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:46,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:46,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1029542179, now seen corresponding path program 1 times [2018-10-24 16:24:46,063 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:46,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:46,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:46,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 16:24:46,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:24:46,439 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:24:46,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:46,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:24:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:24:46,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:24:46,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-24 16:24:46,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:24:46,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:24:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:24:46,714 INFO L87 Difference]: Start difference. First operand 34418 states and 45210 transitions. Second operand 4 states. [2018-10-24 16:24:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:58,140 INFO L93 Difference]: Finished difference Result 129564 states and 171627 transitions. [2018-10-24 16:24:58,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:24:58,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-24 16:24:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:58,297 INFO L225 Difference]: With dead ends: 129564 [2018-10-24 16:24:58,297 INFO L226 Difference]: Without dead ends: 95936 [2018-10-24 16:24:58,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:24:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95936 states. [2018-10-24 16:24:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95936 to 65145. [2018-10-24 16:24:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65145 states. [2018-10-24 16:24:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65145 states to 65145 states and 80870 transitions. [2018-10-24 16:24:59,509 INFO L78 Accepts]: Start accepts. Automaton has 65145 states and 80870 transitions. Word has length 242 [2018-10-24 16:24:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:59,509 INFO L481 AbstractCegarLoop]: Abstraction has 65145 states and 80870 transitions. [2018-10-24 16:24:59,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:24:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 65145 states and 80870 transitions. [2018-10-24 16:24:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-24 16:24:59,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:59,515 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:24:59,516 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:59,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash -245088399, now seen corresponding path program 1 times [2018-10-24 16:24:59,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:59,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:59,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:59,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:59,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 16:24:59,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:24:59,923 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:25:00,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:00,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:25:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:25:00,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:25:00,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-24 16:25:00,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:25:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:25:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:00,552 INFO L87 Difference]: Start difference. First operand 65145 states and 80870 transitions. Second operand 4 states. [2018-10-24 16:25:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:12,109 INFO L93 Difference]: Finished difference Result 217025 states and 268981 transitions. [2018-10-24 16:25:12,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:25:12,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-10-24 16:25:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:12,324 INFO L225 Difference]: With dead ends: 217025 [2018-10-24 16:25:12,324 INFO L226 Difference]: Without dead ends: 152670 [2018-10-24 16:25:12,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152670 states. [2018-10-24 16:25:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152670 to 116363. [2018-10-24 16:25:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116363 states. [2018-10-24 16:25:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116363 states to 116363 states and 139926 transitions. [2018-10-24 16:25:14,523 INFO L78 Accepts]: Start accepts. Automaton has 116363 states and 139926 transitions. Word has length 248 [2018-10-24 16:25:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:14,523 INFO L481 AbstractCegarLoop]: Abstraction has 116363 states and 139926 transitions. [2018-10-24 16:25:14,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:25:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 116363 states and 139926 transitions. [2018-10-24 16:25:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-24 16:25:14,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:14,534 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:25:14,534 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:14,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash 48914312, now seen corresponding path program 1 times [2018-10-24 16:25:14,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:14,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:14,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:14,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:25:14,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:14,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:25:14,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:25:14,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:25:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:25:14,768 INFO L87 Difference]: Start difference. First operand 116363 states and 139926 transitions. Second operand 3 states. [2018-10-24 16:25:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:23,126 INFO L93 Difference]: Finished difference Result 232705 states and 279679 transitions. [2018-10-24 16:25:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:25:23,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-10-24 16:25:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:23,255 INFO L225 Difference]: With dead ends: 232705 [2018-10-24 16:25:23,255 INFO L226 Difference]: Without dead ends: 117132 [2018-10-24 16:25:23,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:25:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117132 states. [2018-10-24 16:25:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117132 to 114762. [2018-10-24 16:25:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114762 states. [2018-10-24 16:25:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114762 states to 114762 states and 130187 transitions. [2018-10-24 16:25:25,419 INFO L78 Accepts]: Start accepts. Automaton has 114762 states and 130187 transitions. Word has length 277 [2018-10-24 16:25:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:25,419 INFO L481 AbstractCegarLoop]: Abstraction has 114762 states and 130187 transitions. [2018-10-24 16:25:25,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:25:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 114762 states and 130187 transitions. [2018-10-24 16:25:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-24 16:25:25,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:25,445 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:25:25,446 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:25,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:25,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2081388679, now seen corresponding path program 1 times [2018-10-24 16:25:25,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:25,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-10-24 16:25:25,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:25,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:25:25,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:25:25,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:25:25,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:25:25,835 INFO L87 Difference]: Start difference. First operand 114762 states and 130187 transitions. Second operand 3 states. [2018-10-24 16:25:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:34,191 INFO L93 Difference]: Finished difference Result 305954 states and 347425 transitions. [2018-10-24 16:25:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:25:34,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-10-24 16:25:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:34,425 INFO L225 Difference]: With dead ends: 305954 [2018-10-24 16:25:34,425 INFO L226 Difference]: Without dead ends: 191982 [2018-10-24 16:25:34,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:25:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191982 states. [2018-10-24 16:25:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191982 to 191981. [2018-10-24 16:25:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191981 states. [2018-10-24 16:25:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191981 states to 191981 states and 213227 transitions. [2018-10-24 16:25:37,407 INFO L78 Accepts]: Start accepts. Automaton has 191981 states and 213227 transitions. Word has length 392 [2018-10-24 16:25:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:37,408 INFO L481 AbstractCegarLoop]: Abstraction has 191981 states and 213227 transitions. [2018-10-24 16:25:37,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:25:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 191981 states and 213227 transitions. [2018-10-24 16:25:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-10-24 16:25:37,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:37,432 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2018-10-24 16:25:37,432 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:37,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash -259977617, now seen corresponding path program 1 times [2018-10-24 16:25:37,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:37,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-10-24 16:25:37,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:37,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:25:37,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:25:37,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:25:37,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:37,824 INFO L87 Difference]: Start difference. First operand 191981 states and 213227 transitions. Second operand 4 states. [2018-10-24 16:25:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:50,955 INFO L93 Difference]: Finished difference Result 393407 states and 436904 transitions. [2018-10-24 16:25:50,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:25:50,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 462 [2018-10-24 16:25:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:51,196 INFO L225 Difference]: With dead ends: 393407 [2018-10-24 16:25:51,196 INFO L226 Difference]: Without dead ends: 195890 [2018-10-24 16:25:51,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195890 states. [2018-10-24 16:25:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195890 to 180120. [2018-10-24 16:25:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180120 states. [2018-10-24 16:25:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180120 states to 180120 states and 193018 transitions. [2018-10-24 16:25:54,014 INFO L78 Accepts]: Start accepts. Automaton has 180120 states and 193018 transitions. Word has length 462 [2018-10-24 16:25:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:54,015 INFO L481 AbstractCegarLoop]: Abstraction has 180120 states and 193018 transitions. [2018-10-24 16:25:54,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:25:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 180120 states and 193018 transitions. [2018-10-24 16:25:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-24 16:25:54,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:54,032 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:25:54,033 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:54,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2050105747, now seen corresponding path program 1 times [2018-10-24 16:25:54,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:54,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:54,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-24 16:25:54,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:54,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:25:54,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:25:54,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:25:54,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:54,453 INFO L87 Difference]: Start difference. First operand 180120 states and 193018 transitions. Second operand 4 states. [2018-10-24 16:26:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:26:10,908 INFO L93 Difference]: Finished difference Result 360256 states and 386062 transitions. [2018-10-24 16:26:10,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:26:10,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 520 [2018-10-24 16:26:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:26:11,096 INFO L225 Difference]: With dead ends: 360256 [2018-10-24 16:26:11,097 INFO L226 Difference]: Without dead ends: 175395 [2018-10-24 16:26:11,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175395 states. [2018-10-24 16:26:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175395 to 166700. [2018-10-24 16:26:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166700 states. [2018-10-24 16:26:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166700 states to 166700 states and 175484 transitions. [2018-10-24 16:26:13,033 INFO L78 Accepts]: Start accepts. Automaton has 166700 states and 175484 transitions. Word has length 520 [2018-10-24 16:26:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:26:13,034 INFO L481 AbstractCegarLoop]: Abstraction has 166700 states and 175484 transitions. [2018-10-24 16:26:13,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:26:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 166700 states and 175484 transitions. [2018-10-24 16:26:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-24 16:26:13,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:26:13,053 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:26:13,054 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:26:13,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:26:13,054 INFO L82 PathProgramCache]: Analyzing trace with hash -768125364, now seen corresponding path program 1 times [2018-10-24 16:26:13,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:26:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:26:13,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:13,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:26:13,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:26:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-10-24 16:26:13,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:26:13,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:26:13,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:26:13,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:26:13,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:13,482 INFO L87 Difference]: Start difference. First operand 166700 states and 175484 transitions. Second operand 4 states. [2018-10-24 16:26:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:26:27,043 INFO L93 Difference]: Finished difference Result 332645 states and 350224 transitions. [2018-10-24 16:26:27,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:26:27,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 530 [2018-10-24 16:26:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:26:27,249 INFO L225 Difference]: With dead ends: 332645 [2018-10-24 16:26:27,249 INFO L226 Difference]: Without dead ends: 161986 [2018-10-24 16:26:27,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161986 states. [2018-10-24 16:26:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161986 to 160369. [2018-10-24 16:26:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160369 states. [2018-10-24 16:26:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160369 states to 160369 states and 166654 transitions. [2018-10-24 16:26:29,289 INFO L78 Accepts]: Start accepts. Automaton has 160369 states and 166654 transitions. Word has length 530 [2018-10-24 16:26:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:26:29,290 INFO L481 AbstractCegarLoop]: Abstraction has 160369 states and 166654 transitions. [2018-10-24 16:26:29,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:26:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 160369 states and 166654 transitions. [2018-10-24 16:26:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2018-10-24 16:26:29,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:26:29,358 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:26:29,358 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:26:29,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:26:29,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1621587229, now seen corresponding path program 1 times [2018-10-24 16:26:29,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:26:29,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:26:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:29,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:26:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:26:29,822 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 16:26:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-24 16:26:30,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:26:30,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:26:30,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:26:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:26:30,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:30,687 INFO L87 Difference]: Start difference. First operand 160369 states and 166654 transitions. Second operand 4 states. [2018-10-24 16:26:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:26:41,309 INFO L93 Difference]: Finished difference Result 328617 states and 341404 transitions. [2018-10-24 16:26:41,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:26:41,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1012 [2018-10-24 16:26:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:26:41,457 INFO L225 Difference]: With dead ends: 328617 [2018-10-24 16:26:41,457 INFO L226 Difference]: Without dead ends: 156397 [2018-10-24 16:26:41,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156397 states. [2018-10-24 16:26:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156397 to 148516. [2018-10-24 16:26:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148516 states. [2018-10-24 16:26:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148516 states to 148516 states and 153920 transitions. [2018-10-24 16:26:43,045 INFO L78 Accepts]: Start accepts. Automaton has 148516 states and 153920 transitions. Word has length 1012 [2018-10-24 16:26:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:26:43,046 INFO L481 AbstractCegarLoop]: Abstraction has 148516 states and 153920 transitions. [2018-10-24 16:26:43,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:26:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 148516 states and 153920 transitions. [2018-10-24 16:26:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-10-24 16:26:43,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:26:43,125 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:26:43,125 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:26:43,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:26:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1108830039, now seen corresponding path program 1 times [2018-10-24 16:26:43,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:26:43,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:26:43,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:43,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:26:43,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:26:44,491 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 16:26:44,959 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-10-24 16:26:45,244 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-10-24 16:26:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 335 proven. 291 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-24 16:26:49,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:26:49,374 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:26:49,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:26:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:26:49,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:26:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-24 16:26:51,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:26:51,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 16:26:51,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 16:26:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 16:26:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:26:51,287 INFO L87 Difference]: Start difference. First operand 148516 states and 153920 transitions. Second operand 11 states. Received shutdown request... [2018-10-24 16:27:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 16:27:03,991 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:27:03,996 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:27:03,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:27:03 BoogieIcfgContainer [2018-10-24 16:27:03,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:27:03,997 INFO L168 Benchmark]: Toolchain (without parser) took 227710.34 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -848.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 16:27:03,998 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:27:03,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2541.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:04,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 879.13 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 821.6 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:04,001 INFO L168 Benchmark]: Boogie Preprocessor took 652.93 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 80.2 MB). Peak memory consumption was 80.2 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:04,001 INFO L168 Benchmark]: RCFGBuilder took 15686.52 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 235.9 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 584.6 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:04,002 INFO L168 Benchmark]: TraceAbstraction took 207944.81 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -187.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-24 16:27:04,007 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2541.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 879.13 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 821.6 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 652.93 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 80.2 MB). Peak memory consumption was 80.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 15686.52 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 235.9 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 584.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207944.81 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -187.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 117). Cancelled while BasicCegarLoop was constructing difference of abstraction (148516states) and FLOYD_HOARE automaton (currently 10 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (84115 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 207.8s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 174.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11466 SDtfs, 30423 SDslu, 3701 SDs, 0 SdLazy, 65159 SolverSat, 14659 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 138.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1595 GetRequests, 1544 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191981occurred in iteration=8, 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: 17.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 103669 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 6852 NumberOfCodeBlocks, 6852 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6836 ConstructedInterpolants, 0 QuantifiedInterpolants, 28170180 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1881 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 5689/5988 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown