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/Problem15_label00_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:21:18,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:21:18,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:21:18,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:21:18,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:21:18,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:21:18,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:21:18,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:21:18,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:21:18,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:21:18,093 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:21:18,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:21:18,094 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:21:18,095 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:21:18,096 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:21:18,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:21:18,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:21:18,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:21:18,102 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:21:18,104 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:21:18,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:21:18,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:21:18,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:21:18,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:21:18,110 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:21:18,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:21:18,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:21:18,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:21:18,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:21:18,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:21:18,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:21:18,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:21:18,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:21:18,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:21:18,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:21:18,118 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:21:18,119 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 19:21:18,134 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:21:18,134 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:21:18,135 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:21:18,135 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:21:18,136 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:21:18,136 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:21:18,136 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:21:18,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:21:18,137 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:21:18,137 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:21:18,137 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:21:18,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:21:18,138 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:21:18,138 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:21:18,138 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:21:18,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:21:18,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:21:18,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:21:18,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:21:18,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:21:18,140 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:21:18,140 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:21:18,140 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:21:18,140 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:21:18,140 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:21:18,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:21:18,141 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:21:18,141 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:21:18,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:21:18,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:21:18,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:21:18,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:21:18,207 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:21:18,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label00_false-unreach-call.c [2018-10-26 19:21:18,280 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c44a9e511/ea9b5c60fb1e4bf0b2c96b3dbf81fec3/FLAGcc4911c6e [2018-10-26 19:21:18,992 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:21:18,993 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label00_false-unreach-call.c [2018-10-26 19:21:19,016 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c44a9e511/ea9b5c60fb1e4bf0b2c96b3dbf81fec3/FLAGcc4911c6e [2018-10-26 19:21:19,036 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c44a9e511/ea9b5c60fb1e4bf0b2c96b3dbf81fec3 [2018-10-26 19:21:19,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:21:19,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:21:19,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:21:19,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:21:19,059 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:21:19,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:21:19" (1/1) ... [2018-10-26 19:21:19,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a5722cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:19, skipping insertion in model container [2018-10-26 19:21:19,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:21:19" (1/1) ... [2018-10-26 19:21:19,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:21:19,177 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:21:19,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:21:19,938 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:21:20,222 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:21:20,247 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:21:20,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20 WrapperNode [2018-10-26 19:21:20,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:21:20,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:21:20,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:21:20,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:21:20,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:21:20,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:21:20,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:21:20,688 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:21:20,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (1/1) ... [2018-10-26 19:21:20,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:21:20,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:21:20,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:21:20,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:21:20,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (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 19:21:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:21:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:21:20,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:21:27,572 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:21:27,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:21:27 BoogieIcfgContainer [2018-10-26 19:21:27,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:21:27,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:21:27,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:21:27,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:21:27,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:21:19" (1/3) ... [2018-10-26 19:21:27,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c07987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:21:27, skipping insertion in model container [2018-10-26 19:21:27,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:21:20" (2/3) ... [2018-10-26 19:21:27,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c07987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:21:27, skipping insertion in model container [2018-10-26 19:21:27,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:21:27" (3/3) ... [2018-10-26 19:21:27,582 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label00_false-unreach-call.c [2018-10-26 19:21:27,594 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:21:27,606 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:21:27,624 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:21:27,663 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:21:27,664 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:21:27,664 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:21:27,664 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:21:27,664 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:21:27,664 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:21:27,665 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:21:27,665 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:21:27,665 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:21:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-26 19:21:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 19:21:27,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:21:27,705 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:21:27,708 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:21:27,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:21:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984234, now seen corresponding path program 1 times [2018-10-26 19:21:27,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:21:27,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:21:27,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:27,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:21:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:21:27,877 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 19:21:27,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:21:27,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:21:27,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:21:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:21:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:21:27,906 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 3 states. [2018-10-26 19:21:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:21:33,313 INFO L93 Difference]: Finished difference Result 1157 states and 2109 transitions. [2018-10-26 19:21:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:21:33,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-26 19:21:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:21:33,365 INFO L225 Difference]: With dead ends: 1157 [2018-10-26 19:21:33,365 INFO L226 Difference]: Without dead ends: 728 [2018-10-26 19:21:33,379 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 19:21:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-26 19:21:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-10-26 19:21:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-10-26 19:21:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1105 transitions. [2018-10-26 19:21:33,507 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1105 transitions. Word has length 7 [2018-10-26 19:21:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:21:33,507 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 1105 transitions. [2018-10-26 19:21:33,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:21:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1105 transitions. [2018-10-26 19:21:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 19:21:33,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:21:33,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:21:33,513 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:21:33,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:21:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 696208782, now seen corresponding path program 1 times [2018-10-26 19:21:33,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:21:33,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:21:33,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:33,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:21:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:21:34,082 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-26 19:21:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:21:34,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:21:34,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:21:34,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:21:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:21:34,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:21:34,261 INFO L87 Difference]: Start difference. First operand 726 states and 1105 transitions. Second operand 5 states. [2018-10-26 19:21:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:21:43,014 INFO L93 Difference]: Finished difference Result 2375 states and 3553 transitions. [2018-10-26 19:21:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:21:43,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-10-26 19:21:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:21:43,028 INFO L225 Difference]: With dead ends: 2375 [2018-10-26 19:21:43,028 INFO L226 Difference]: Without dead ends: 1651 [2018-10-26 19:21:43,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:21:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2018-10-26 19:21:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1343. [2018-10-26 19:21:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2018-10-26 19:21:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1888 transitions. [2018-10-26 19:21:43,099 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1888 transitions. Word has length 73 [2018-10-26 19:21:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:21:43,100 INFO L481 AbstractCegarLoop]: Abstraction has 1343 states and 1888 transitions. [2018-10-26 19:21:43,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:21:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1888 transitions. [2018-10-26 19:21:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 19:21:43,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:21:43,104 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:21:43,104 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:21:43,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:21:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1704706976, now seen corresponding path program 1 times [2018-10-26 19:21:43,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:21:43,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:21:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:43,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:21:43,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:21:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:21:43,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:21:43,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:21:43,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:21:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:21:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:21:43,345 INFO L87 Difference]: Start difference. First operand 1343 states and 1888 transitions. Second operand 4 states. [2018-10-26 19:21:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:21:48,888 INFO L93 Difference]: Finished difference Result 4799 states and 6894 transitions. [2018-10-26 19:21:48,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:21:48,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-10-26 19:21:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:21:48,908 INFO L225 Difference]: With dead ends: 4799 [2018-10-26 19:21:48,908 INFO L226 Difference]: Without dead ends: 3458 [2018-10-26 19:21:48,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 19:21:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2018-10-26 19:21:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3452. [2018-10-26 19:21:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2018-10-26 19:21:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4525 transitions. [2018-10-26 19:21:48,984 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4525 transitions. Word has length 78 [2018-10-26 19:21:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:21:48,985 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4525 transitions. [2018-10-26 19:21:48,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:21:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4525 transitions. [2018-10-26 19:21:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-26 19:21:48,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:21:48,987 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:21:48,988 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:21:48,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:21:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 66918333, now seen corresponding path program 1 times [2018-10-26 19:21:48,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:21:48,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:21:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:48,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:21:48,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:21:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:21:49,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:21:49,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:21:49,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:21:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:21:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:21:49,160 INFO L87 Difference]: Start difference. First operand 3452 states and 4525 transitions. Second operand 4 states. [2018-10-26 19:21:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:21:56,493 INFO L93 Difference]: Finished difference Result 10886 states and 14684 transitions. [2018-10-26 19:21:56,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:21:56,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-10-26 19:21:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:21:56,531 INFO L225 Difference]: With dead ends: 10886 [2018-10-26 19:21:56,531 INFO L226 Difference]: Without dead ends: 7436 [2018-10-26 19:21:56,537 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-26 19:21:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7436 states. [2018-10-26 19:21:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7436 to 7401. [2018-10-26 19:21:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7401 states. [2018-10-26 19:21:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7401 states to 7401 states and 9503 transitions. [2018-10-26 19:21:56,676 INFO L78 Accepts]: Start accepts. Automaton has 7401 states and 9503 transitions. Word has length 99 [2018-10-26 19:21:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:21:56,677 INFO L481 AbstractCegarLoop]: Abstraction has 7401 states and 9503 transitions. [2018-10-26 19:21:56,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:21:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7401 states and 9503 transitions. [2018-10-26 19:21:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 19:21:56,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:21:56,683 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:21:56,683 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:21:56,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:21:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash -753781725, now seen corresponding path program 1 times [2018-10-26 19:21:56,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:21:56,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:21:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:56,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:21:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:21:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:21:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-26 19:21:57,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:21:57,062 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 19:21:57,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:21:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:21:57,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:21:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:21:57,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:21:57,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-26 19:21:57,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:21:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:21:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:21:57,252 INFO L87 Difference]: Start difference. First operand 7401 states and 9503 transitions. Second operand 4 states. [2018-10-26 19:22:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:22:02,242 INFO L93 Difference]: Finished difference Result 22986 states and 30364 transitions. [2018-10-26 19:22:02,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:22:02,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-26 19:22:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:22:02,314 INFO L225 Difference]: With dead ends: 22986 [2018-10-26 19:22:02,314 INFO L226 Difference]: Without dead ends: 15887 [2018-10-26 19:22:02,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 166 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 19:22:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15887 states. [2018-10-26 19:22:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15887 to 10399. [2018-10-26 19:22:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10399 states. [2018-10-26 19:22:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10399 states to 10399 states and 12693 transitions. [2018-10-26 19:22:02,571 INFO L78 Accepts]: Start accepts. Automaton has 10399 states and 12693 transitions. Word has length 166 [2018-10-26 19:22:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:22:02,572 INFO L481 AbstractCegarLoop]: Abstraction has 10399 states and 12693 transitions. [2018-10-26 19:22:02,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:22:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 10399 states and 12693 transitions. [2018-10-26 19:22:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 19:22:02,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:22:02,581 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:22:02,583 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:22:02,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:22:02,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1128372212, now seen corresponding path program 1 times [2018-10-26 19:22:02,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:22:02,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:22:02,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:02,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:22:02,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:22:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:22:03,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:22:03,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:22:03,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:22:03,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:22:03,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:22:03,169 INFO L87 Difference]: Start difference. First operand 10399 states and 12693 transitions. Second operand 5 states. [2018-10-26 19:22:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:22:06,570 INFO L93 Difference]: Finished difference Result 21099 states and 25769 transitions. [2018-10-26 19:22:06,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:22:06,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2018-10-26 19:22:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:22:06,616 INFO L225 Difference]: With dead ends: 21099 [2018-10-26 19:22:06,616 INFO L226 Difference]: Without dead ends: 11002 [2018-10-26 19:22:06,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:22:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11002 states. [2018-10-26 19:22:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11002 to 10999. [2018-10-26 19:22:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10999 states. [2018-10-26 19:22:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10999 states to 10999 states and 13311 transitions. [2018-10-26 19:22:06,800 INFO L78 Accepts]: Start accepts. Automaton has 10999 states and 13311 transitions. Word has length 166 [2018-10-26 19:22:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:22:06,801 INFO L481 AbstractCegarLoop]: Abstraction has 10999 states and 13311 transitions. [2018-10-26 19:22:06,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:22:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10999 states and 13311 transitions. [2018-10-26 19:22:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 19:22:06,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:22:06,804 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:22:06,804 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:22:06,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:22:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1633315711, now seen corresponding path program 1 times [2018-10-26 19:22:06,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:22:06,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:22:06,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:06,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:22:06,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:22:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:22:07,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:22:07,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:22:07,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:22:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:22:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:22:07,081 INFO L87 Difference]: Start difference. First operand 10999 states and 13311 transitions. Second operand 4 states. [2018-10-26 19:22:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:22:16,265 INFO L93 Difference]: Finished difference Result 23850 states and 29001 transitions. [2018-10-26 19:22:16,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:22:16,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 19:22:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:22:16,296 INFO L225 Difference]: With dead ends: 23850 [2018-10-26 19:22:16,296 INFO L226 Difference]: Without dead ends: 13153 [2018-10-26 19:22:16,310 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 19:22:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13153 states. [2018-10-26 19:22:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13153 to 11609. [2018-10-26 19:22:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11609 states. [2018-10-26 19:22:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 14169 transitions. [2018-10-26 19:22:16,466 INFO L78 Accepts]: Start accepts. Automaton has 11609 states and 14169 transitions. Word has length 184 [2018-10-26 19:22:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:22:16,467 INFO L481 AbstractCegarLoop]: Abstraction has 11609 states and 14169 transitions. [2018-10-26 19:22:16,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:22:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 11609 states and 14169 transitions. [2018-10-26 19:22:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-26 19:22:16,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:22:16,470 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:22:16,470 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:22:16,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:22:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash 318381937, now seen corresponding path program 1 times [2018-10-26 19:22:16,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:22:16,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:22:16,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:16,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:22:16,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:22:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:22:16,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:22:16,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:22:16,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:22:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:22:16,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:22:16,819 INFO L87 Difference]: Start difference. First operand 11609 states and 14169 transitions. Second operand 4 states. [2018-10-26 19:22:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:22:23,717 INFO L93 Difference]: Finished difference Result 21705 states and 26619 transitions. [2018-10-26 19:22:23,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:22:23,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2018-10-26 19:22:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:22:23,735 INFO L225 Difference]: With dead ends: 21705 [2018-10-26 19:22:23,736 INFO L226 Difference]: Without dead ends: 10398 [2018-10-26 19:22:23,748 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 19:22:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10398 states. [2018-10-26 19:22:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10398 to 7967. [2018-10-26 19:22:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7967 states. [2018-10-26 19:22:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7967 states to 7967 states and 9792 transitions. [2018-10-26 19:22:23,888 INFO L78 Accepts]: Start accepts. Automaton has 7967 states and 9792 transitions. Word has length 241 [2018-10-26 19:22:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:22:23,888 INFO L481 AbstractCegarLoop]: Abstraction has 7967 states and 9792 transitions. [2018-10-26 19:22:23,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:22:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7967 states and 9792 transitions. [2018-10-26 19:22:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-26 19:22:23,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:22:23,895 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:22:23,895 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:22:23,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:22:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash 280969319, now seen corresponding path program 1 times [2018-10-26 19:22:23,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:22:23,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:22:23,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:23,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:22:23,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:22:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-26 19:22:24,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:22:24,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:22:24,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:22:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:22:24,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:22:24,448 INFO L87 Difference]: Start difference. First operand 7967 states and 9792 transitions. Second operand 3 states. [2018-10-26 19:22:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:22:30,711 INFO L93 Difference]: Finished difference Result 15632 states and 19277 transitions. [2018-10-26 19:22:30,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:22:30,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-26 19:22:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:22:30,737 INFO L225 Difference]: With dead ends: 15632 [2018-10-26 19:22:30,737 INFO L226 Difference]: Without dead ends: 7667 [2018-10-26 19:22:30,745 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-26 19:22:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7667 states. [2018-10-26 19:22:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7667 to 7664. [2018-10-26 19:22:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7664 states. [2018-10-26 19:22:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7664 states to 7664 states and 9198 transitions. [2018-10-26 19:22:30,843 INFO L78 Accepts]: Start accepts. Automaton has 7664 states and 9198 transitions. Word has length 296 [2018-10-26 19:22:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:22:30,844 INFO L481 AbstractCegarLoop]: Abstraction has 7664 states and 9198 transitions. [2018-10-26 19:22:30,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:22:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7664 states and 9198 transitions. [2018-10-26 19:22:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-26 19:22:30,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:22:30,854 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:22:30,854 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:22:30,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:22:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash -423493494, now seen corresponding path program 1 times [2018-10-26 19:22:30,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:22:30,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:22:30,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:30,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:22:30,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:22:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:22:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 5 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:22:31,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:22:31,597 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 19:22:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:22:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:22:31,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:22:34,140 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 467 DAG size of output: 28 [2018-10-26 19:22:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:22:35,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:22:35,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-26 19:22:35,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:22:35,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:22:35,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:22:35,125 INFO L87 Difference]: Start difference. First operand 7664 states and 9198 transitions. Second operand 7 states. [2018-10-26 19:24:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:51,216 INFO L93 Difference]: Finished difference Result 27183 states and 33455 transitions. [2018-10-26 19:24:51,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:24:51,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2018-10-26 19:24:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:51,247 INFO L225 Difference]: With dead ends: 27183 [2018-10-26 19:24:51,248 INFO L226 Difference]: Without dead ends: 19521 [2018-10-26 19:24:51,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:24:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19521 states. [2018-10-26 19:24:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19521 to 10982. [2018-10-26 19:24:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10982 states. [2018-10-26 19:24:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10982 states to 10982 states and 13523 transitions. [2018-10-26 19:24:51,440 INFO L78 Accepts]: Start accepts. Automaton has 10982 states and 13523 transitions. Word has length 356 [2018-10-26 19:24:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:51,441 INFO L481 AbstractCegarLoop]: Abstraction has 10982 states and 13523 transitions. [2018-10-26 19:24:51,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:24:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 10982 states and 13523 transitions. [2018-10-26 19:24:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-26 19:24:51,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:51,451 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:24:51,451 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:51,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1127810796, now seen corresponding path program 1 times [2018-10-26 19:24:51,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:51,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:51,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:51,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:51,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:51,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:51,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:24:51,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:24:51,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:24:51,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:24:51,946 INFO L87 Difference]: Start difference. First operand 10982 states and 13523 transitions. Second operand 4 states. [2018-10-26 19:24:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:57,820 INFO L93 Difference]: Finished difference Result 27970 states and 34759 transitions. [2018-10-26 19:24:57,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:24:57,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 410 [2018-10-26 19:24:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:57,843 INFO L225 Difference]: With dead ends: 27970 [2018-10-26 19:24:57,843 INFO L226 Difference]: Without dead ends: 17290 [2018-10-26 19:24:57,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 19:24:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-10-26 19:24:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 16983. [2018-10-26 19:24:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16983 states. [2018-10-26 19:24:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16983 states to 16983 states and 20115 transitions. [2018-10-26 19:24:58,064 INFO L78 Accepts]: Start accepts. Automaton has 16983 states and 20115 transitions. Word has length 410 [2018-10-26 19:24:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:58,064 INFO L481 AbstractCegarLoop]: Abstraction has 16983 states and 20115 transitions. [2018-10-26 19:24:58,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:24:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 16983 states and 20115 transitions. [2018-10-26 19:24:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-26 19:24:58,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:58,075 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:58,076 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:58,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:58,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1994188793, now seen corresponding path program 1 times [2018-10-26 19:24:58,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:58,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:58,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 227 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:24:59,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:59,199 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 19:24:59,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:59,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:25:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 192 proven. 39 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:25:00,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:25:00,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-26 19:25:00,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:25:00,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:25:00,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:25:00,070 INFO L87 Difference]: Start difference. First operand 16983 states and 20115 transitions. Second operand 9 states. [2018-10-26 19:25:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:09,559 INFO L93 Difference]: Finished difference Result 40874 states and 48350 transitions. [2018-10-26 19:25:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 19:25:09,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 413 [2018-10-26 19:25:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:09,575 INFO L225 Difference]: With dead ends: 40874 [2018-10-26 19:25:09,575 INFO L226 Difference]: Without dead ends: 16918 [2018-10-26 19:25:09,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 410 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-26 19:25:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-10-26 19:25:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 13313. [2018-10-26 19:25:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13313 states. [2018-10-26 19:25:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13313 states to 13313 states and 14523 transitions. [2018-10-26 19:25:09,762 INFO L78 Accepts]: Start accepts. Automaton has 13313 states and 14523 transitions. Word has length 413 [2018-10-26 19:25:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:09,762 INFO L481 AbstractCegarLoop]: Abstraction has 13313 states and 14523 transitions. [2018-10-26 19:25:09,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:25:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13313 states and 14523 transitions. [2018-10-26 19:25:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-10-26 19:25:09,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:09,766 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:25:09,767 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:09,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash 880056842, now seen corresponding path program 1 times [2018-10-26 19:25:09,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:09,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 19:25:10,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:25:10,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:25:10,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:25:10,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:25:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:25:10,368 INFO L87 Difference]: Start difference. First operand 13313 states and 14523 transitions. Second operand 4 states. [2018-10-26 19:25:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:13,318 INFO L93 Difference]: Finished difference Result 26321 states and 28735 transitions. [2018-10-26 19:25:13,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:25:13,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 461 [2018-10-26 19:25:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:13,330 INFO L225 Difference]: With dead ends: 26321 [2018-10-26 19:25:13,331 INFO L226 Difference]: Without dead ends: 13310 [2018-10-26 19:25:13,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 19:25:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2018-10-26 19:25:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 13007. [2018-10-26 19:25:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13007 states. [2018-10-26 19:25:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 13942 transitions. [2018-10-26 19:25:13,469 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 13942 transitions. Word has length 461 [2018-10-26 19:25:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:13,470 INFO L481 AbstractCegarLoop]: Abstraction has 13007 states and 13942 transitions. [2018-10-26 19:25:13,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:25:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 13942 transitions. [2018-10-26 19:25:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-26 19:25:13,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:13,474 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:25:13,474 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:13,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:13,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1468222605, now seen corresponding path program 1 times [2018-10-26 19:25:13,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:13,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:13,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:13,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:13,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:14,027 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 19:25:14,541 WARN L179 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 18 [2018-10-26 19:25:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 164 proven. 107 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:25:15,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:25:15,365 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:25:15,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:15,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:25:23,857 WARN L179 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2018-10-26 19:25:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 164 proven. 107 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:25:24,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:25:24,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-26 19:25:24,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 19:25:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 19:25:24,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:25:24,620 INFO L87 Difference]: Start difference. First operand 13007 states and 13942 transitions. Second operand 12 states. Received shutdown request... [2018-10-26 19:25:35,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:25:35,824 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 19:25:35,829 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 19:25:35,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:25:35 BoogieIcfgContainer [2018-10-26 19:25:35,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:25:35,830 INFO L168 Benchmark]: Toolchain (without parser) took 256779.96 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 816.1 MB. Max. memory is 7.1 GB. [2018-10-26 19:25:35,832 INFO L168 Benchmark]: CDTParser took 0.23 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 19:25:35,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1194.39 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-10-26 19:25:35,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 438.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 765.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -872.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-26 19:25:35,835 INFO L168 Benchmark]: Boogie Preprocessor took 207.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:25:35,836 INFO L168 Benchmark]: RCFGBuilder took 6677.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 329.7 MB). Peak memory consumption was 329.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:25:35,836 INFO L168 Benchmark]: TraceAbstraction took 248255.41 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 1.8 GB in the beginning and 2.5 GB in the end (delta: -701.7 MB). Peak memory consumption was 470.1 MB. Max. memory is 7.1 GB. [2018-10-26 19:25:35,844 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.23 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 1194.39 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 438.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 765.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -872.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 207.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6677.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 329.7 MB). Peak memory consumption was 329.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248255.41 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 1.8 GB in the beginning and 2.5 GB in the end (delta: -701.7 MB). Peak memory consumption was 470.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 25). Cancelled while BasicCegarLoop was constructing difference of abstraction (13007states) and FLOYD_HOARE automaton (currently 5 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (1810 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 248.1s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 223.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4517 SDtfs, 14001 SDslu, 1995 SDs, 0 SdLazy, 30908 SolverSat, 5137 SolverUnsat, 52 SolverUnknown, 0 SolverNotchecked, 212.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1469 GetRequests, 1406 SyntacticMatches, 13 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16983occurred in iteration=11, 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: 1.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 22574 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 4813 NumberOfCodeBlocks, 4813 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4795 ConstructedInterpolants, 174 QuantifiedInterpolants, 13234924 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1765 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 1449/1844 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown