java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:58:01,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:58:01,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:58:01,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:58:01,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:58:01,039 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:58:01,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:58:01,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:58:01,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:58:01,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:58:01,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:58:01,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:58:01,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:58:01,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:58:01,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:58:01,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:58:01,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:58:01,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:58:01,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:58:01,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:58:01,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:58:01,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:58:01,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:58:01,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:58:01,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:58:01,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:58:01,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:58:01,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:58:01,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:58:01,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:58:01,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:58:01,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:58:01,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:58:01,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:58:01,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:58:01,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:58:01,072 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:58:01,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:58:01,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:58:01,090 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:58:01,090 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:58:01,090 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:58:01,091 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:58:01,091 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:58:01,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:58:01,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:58:01,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:58:01,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:58:01,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:58:01,093 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:58:01,093 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:58:01,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:58:01,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:58:01,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:58:01,094 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:58:01,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:58:01,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:01,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:58:01,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:58:01,096 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:58:01,097 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:58:01,097 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:58:01,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:58:01,097 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:58:01,097 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:58:01,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:58:01,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:58:01,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:58:01,169 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:58:01,170 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:58:01,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c [2018-10-26 19:58:01,234 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/341ac9bfb/b1b2fba4005149bbb4e83cb32496ff9d/FLAGaaf99424a [2018-10-26 19:58:01,932 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:58:01,933 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c [2018-10-26 19:58:01,961 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/341ac9bfb/b1b2fba4005149bbb4e83cb32496ff9d/FLAGaaf99424a [2018-10-26 19:58:01,977 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/341ac9bfb/b1b2fba4005149bbb4e83cb32496ff9d [2018-10-26 19:58:01,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:58:01,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:58:01,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:01,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:58:01,994 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:58:01,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:01" (1/1) ... [2018-10-26 19:58:01,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6628d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:01, skipping insertion in model container [2018-10-26 19:58:01,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:01" (1/1) ... [2018-10-26 19:58:02,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:58:02,098 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:58:02,780 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:02,786 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:58:03,033 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:03,057 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:58:03,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03 WrapperNode [2018-10-26 19:58:03,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:03,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:03,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:58:03,059 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:58:03,070 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:58:03" (1/1) ... [2018-10-26 19:58:03,116 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:58:03" (1/1) ... [2018-10-26 19:58:03,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:03,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:58:03,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:58:03,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:58:03,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:58:03,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:58:03,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:58:03,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:58:03,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (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:58:03,575 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:58:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:58:03,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:58:09,034 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:58:09,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:09 BoogieIcfgContainer [2018-10-26 19:58:09,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:58:09,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:58:09,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:58:09,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:58:09,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:58:01" (1/3) ... [2018-10-26 19:58:09,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da7da70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:09, skipping insertion in model container [2018-10-26 19:58:09,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (2/3) ... [2018-10-26 19:58:09,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da7da70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:09, skipping insertion in model container [2018-10-26 19:58:09,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:09" (3/3) ... [2018-10-26 19:58:09,043 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label03_true-unreach-call.c [2018-10-26 19:58:09,054 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:58:09,063 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:58:09,082 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:58:09,121 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:58:09,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:58:09,122 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:58:09,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:58:09,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:58:09,123 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:58:09,123 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:58:09,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:58:09,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:58:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 19:58:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 19:58:09,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:09,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:09,174 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:09,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1347359086, now seen corresponding path program 1 times [2018-10-26 19:58:09,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:09,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:09,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:09,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:09,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:10,071 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:58:10,162 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:58:10,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:10,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:10,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:10,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:10,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:10,192 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 19:58:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:13,614 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-26 19:58:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:13,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-10-26 19:58:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:13,646 INFO L225 Difference]: With dead ends: 1089 [2018-10-26 19:58:13,647 INFO L226 Difference]: Without dead ends: 779 [2018-10-26 19:58:13,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-26 19:58:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-26 19:58:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-26 19:58:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-26 19:58:13,737 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 165 [2018-10-26 19:58:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:13,738 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-26 19:58:13,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-26 19:58:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-26 19:58:13,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:13,744 INFO L375 BasicCegarLoop]: trace histogram [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:58:13,745 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:13,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash 751655233, now seen corresponding path program 1 times [2018-10-26 19:58:13,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:13,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:13,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:14,006 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:58:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:14,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:14,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:14,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:14,134 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-26 19:58:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:18,540 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-26 19:58:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:18,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-10-26 19:58:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:18,549 INFO L225 Difference]: With dead ends: 1904 [2018-10-26 19:58:18,549 INFO L226 Difference]: Without dead ends: 1391 [2018-10-26 19:58:18,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-26 19:58:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-26 19:58:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-26 19:58:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-26 19:58:18,605 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 171 [2018-10-26 19:58:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:18,606 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-26 19:58:18,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-26 19:58:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 19:58:18,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:18,611 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] [2018-10-26 19:58:18,612 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:18,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash -942218426, now seen corresponding path program 1 times [2018-10-26 19:58:18,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:18,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:18,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:18,723 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:58:18,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:18,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:18,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:18,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:18,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:18,728 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-26 19:58:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:21,843 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-10-26 19:58:21,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:21,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-26 19:58:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:21,855 INFO L225 Difference]: With dead ends: 2711 [2018-10-26 19:58:21,855 INFO L226 Difference]: Without dead ends: 1786 [2018-10-26 19:58:21,857 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:58:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-26 19:58:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-10-26 19:58:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-10-26 19:58:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-10-26 19:58:21,897 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 172 [2018-10-26 19:58:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:21,897 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-10-26 19:58:21,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-10-26 19:58:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 19:58:21,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:21,902 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:21,902 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:21,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1357798669, now seen corresponding path program 1 times [2018-10-26 19:58:21,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:21,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:21,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:21,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:21,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:22,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:22,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:22,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:22,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:22,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:22,018 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-10-26 19:58:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:23,287 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-10-26 19:58:23,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:23,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-10-26 19:58:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:23,306 INFO L225 Difference]: With dead ends: 5215 [2018-10-26 19:58:23,307 INFO L226 Difference]: Without dead ends: 3433 [2018-10-26 19:58:23,310 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:58:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-10-26 19:58:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-10-26 19:58:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-26 19:58:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-10-26 19:58:23,387 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 174 [2018-10-26 19:58:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:23,388 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-10-26 19:58:23,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-10-26 19:58:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 19:58:23,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:23,396 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:23,396 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:23,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:23,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1216147553, now seen corresponding path program 1 times [2018-10-26 19:58:23,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:23,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:23,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:23,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:23,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:23,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:23,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:23,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:23,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:23,715 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 3 states. [2018-10-26 19:58:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:25,340 INFO L93 Difference]: Finished difference Result 6836 states and 10274 transitions. [2018-10-26 19:58:25,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:25,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-26 19:58:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:25,361 INFO L225 Difference]: With dead ends: 6836 [2018-10-26 19:58:25,361 INFO L226 Difference]: Without dead ends: 3422 [2018-10-26 19:58:25,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2018-10-26 19:58:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3416. [2018-10-26 19:58:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-26 19:58:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 4798 transitions. [2018-10-26 19:58:25,428 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 4798 transitions. Word has length 182 [2018-10-26 19:58:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:25,429 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 4798 transitions. [2018-10-26 19:58:25,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 4798 transitions. [2018-10-26 19:58:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 19:58:25,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:25,436 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:25,437 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:25,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash -50533991, now seen corresponding path program 1 times [2018-10-26 19:58:25,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:25,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:25,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:25,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:25,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:25,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:25,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:25,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:25,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:25,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:25,591 INFO L87 Difference]: Start difference. First operand 3416 states and 4798 transitions. Second operand 3 states. [2018-10-26 19:58:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:27,217 INFO L93 Difference]: Finished difference Result 10097 states and 14225 transitions. [2018-10-26 19:58:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:27,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-26 19:58:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:27,244 INFO L225 Difference]: With dead ends: 10097 [2018-10-26 19:58:27,244 INFO L226 Difference]: Without dead ends: 6683 [2018-10-26 19:58:27,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2018-10-26 19:58:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 6681. [2018-10-26 19:58:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6681 states. [2018-10-26 19:58:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 8561 transitions. [2018-10-26 19:58:27,372 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 8561 transitions. Word has length 189 [2018-10-26 19:58:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:27,373 INFO L481 AbstractCegarLoop]: Abstraction has 6681 states and 8561 transitions. [2018-10-26 19:58:27,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 8561 transitions. [2018-10-26 19:58:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 19:58:27,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:27,384 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:27,385 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:27,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1485224914, now seen corresponding path program 1 times [2018-10-26 19:58:27,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:27,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:27,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:27,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:27,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:27,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:27,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:27,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:27,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:27,656 INFO L87 Difference]: Start difference. First operand 6681 states and 8561 transitions. Second operand 4 states. [2018-10-26 19:58:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:30,116 INFO L93 Difference]: Finished difference Result 26271 states and 33635 transitions. [2018-10-26 19:58:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:30,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-26 19:58:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:30,181 INFO L225 Difference]: With dead ends: 26271 [2018-10-26 19:58:30,181 INFO L226 Difference]: Without dead ends: 19592 [2018-10-26 19:58:30,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19592 states. [2018-10-26 19:58:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19592 to 13007. [2018-10-26 19:58:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13007 states. [2018-10-26 19:58:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 16047 transitions. [2018-10-26 19:58:30,568 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 16047 transitions. Word has length 189 [2018-10-26 19:58:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:30,569 INFO L481 AbstractCegarLoop]: Abstraction has 13007 states and 16047 transitions. [2018-10-26 19:58:30,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 16047 transitions. [2018-10-26 19:58:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-26 19:58:30,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:30,594 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,594 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:30,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash -974747267, now seen corresponding path program 1 times [2018-10-26 19:58:30,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:30,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:30,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 19:58:30,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:30,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:30,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:30,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:30,754 INFO L87 Difference]: Start difference. First operand 13007 states and 16047 transitions. Second operand 3 states. [2018-10-26 19:58:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:32,211 INFO L93 Difference]: Finished difference Result 25980 states and 32049 transitions. [2018-10-26 19:58:32,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:32,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-10-26 19:58:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:32,243 INFO L225 Difference]: With dead ends: 25980 [2018-10-26 19:58:32,244 INFO L226 Difference]: Without dead ends: 12975 [2018-10-26 19:58:32,258 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:58:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12975 states. [2018-10-26 19:58:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12975 to 12975. [2018-10-26 19:58:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12975 states. [2018-10-26 19:58:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 15735 transitions. [2018-10-26 19:58:32,430 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 15735 transitions. Word has length 227 [2018-10-26 19:58:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:32,430 INFO L481 AbstractCegarLoop]: Abstraction has 12975 states and 15735 transitions. [2018-10-26 19:58:32,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 15735 transitions. [2018-10-26 19:58:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-26 19:58:32,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:32,450 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:32,451 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:32,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1948082637, now seen corresponding path program 1 times [2018-10-26 19:58:32,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:32,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:32,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:32,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:32,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:32,779 INFO L87 Difference]: Start difference. First operand 12975 states and 15735 transitions. Second operand 4 states. [2018-10-26 19:58:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:34,457 INFO L93 Difference]: Finished difference Result 30643 states and 37689 transitions. [2018-10-26 19:58:34,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:34,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-10-26 19:58:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:34,482 INFO L225 Difference]: With dead ends: 30643 [2018-10-26 19:58:34,483 INFO L226 Difference]: Without dead ends: 17670 [2018-10-26 19:58:34,497 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:58:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2018-10-26 19:58:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17667. [2018-10-26 19:58:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17667 states. [2018-10-26 19:58:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17667 states to 17667 states and 20516 transitions. [2018-10-26 19:58:34,705 INFO L78 Accepts]: Start accepts. Automaton has 17667 states and 20516 transitions. Word has length 230 [2018-10-26 19:58:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:34,706 INFO L481 AbstractCegarLoop]: Abstraction has 17667 states and 20516 transitions. [2018-10-26 19:58:34,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 17667 states and 20516 transitions. [2018-10-26 19:58:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-26 19:58:34,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:34,728 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:34,728 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:34,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:34,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1958712054, now seen corresponding path program 1 times [2018-10-26 19:58:34,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:34,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:34,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:34,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:34,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:34,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:34,914 INFO L87 Difference]: Start difference. First operand 17667 states and 20516 transitions. Second operand 3 states. [2018-10-26 19:58:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:36,275 INFO L93 Difference]: Finished difference Result 34923 states and 40585 transitions. [2018-10-26 19:58:36,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:36,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-10-26 19:58:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:36,296 INFO L225 Difference]: With dead ends: 34923 [2018-10-26 19:58:36,297 INFO L226 Difference]: Without dead ends: 17258 [2018-10-26 19:58:36,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17258 states. [2018-10-26 19:58:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17258 to 17257. [2018-10-26 19:58:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17257 states. [2018-10-26 19:58:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17257 states to 17257 states and 19455 transitions. [2018-10-26 19:58:36,525 INFO L78 Accepts]: Start accepts. Automaton has 17257 states and 19455 transitions. Word has length 256 [2018-10-26 19:58:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:36,525 INFO L481 AbstractCegarLoop]: Abstraction has 17257 states and 19455 transitions. [2018-10-26 19:58:36,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17257 states and 19455 transitions. [2018-10-26 19:58:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-26 19:58:36,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:36,546 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-10-26 19:58:36,547 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:36,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:36,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2046103689, now seen corresponding path program 1 times [2018-10-26 19:58:36,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:36,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:36,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:36,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-26 19:58:36,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:36,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:58:36,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:58:36,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:58:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:58:36,971 INFO L87 Difference]: Start difference. First operand 17257 states and 19455 transitions. Second operand 5 states. [2018-10-26 19:58:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:39,664 INFO L93 Difference]: Finished difference Result 52355 states and 58792 transitions. [2018-10-26 19:58:39,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:58:39,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-10-26 19:58:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:39,703 INFO L225 Difference]: With dead ends: 52355 [2018-10-26 19:58:39,703 INFO L226 Difference]: Without dead ends: 35100 [2018-10-26 19:58:39,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:58:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35100 states. [2018-10-26 19:58:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35100 to 35095. [2018-10-26 19:58:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35095 states. [2018-10-26 19:58:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35095 states to 35095 states and 39310 transitions. [2018-10-26 19:58:40,162 INFO L78 Accepts]: Start accepts. Automaton has 35095 states and 39310 transitions. Word has length 266 [2018-10-26 19:58:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:40,163 INFO L481 AbstractCegarLoop]: Abstraction has 35095 states and 39310 transitions. [2018-10-26 19:58:40,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:58:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 35095 states and 39310 transitions. [2018-10-26 19:58:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-26 19:58:40,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:40,186 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:40,187 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:40,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:40,187 INFO L82 PathProgramCache]: Analyzing trace with hash 646529718, now seen corresponding path program 1 times [2018-10-26 19:58:40,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:40,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:40,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:40,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:40,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 19:58:40,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:40,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:40,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:40,495 INFO L87 Difference]: Start difference. First operand 35095 states and 39310 transitions. Second operand 4 states. [2018-10-26 19:58:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:42,045 INFO L93 Difference]: Finished difference Result 69313 states and 77621 transitions. [2018-10-26 19:58:42,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:42,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-10-26 19:58:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:42,079 INFO L225 Difference]: With dead ends: 69313 [2018-10-26 19:58:42,079 INFO L226 Difference]: Without dead ends: 34220 [2018-10-26 19:58:42,102 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:58:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34220 states. [2018-10-26 19:58:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34220 to 34220. [2018-10-26 19:58:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34220 states. [2018-10-26 19:58:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34220 states to 34220 states and 37008 transitions. [2018-10-26 19:58:42,479 INFO L78 Accepts]: Start accepts. Automaton has 34220 states and 37008 transitions. Word has length 267 [2018-10-26 19:58:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:42,480 INFO L481 AbstractCegarLoop]: Abstraction has 34220 states and 37008 transitions. [2018-10-26 19:58:42,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 34220 states and 37008 transitions. [2018-10-26 19:58:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 19:58:42,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:42,493 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:42,494 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:42,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1794947131, now seen corresponding path program 1 times [2018-10-26 19:58:42,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:42,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:42,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 19:58:42,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:42,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:42,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:42,845 INFO L87 Difference]: Start difference. First operand 34220 states and 37008 transitions. Second operand 4 states. [2018-10-26 19:58:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:45,238 INFO L93 Difference]: Finished difference Result 120696 states and 130174 transitions. [2018-10-26 19:58:45,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:45,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-10-26 19:58:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:45,322 INFO L225 Difference]: With dead ends: 120696 [2018-10-26 19:58:45,323 INFO L226 Difference]: Without dead ends: 86478 [2018-10-26 19:58:45,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86478 states. [2018-10-26 19:58:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86478 to 86474. [2018-10-26 19:58:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86474 states. [2018-10-26 19:58:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86474 states to 86474 states and 93054 transitions. [2018-10-26 19:58:46,549 INFO L78 Accepts]: Start accepts. Automaton has 86474 states and 93054 transitions. Word has length 269 [2018-10-26 19:58:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:46,549 INFO L481 AbstractCegarLoop]: Abstraction has 86474 states and 93054 transitions. [2018-10-26 19:58:46,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 86474 states and 93054 transitions. [2018-10-26 19:58:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-26 19:58:46,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:46,559 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:46,559 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:46,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash 74302533, now seen corresponding path program 1 times [2018-10-26 19:58:46,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:46,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 19:58:46,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:46,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:46,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:46,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:46,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:46,739 INFO L87 Difference]: Start difference. First operand 86474 states and 93054 transitions. Second operand 3 states. [2018-10-26 19:58:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:47,970 INFO L93 Difference]: Finished difference Result 172943 states and 186103 transitions. [2018-10-26 19:58:47,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:47,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-26 19:58:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:48,060 INFO L225 Difference]: With dead ends: 172943 [2018-10-26 19:58:48,060 INFO L226 Difference]: Without dead ends: 86471 [2018-10-26 19:58:48,104 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:58:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86471 states. [2018-10-26 19:58:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86471 to 86471. [2018-10-26 19:58:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86471 states. [2018-10-26 19:58:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86471 states to 86471 states and 93048 transitions. [2018-10-26 19:58:49,755 INFO L78 Accepts]: Start accepts. Automaton has 86471 states and 93048 transitions. Word has length 298 [2018-10-26 19:58:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:49,755 INFO L481 AbstractCegarLoop]: Abstraction has 86471 states and 93048 transitions. [2018-10-26 19:58:49,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 86471 states and 93048 transitions. [2018-10-26 19:58:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-26 19:58:49,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:49,766 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:49,766 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:49,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1488256468, now seen corresponding path program 1 times [2018-10-26 19:58:49,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:49,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:49,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:49,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:49,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 19:58:49,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:49,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:49,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:49,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:49,963 INFO L87 Difference]: Start difference. First operand 86471 states and 93048 transitions. Second operand 3 states. [2018-10-26 19:58:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:52,647 INFO L93 Difference]: Finished difference Result 214956 states and 231088 transitions. [2018-10-26 19:58:52,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:52,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-10-26 19:58:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:52,775 INFO L225 Difference]: With dead ends: 214956 [2018-10-26 19:58:52,775 INFO L226 Difference]: Without dead ends: 128487 [2018-10-26 19:58:52,825 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:58:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128487 states. [2018-10-26 19:58:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128487 to 125606. [2018-10-26 19:58:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125606 states. [2018-10-26 19:58:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125606 states to 125606 states and 134938 transitions. [2018-10-26 19:58:55,112 INFO L78 Accepts]: Start accepts. Automaton has 125606 states and 134938 transitions. Word has length 303 [2018-10-26 19:58:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:55,112 INFO L481 AbstractCegarLoop]: Abstraction has 125606 states and 134938 transitions. [2018-10-26 19:58:55,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 125606 states and 134938 transitions. [2018-10-26 19:58:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-26 19:58:55,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:55,133 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:55,133 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:55,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2106864431, now seen corresponding path program 1 times [2018-10-26 19:58:55,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:55,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:55,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:56,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:58:56,493 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:58:56,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:56,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:58:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:57,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:58:57,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 12 [2018-10-26 19:58:57,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 19:58:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 19:58:57,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:58:57,357 INFO L87 Difference]: Start difference. First operand 125606 states and 134938 transitions. Second operand 13 states. [2018-10-26 19:58:57,718 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 19:59:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:17,099 INFO L93 Difference]: Finished difference Result 557987 states and 598038 transitions. [2018-10-26 19:59:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 19:59:17,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 305 [2018-10-26 19:59:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:19,256 INFO L225 Difference]: With dead ends: 557987 [2018-10-26 19:59:19,256 INFO L226 Difference]: Without dead ends: 432383 [2018-10-26 19:59:19,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=281, Invalid=775, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 19:59:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432383 states. [2018-10-26 19:59:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432383 to 410123. [2018-10-26 19:59:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410123 states. [2018-10-26 19:59:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410123 states to 410123 states and 436941 transitions. [2018-10-26 19:59:28,279 INFO L78 Accepts]: Start accepts. Automaton has 410123 states and 436941 transitions. Word has length 305 [2018-10-26 19:59:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:28,279 INFO L481 AbstractCegarLoop]: Abstraction has 410123 states and 436941 transitions. [2018-10-26 19:59:28,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 19:59:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 410123 states and 436941 transitions. [2018-10-26 19:59:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-26 19:59:28,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:28,327 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:28,328 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:28,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1554377472, now seen corresponding path program 1 times [2018-10-26 19:59:28,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:28,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:28,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:28,693 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 19:59:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 19:59:28,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:59:28,908 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:59:28,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:29,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:59:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-26 19:59:29,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:59:29,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 19:59:29,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:59:29,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:59:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:59:29,187 INFO L87 Difference]: Start difference. First operand 410123 states and 436941 transitions. Second operand 6 states. [2018-10-26 19:59:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:44,148 INFO L93 Difference]: Finished difference Result 1145138 states and 1224839 transitions. [2018-10-26 19:59:44,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:59:44,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 311 [2018-10-26 19:59:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:45,280 INFO L225 Difference]: With dead ends: 1145138 [2018-10-26 19:59:45,280 INFO L226 Difference]: Without dead ends: 735631 [2018-10-26 19:59:45,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:59:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735631 states. [2018-10-26 19:59:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735631 to 687423. [2018-10-26 19:59:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687423 states. [2018-10-26 19:59:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687423 states to 687423 states and 729815 transitions. [2018-10-26 19:59:57,361 INFO L78 Accepts]: Start accepts. Automaton has 687423 states and 729815 transitions. Word has length 311 [2018-10-26 19:59:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:57,361 INFO L481 AbstractCegarLoop]: Abstraction has 687423 states and 729815 transitions. [2018-10-26 19:59:57,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:59:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 687423 states and 729815 transitions. [2018-10-26 19:59:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-26 19:59:57,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:57,416 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:57,416 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:57,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1662920129, now seen corresponding path program 1 times [2018-10-26 19:59:57,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:57,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:57,717 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:59:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-10-26 19:59:57,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:57,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:57,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:57,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:57,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:57,825 INFO L87 Difference]: Start difference. First operand 687423 states and 729815 transitions. Second operand 4 states. [2018-10-26 20:00:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:14,329 INFO L93 Difference]: Finished difference Result 1357273 states and 1441898 transitions. [2018-10-26 20:00:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:14,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2018-10-26 20:00:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:15,284 INFO L225 Difference]: With dead ends: 1357273 [2018-10-26 20:00:15,285 INFO L226 Difference]: Without dead ends: 670466 [2018-10-26 20:00:15,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670466 states. [2018-10-26 20:00:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670466 to 662624. [2018-10-26 20:00:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662624 states. [2018-10-26 20:00:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662624 states to 662624 states and 702576 transitions. [2018-10-26 20:00:27,376 INFO L78 Accepts]: Start accepts. Automaton has 662624 states and 702576 transitions. Word has length 377 [2018-10-26 20:00:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:27,377 INFO L481 AbstractCegarLoop]: Abstraction has 662624 states and 702576 transitions. [2018-10-26 20:00:27,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 662624 states and 702576 transitions. [2018-10-26 20:00:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-26 20:00:27,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:27,450 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 20:00:27,450 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:27,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1633540290, now seen corresponding path program 2 times [2018-10-26 20:00:27,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:27,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:27,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-26 20:00:27,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:27,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:27,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:27,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:27,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:27,743 INFO L87 Difference]: Start difference. First operand 662624 states and 702576 transitions. Second operand 4 states. [2018-10-26 20:00:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:50,141 INFO L93 Difference]: Finished difference Result 1854870 states and 1963824 transitions. [2018-10-26 20:00:50,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:50,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2018-10-26 20:00:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:51,858 INFO L225 Difference]: With dead ends: 1854870 [2018-10-26 20:00:51,858 INFO L226 Difference]: Without dead ends: 1192248 [2018-10-26 20:00:52,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192248 states. [2018-10-26 20:01:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192248 to 1170534. [2018-10-26 20:01:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170534 states. [2018-10-26 20:01:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170534 states to 1170534 states and 1238157 transitions. [2018-10-26 20:01:12,408 INFO L78 Accepts]: Start accepts. Automaton has 1170534 states and 1238157 transitions. Word has length 412 [2018-10-26 20:01:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:12,408 INFO L481 AbstractCegarLoop]: Abstraction has 1170534 states and 1238157 transitions. [2018-10-26 20:01:12,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1170534 states and 1238157 transitions. [2018-10-26 20:01:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-26 20:01:12,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:12,462 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-10-26 20:01:12,463 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:12,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:12,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1247768010, now seen corresponding path program 1 times [2018-10-26 20:01:12,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:12,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:12,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:12,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:01:12,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-26 20:01:14,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:14,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:14,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:14,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:14,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:14,588 INFO L87 Difference]: Start difference. First operand 1170534 states and 1238157 transitions. Second operand 3 states. Received shutdown request... [2018-10-26 20:01:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:26,897 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:01:26,902 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:01:26,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:01:26 BoogieIcfgContainer [2018-10-26 20:01:26,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:01:26,903 INFO L168 Benchmark]: Toolchain (without parser) took 204915.31 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.1 GB). Free memory was 1.4 GB in the beginning and 4.8 GB in the end (delta: -3.4 GB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:26,904 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:01:26,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1068.67 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:26,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 319.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -870.1 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:26,906 INFO L168 Benchmark]: Boogie Preprocessor took 126.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:26,907 INFO L168 Benchmark]: RCFGBuilder took 5529.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 248.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:26,908 INFO L168 Benchmark]: TraceAbstraction took 197866.54 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.4 GB). Free memory was 1.9 GB in the beginning and 4.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:26,913 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1068.67 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 319.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -870.1 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5529.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 248.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197866.54 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.4 GB). Free memory was 1.9 GB in the beginning and 4.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1527]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1527). Cancelled while BasicCegarLoop was constructing difference of abstraction (1170534states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (309800 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 197.7s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 126.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4732 SDtfs, 17103 SDslu, 3196 SDs, 0 SdLazy, 26007 SolverSat, 5016 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 640 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1170534occurred in iteration=19, 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: 60.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 110258 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 5823 NumberOfCodeBlocks, 5823 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5801 ConstructedInterpolants, 0 QuantifiedInterpolants, 5517162 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1023 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 3170/3452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown