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_label20_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:53:23,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:53:23,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:53:23,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:53:23,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:53:23,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:53:23,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:53:23,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:53:23,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:53:23,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:53:23,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:53:23,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:53:23,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:53:23,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:53:23,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:53:23,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:53:23,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:53:23,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:53:23,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:53:23,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:53:23,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:53:23,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:53:23,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:53:23,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:53:23,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:53:23,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:53:23,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:53:23,078 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:53:23,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:53:23,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:53:23,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:53:23,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:53:23,081 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:53:23,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:53:23,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:53:23,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:53:23,084 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-23 18:53:23,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:53:23,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:53:23,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:53:23,100 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:53:23,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:53:23,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:53:23,101 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:53:23,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:53:23,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:53:23,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:53:23,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:53:23,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:53:23,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:53:23,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:53:23,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:53:23,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:53:23,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:53:23,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:53:23,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:53:23,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:53:23,104 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:53:23,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:53:23,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:53:23,105 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:53:23,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:53:23,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:53:23,105 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:53:23,105 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:53:23,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:53:23,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:53:23,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:53:23,200 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:53:23,200 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:53:23,201 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label20_true-unreach-call.c [2018-10-23 18:53:23,270 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1878c615e/3bec7b5d45174515a91bf8765b98acc8/FLAGb483e1dc5 [2018-10-23 18:53:23,959 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:53:23,962 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label20_true-unreach-call.c [2018-10-23 18:53:23,983 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1878c615e/3bec7b5d45174515a91bf8765b98acc8/FLAGb483e1dc5 [2018-10-23 18:53:24,003 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1878c615e/3bec7b5d45174515a91bf8765b98acc8 [2018-10-23 18:53:24,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:53:24,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:53:24,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:24,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:53:24,024 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:53:24,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:24" (1/1) ... [2018-10-23 18:53:24,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3829398b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24, skipping insertion in model container [2018-10-23 18:53:24,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:24" (1/1) ... [2018-10-23 18:53:24,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:53:24,135 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:53:24,884 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:24,890 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:53:25,216 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:25,240 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:53:25,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25 WrapperNode [2018-10-23 18:53:25,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:25,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:25,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:53:25,242 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:53:25,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:25,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:53:25,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:53:25,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:53:25,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:53:25,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:53:25,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:53:25,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:53:25,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (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-23 18:53:25,745 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:53:25,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:53:25,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:53:31,167 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:53:31,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:31 BoogieIcfgContainer [2018-10-23 18:53:31,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:53:31,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:53:31,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:53:31,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:53:31,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:53:24" (1/3) ... [2018-10-23 18:53:31,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452a7ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:31, skipping insertion in model container [2018-10-23 18:53:31,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (2/3) ... [2018-10-23 18:53:31,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452a7ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:31, skipping insertion in model container [2018-10-23 18:53:31,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:31" (3/3) ... [2018-10-23 18:53:31,178 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label20_true-unreach-call.c [2018-10-23 18:53:31,188 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:53:31,197 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:53:31,215 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:53:31,253 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:53:31,254 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:53:31,254 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:53:31,254 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:53:31,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:53:31,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:53:31,255 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:53:31,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:53:31,255 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:53:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:53:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-23 18:53:31,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:31,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:31,308 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:31,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:31,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2132905468, now seen corresponding path program 1 times [2018-10-23 18:53:31,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:31,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:31,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:31,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:32,195 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:53:32,313 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-23 18:53:32,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:32,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:32,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:32,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:32,341 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:53:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:35,687 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-23 18:53:35,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:35,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-10-23 18:53:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:35,717 INFO L225 Difference]: With dead ends: 1075 [2018-10-23 18:53:35,717 INFO L226 Difference]: Without dead ends: 765 [2018-10-23 18:53:35,722 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-23 18:53:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-23 18:53:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-23 18:53:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-23 18:53:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-23 18:53:35,809 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 196 [2018-10-23 18:53:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:35,811 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-23 18:53:35,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-23 18:53:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-23 18:53:35,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:35,818 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:35,819 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:35,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 481259907, now seen corresponding path program 1 times [2018-10-23 18:53:35,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:35,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:35,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:35,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:35,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:35,993 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-23 18:53:35,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:35,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:35,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:36,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:36,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:36,001 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-23 18:53:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:38,215 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-23 18:53:38,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:38,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-23 18:53:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:38,227 INFO L225 Difference]: With dead ends: 1465 [2018-10-23 18:53:38,228 INFO L226 Difference]: Without dead ends: 947 [2018-10-23 18:53:38,231 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-23 18:53:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-23 18:53:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-23 18:53:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-23 18:53:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-23 18:53:38,285 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 205 [2018-10-23 18:53:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:38,285 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-23 18:53:38,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-23 18:53:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-23 18:53:38,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:38,296 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:38,296 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:38,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash 561737559, now seen corresponding path program 1 times [2018-10-23 18:53:38,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:38,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:38,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:38,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:38,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:38,604 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-23 18:53:38,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:38,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:38,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:38,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:38,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:38,607 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-23 18:53:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:42,731 INFO L93 Difference]: Finished difference Result 2683 states and 4400 transitions. [2018-10-23 18:53:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:42,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-23 18:53:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:42,749 INFO L225 Difference]: With dead ends: 2683 [2018-10-23 18:53:42,750 INFO L226 Difference]: Without dead ends: 1754 [2018-10-23 18:53:42,752 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-23 18:53:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-10-23 18:53:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1753. [2018-10-23 18:53:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-10-23 18:53:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2648 transitions. [2018-10-23 18:53:42,791 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2648 transitions. Word has length 213 [2018-10-23 18:53:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:42,792 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2648 transitions. [2018-10-23 18:53:42,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2648 transitions. [2018-10-23 18:53:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-23 18:53:42,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:42,798 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, 1, 1, 1, 1, 1, 1, 1, 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-23 18:53:42,798 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:42,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1378145821, now seen corresponding path program 1 times [2018-10-23 18:53:42,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:42,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:42,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:42,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:42,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:42,943 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-23 18:53:42,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:42,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:42,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:42,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:42,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:42,945 INFO L87 Difference]: Start difference. First operand 1753 states and 2648 transitions. Second operand 3 states. [2018-10-23 18:53:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:44,557 INFO L93 Difference]: Finished difference Result 5139 states and 7808 transitions. [2018-10-23 18:53:44,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:44,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-23 18:53:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:44,576 INFO L225 Difference]: With dead ends: 5139 [2018-10-23 18:53:44,576 INFO L226 Difference]: Without dead ends: 3388 [2018-10-23 18:53:44,578 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-23 18:53:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-10-23 18:53:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3385. [2018-10-23 18:53:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-23 18:53:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4616 transitions. [2018-10-23 18:53:44,643 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4616 transitions. Word has length 220 [2018-10-23 18:53:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:44,643 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4616 transitions. [2018-10-23 18:53:44,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4616 transitions. [2018-10-23 18:53:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-23 18:53:44,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:44,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:53:44,654 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:44,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:44,654 INFO L82 PathProgramCache]: Analyzing trace with hash 864161103, now seen corresponding path program 1 times [2018-10-23 18:53:44,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:44,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:44,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:44,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:44,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:44,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:44,946 INFO L87 Difference]: Start difference. First operand 3385 states and 4616 transitions. Second operand 4 states. [2018-10-23 18:53:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:47,520 INFO L93 Difference]: Finished difference Result 13365 states and 18287 transitions. [2018-10-23 18:53:47,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:47,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-10-23 18:53:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:47,568 INFO L225 Difference]: With dead ends: 13365 [2018-10-23 18:53:47,569 INFO L226 Difference]: Without dead ends: 9982 [2018-10-23 18:53:47,576 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-23 18:53:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9982 states. [2018-10-23 18:53:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9982 to 6649. [2018-10-23 18:53:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-23 18:53:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8879 transitions. [2018-10-23 18:53:47,716 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8879 transitions. Word has length 223 [2018-10-23 18:53:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:47,716 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8879 transitions. [2018-10-23 18:53:47,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8879 transitions. [2018-10-23 18:53:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-23 18:53:47,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:47,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:53:47,732 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:47,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash 190389150, now seen corresponding path program 1 times [2018-10-23 18:53:47,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:47,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:47,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:47,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:47,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:47,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:47,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:47,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:47,862 INFO L87 Difference]: Start difference. First operand 6649 states and 8879 transitions. Second operand 4 states. [2018-10-23 18:53:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:49,760 INFO L93 Difference]: Finished difference Result 16563 states and 22621 transitions. [2018-10-23 18:53:49,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:49,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-10-23 18:53:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:49,796 INFO L225 Difference]: With dead ends: 16563 [2018-10-23 18:53:49,796 INFO L226 Difference]: Without dead ends: 9916 [2018-10-23 18:53:49,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2018-10-23 18:53:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9913. [2018-10-23 18:53:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9913 states. [2018-10-23 18:53:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9913 states to 9913 states and 12603 transitions. [2018-10-23 18:53:49,975 INFO L78 Accepts]: Start accepts. Automaton has 9913 states and 12603 transitions. Word has length 224 [2018-10-23 18:53:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:49,975 INFO L481 AbstractCegarLoop]: Abstraction has 9913 states and 12603 transitions. [2018-10-23 18:53:49,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 9913 states and 12603 transitions. [2018-10-23 18:53:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-23 18:53:49,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:49,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:53:49,998 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:49,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:49,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2062478070, now seen corresponding path program 1 times [2018-10-23 18:53:49,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:49,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:50,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:50,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:50,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:50,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:50,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:50,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:50,227 INFO L87 Difference]: Start difference. First operand 9913 states and 12603 transitions. Second operand 3 states. [2018-10-23 18:53:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:52,007 INFO L93 Difference]: Finished difference Result 24787 states and 31363 transitions. [2018-10-23 18:53:52,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:52,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-23 18:53:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:52,035 INFO L225 Difference]: With dead ends: 24787 [2018-10-23 18:53:52,035 INFO L226 Difference]: Without dead ends: 14876 [2018-10-23 18:53:52,047 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-23 18:53:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14876 states. [2018-10-23 18:53:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14876 to 14871. [2018-10-23 18:53:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-10-23 18:53:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 18725 transitions. [2018-10-23 18:53:52,242 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 18725 transitions. Word has length 225 [2018-10-23 18:53:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:52,242 INFO L481 AbstractCegarLoop]: Abstraction has 14871 states and 18725 transitions. [2018-10-23 18:53:52,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 18725 transitions. [2018-10-23 18:53:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-23 18:53:52,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:52,268 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:53:52,269 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:52,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash -811081506, now seen corresponding path program 1 times [2018-10-23 18:53:52,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:52,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:52,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:52,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:53:52,572 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-23 18:53:52,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:52,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:53:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:53:52,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:53:52,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 18:53:52,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:53:52,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:53:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:53:52,909 INFO L87 Difference]: Start difference. First operand 14871 states and 18725 transitions. Second operand 6 states. [2018-10-23 18:53:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:58,945 INFO L93 Difference]: Finished difference Result 72482 states and 90983 transitions. [2018-10-23 18:53:58,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:53:58,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2018-10-23 18:53:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:59,055 INFO L225 Difference]: With dead ends: 72482 [2018-10-23 18:53:59,055 INFO L226 Difference]: Without dead ends: 57613 [2018-10-23 18:53:59,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:53:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57613 states. [2018-10-23 18:53:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57613 to 57322. [2018-10-23 18:53:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57322 states. [2018-10-23 18:53:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57322 states to 57322 states and 67495 transitions. [2018-10-23 18:53:59,853 INFO L78 Accepts]: Start accepts. Automaton has 57322 states and 67495 transitions. Word has length 233 [2018-10-23 18:53:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:59,854 INFO L481 AbstractCegarLoop]: Abstraction has 57322 states and 67495 transitions. [2018-10-23 18:53:59,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:53:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 57322 states and 67495 transitions. [2018-10-23 18:53:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-23 18:53:59,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:59,924 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:59,924 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:59,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:59,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1878846867, now seen corresponding path program 1 times [2018-10-23 18:53:59,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:59,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:59,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-23 18:54:00,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:00,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:54:00,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:00,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:00,092 INFO L87 Difference]: Start difference. First operand 57322 states and 67495 transitions. Second operand 3 states. [2018-10-23 18:54:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:01,258 INFO L93 Difference]: Finished difference Result 113324 states and 133252 transitions. [2018-10-23 18:54:01,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:01,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-10-23 18:54:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:01,358 INFO L225 Difference]: With dead ends: 113324 [2018-10-23 18:54:01,358 INFO L226 Difference]: Without dead ends: 56004 [2018-10-23 18:54:01,412 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-23 18:54:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56004 states. [2018-10-23 18:54:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56004 to 56004. [2018-10-23 18:54:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56004 states. [2018-10-23 18:54:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56004 states to 56004 states and 64260 transitions. [2018-10-23 18:54:02,459 INFO L78 Accepts]: Start accepts. Automaton has 56004 states and 64260 transitions. Word has length 248 [2018-10-23 18:54:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:02,459 INFO L481 AbstractCegarLoop]: Abstraction has 56004 states and 64260 transitions. [2018-10-23 18:54:02,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 56004 states and 64260 transitions. [2018-10-23 18:54:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-23 18:54:02,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:02,491 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:54:02,491 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:02,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash 714838033, now seen corresponding path program 1 times [2018-10-23 18:54:02,492 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:02,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:02,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:54:02,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:02,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:02,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:02,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:02,782 INFO L87 Difference]: Start difference. First operand 56004 states and 64260 transitions. Second operand 4 states. [2018-10-23 18:54:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:05,308 INFO L93 Difference]: Finished difference Result 126724 states and 145678 transitions. [2018-10-23 18:54:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:05,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2018-10-23 18:54:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:05,383 INFO L225 Difference]: With dead ends: 126724 [2018-10-23 18:54:05,383 INFO L226 Difference]: Without dead ends: 70722 [2018-10-23 18:54:05,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70722 states. [2018-10-23 18:54:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70722 to 69483. [2018-10-23 18:54:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69483 states. [2018-10-23 18:54:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69483 states to 69483 states and 78479 transitions. [2018-10-23 18:54:06,664 INFO L78 Accepts]: Start accepts. Automaton has 69483 states and 78479 transitions. Word has length 307 [2018-10-23 18:54:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:06,664 INFO L481 AbstractCegarLoop]: Abstraction has 69483 states and 78479 transitions. [2018-10-23 18:54:06,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 69483 states and 78479 transitions. [2018-10-23 18:54:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-23 18:54:06,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:06,700 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:54:06,700 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:06,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash -976902293, now seen corresponding path program 1 times [2018-10-23 18:54:06,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:06,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:06,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:54:07,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:07,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:07,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:07,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:07,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:07,063 INFO L87 Difference]: Start difference. First operand 69483 states and 78479 transitions. Second operand 4 states. [2018-10-23 18:54:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:08,679 INFO L93 Difference]: Finished difference Result 139191 states and 157209 transitions. [2018-10-23 18:54:08,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:08,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-23 18:54:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:08,764 INFO L225 Difference]: With dead ends: 139191 [2018-10-23 18:54:08,764 INFO L226 Difference]: Without dead ends: 69710 [2018-10-23 18:54:08,803 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-23 18:54:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69710 states. [2018-10-23 18:54:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69710 to 69483. [2018-10-23 18:54:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69483 states. [2018-10-23 18:54:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69483 states to 69483 states and 78077 transitions. [2018-10-23 18:54:09,421 INFO L78 Accepts]: Start accepts. Automaton has 69483 states and 78077 transitions. Word has length 308 [2018-10-23 18:54:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:09,422 INFO L481 AbstractCegarLoop]: Abstraction has 69483 states and 78077 transitions. [2018-10-23 18:54:09,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 69483 states and 78077 transitions. [2018-10-23 18:54:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-23 18:54:09,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:09,455 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:54:09,455 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:09,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1729129238, now seen corresponding path program 1 times [2018-10-23 18:54:09,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:09,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:09,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:54:10,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:10,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:10,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:10,048 INFO L87 Difference]: Start difference. First operand 69483 states and 78077 transitions. Second operand 4 states. [2018-10-23 18:54:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:13,591 INFO L93 Difference]: Finished difference Result 266066 states and 298852 transitions. [2018-10-23 18:54:13,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:13,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-10-23 18:54:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:13,803 INFO L225 Difference]: With dead ends: 266066 [2018-10-23 18:54:13,803 INFO L226 Difference]: Without dead ends: 196585 [2018-10-23 18:54:13,849 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-23 18:54:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196585 states. [2018-10-23 18:54:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196585 to 128124. [2018-10-23 18:54:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128124 states. [2018-10-23 18:54:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128124 states to 128124 states and 143871 transitions. [2018-10-23 18:54:15,204 INFO L78 Accepts]: Start accepts. Automaton has 128124 states and 143871 transitions. Word has length 328 [2018-10-23 18:54:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:15,204 INFO L481 AbstractCegarLoop]: Abstraction has 128124 states and 143871 transitions. [2018-10-23 18:54:15,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 128124 states and 143871 transitions. [2018-10-23 18:54:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-23 18:54:15,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:15,228 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:54:15,229 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:15,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1848161845, now seen corresponding path program 1 times [2018-10-23 18:54:15,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:15,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:15,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:15,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:15,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-23 18:54:15,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:15,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:15,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:15,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:15,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:15,827 INFO L87 Difference]: Start difference. First operand 128124 states and 143871 transitions. Second operand 4 states. [2018-10-23 18:54:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:19,363 INFO L93 Difference]: Finished difference Result 375960 states and 421631 transitions. [2018-10-23 18:54:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:19,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2018-10-23 18:54:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:19,685 INFO L225 Difference]: With dead ends: 375960 [2018-10-23 18:54:19,686 INFO L226 Difference]: Without dead ends: 247838 [2018-10-23 18:54:19,790 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-23 18:54:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247838 states. [2018-10-23 18:54:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247838 to 247834. [2018-10-23 18:54:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247834 states. [2018-10-23 18:54:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247834 states to 247834 states and 277625 transitions. [2018-10-23 18:54:23,641 INFO L78 Accepts]: Start accepts. Automaton has 247834 states and 277625 transitions. Word has length 350 [2018-10-23 18:54:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:23,641 INFO L481 AbstractCegarLoop]: Abstraction has 247834 states and 277625 transitions. [2018-10-23 18:54:23,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 247834 states and 277625 transitions. [2018-10-23 18:54:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-23 18:54:23,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:23,697 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:54:23,697 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:23,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1357701147, now seen corresponding path program 1 times [2018-10-23 18:54:23,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:23,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:23,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:23,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:23,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 174 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:54:24,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:54:24,165 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-23 18:54:24,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:24,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:54:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-23 18:54:24,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:54:24,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:54:24,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:54:24,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:54:24,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:54:24,499 INFO L87 Difference]: Start difference. First operand 247834 states and 277625 transitions. Second operand 7 states. [2018-10-23 18:54:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:36,129 INFO L93 Difference]: Finished difference Result 587529 states and 661295 transitions. [2018-10-23 18:54:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-23 18:54:36,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 359 [2018-10-23 18:54:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:36,770 INFO L225 Difference]: With dead ends: 587529 [2018-10-23 18:54:36,770 INFO L226 Difference]: Without dead ends: 339697 [2018-10-23 18:54:36,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-23 18:54:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339697 states. [2018-10-23 18:54:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339697 to 328120. [2018-10-23 18:54:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328120 states. [2018-10-23 18:54:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328120 states to 328120 states and 362537 transitions. [2018-10-23 18:54:47,618 INFO L78 Accepts]: Start accepts. Automaton has 328120 states and 362537 transitions. Word has length 359 [2018-10-23 18:54:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:47,618 INFO L481 AbstractCegarLoop]: Abstraction has 328120 states and 362537 transitions. [2018-10-23 18:54:47,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:54:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 328120 states and 362537 transitions. [2018-10-23 18:54:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-23 18:54:47,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:47,726 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:47,726 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:47,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1334160662, now seen corresponding path program 1 times [2018-10-23 18:54:47,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:47,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:47,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-23 18:54:47,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:47,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:48,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:48,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:48,003 INFO L87 Difference]: Start difference. First operand 328120 states and 362537 transitions. Second operand 3 states. [2018-10-23 18:54:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:51,878 INFO L93 Difference]: Finished difference Result 635793 states and 703466 transitions. [2018-10-23 18:54:51,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:51,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-10-23 18:54:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:52,331 INFO L225 Difference]: With dead ends: 635793 [2018-10-23 18:54:52,331 INFO L226 Difference]: Without dead ends: 307675 [2018-10-23 18:54:52,487 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-23 18:54:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307675 states. [2018-10-23 18:54:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307675 to 305791. [2018-10-23 18:54:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305791 states. [2018-10-23 18:54:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305791 states to 305791 states and 332074 transitions. [2018-10-23 18:54:58,037 INFO L78 Accepts]: Start accepts. Automaton has 305791 states and 332074 transitions. Word has length 383 [2018-10-23 18:54:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:58,037 INFO L481 AbstractCegarLoop]: Abstraction has 305791 states and 332074 transitions. [2018-10-23 18:54:58,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 305791 states and 332074 transitions. [2018-10-23 18:54:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-23 18:54:58,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:58,106 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:54:58,106 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:58,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash 611533469, now seen corresponding path program 1 times [2018-10-23 18:54:58,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:58,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:58,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:58,562 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-23 18:54:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-23 18:54:58,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:58,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 18:54:58,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:54:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:54:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:54:58,701 INFO L87 Difference]: Start difference. First operand 305791 states and 332074 transitions. Second operand 5 states. [2018-10-23 18:55:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:04,573 INFO L93 Difference]: Finished difference Result 675128 states and 733051 transitions. [2018-10-23 18:55:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:55:04,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 418 [2018-10-23 18:55:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:05,246 INFO L225 Difference]: With dead ends: 675128 [2018-10-23 18:55:05,246 INFO L226 Difference]: Without dead ends: 369339 [2018-10-23 18:55:05,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:55:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369339 states. [2018-10-23 18:55:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369339 to 324031. [2018-10-23 18:55:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324031 states. [2018-10-23 18:55:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324031 states to 324031 states and 353570 transitions. [2018-10-23 18:55:18,046 INFO L78 Accepts]: Start accepts. Automaton has 324031 states and 353570 transitions. Word has length 418 [2018-10-23 18:55:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:18,047 INFO L481 AbstractCegarLoop]: Abstraction has 324031 states and 353570 transitions. [2018-10-23 18:55:18,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:55:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 324031 states and 353570 transitions. [2018-10-23 18:55:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-23 18:55:18,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:18,117 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:55:18,118 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:18,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1047361035, now seen corresponding path program 1 times [2018-10-23 18:55:18,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:18,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:18,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-23 18:55:18,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:18,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:55:18,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:18,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:18,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:18,661 INFO L87 Difference]: Start difference. First operand 324031 states and 353570 transitions. Second operand 4 states. [2018-10-23 18:55:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:24,198 INFO L93 Difference]: Finished difference Result 794483 states and 864241 transitions. [2018-10-23 18:55:24,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:55:24,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 437 [2018-10-23 18:55:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:24,802 INFO L225 Difference]: With dead ends: 794483 [2018-10-23 18:55:24,802 INFO L226 Difference]: Without dead ends: 470454 [2018-10-23 18:55:24,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470454 states. [2018-10-23 18:55:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470454 to 394029. [2018-10-23 18:55:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394029 states. [2018-10-23 18:55:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394029 states to 394029 states and 427048 transitions. [2018-10-23 18:55:31,861 INFO L78 Accepts]: Start accepts. Automaton has 394029 states and 427048 transitions. Word has length 437 [2018-10-23 18:55:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:31,861 INFO L481 AbstractCegarLoop]: Abstraction has 394029 states and 427048 transitions. [2018-10-23 18:55:31,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:55:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 394029 states and 427048 transitions. [2018-10-23 18:55:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-10-23 18:55:31,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:31,936 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:55:31,936 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:31,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:31,937 INFO L82 PathProgramCache]: Analyzing trace with hash -291768363, now seen corresponding path program 1 times [2018-10-23 18:55:31,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:31,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:31,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:32,415 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:55:32,633 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 18:55:32,818 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-23 18:55:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-23 18:55:34,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:55:34,813 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:55:34,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:35,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:55:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-10-23 18:55:35,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:55:35,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-23 18:55:35,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 18:55:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 18:55:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:55:35,211 INFO L87 Difference]: Start difference. First operand 394029 states and 427048 transitions. Second operand 10 states. [2018-10-23 18:55:35,766 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 18:55:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:48,259 INFO L93 Difference]: Finished difference Result 914684 states and 991511 transitions. [2018-10-23 18:55:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-23 18:55:48,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 454 [2018-10-23 18:55:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:49,003 INFO L225 Difference]: With dead ends: 914684 [2018-10-23 18:55:49,004 INFO L226 Difference]: Without dead ends: 520657 [2018-10-23 18:55:49,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2018-10-23 18:55:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520657 states. [2018-10-23 18:55:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520657 to 489901. [2018-10-23 18:55:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489901 states. [2018-10-23 18:55:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489901 states to 489901 states and 529092 transitions. [2018-10-23 18:55:56,152 INFO L78 Accepts]: Start accepts. Automaton has 489901 states and 529092 transitions. Word has length 454 [2018-10-23 18:55:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:56,153 INFO L481 AbstractCegarLoop]: Abstraction has 489901 states and 529092 transitions. [2018-10-23 18:55:56,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 18:55:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 489901 states and 529092 transitions. [2018-10-23 18:56:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-10-23 18:56:03,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:03,151 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:56:03,151 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:03,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1550698709, now seen corresponding path program 1 times [2018-10-23 18:56:03,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:03,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:03,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:03,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:03,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-23 18:56:03,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:03,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:03,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:03,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:03,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:03,505 INFO L87 Difference]: Start difference. First operand 489901 states and 529092 transitions. Second operand 3 states. [2018-10-23 18:56:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:08,541 INFO L93 Difference]: Finished difference Result 1267466 states and 1365727 transitions. [2018-10-23 18:56:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:08,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 465 [2018-10-23 18:56:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:09,556 INFO L225 Difference]: With dead ends: 1267466 [2018-10-23 18:56:09,557 INFO L226 Difference]: Without dead ends: 777567 [2018-10-23 18:56:09,878 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-23 18:56:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777567 states. [2018-10-23 18:56:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777567 to 721230. [2018-10-23 18:56:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721230 states. [2018-10-23 18:56:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721230 states to 721230 states and 775648 transitions. [2018-10-23 18:56:23,026 INFO L78 Accepts]: Start accepts. Automaton has 721230 states and 775648 transitions. Word has length 465 [2018-10-23 18:56:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:23,026 INFO L481 AbstractCegarLoop]: Abstraction has 721230 states and 775648 transitions. [2018-10-23 18:56:23,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 721230 states and 775648 transitions. [2018-10-23 18:56:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-23 18:56:23,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:23,166 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:56:23,166 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:23,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash -48158721, now seen corresponding path program 1 times [2018-10-23 18:56:23,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:23,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:23,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-23 18:56:23,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:23,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:23,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:23,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:23,546 INFO L87 Difference]: Start difference. First operand 721230 states and 775648 transitions. Second operand 3 states. Received shutdown request... [2018-10-23 18:56:44,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:44,161 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:56:44,166 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:56:44,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:56:44 BoogieIcfgContainer [2018-10-23 18:56:44,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:56:44,168 INFO L168 Benchmark]: Toolchain (without parser) took 200152.59 ms. Allocated memory was 1.5 GB in the beginning and 6.7 GB in the end (delta: 5.2 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-23 18:56:44,169 INFO L168 Benchmark]: CDTParser took 0.24 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-23 18:56:44,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1223.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 298.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -868.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,171 INFO L168 Benchmark]: Boogie Preprocessor took 134.52 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-23 18:56:44,172 INFO L168 Benchmark]: RCFGBuilder took 5493.35 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: 258.9 MB). Peak memory consumption was 258.9 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,173 INFO L168 Benchmark]: TraceAbstraction took 192997.20 ms. Allocated memory was 2.3 GB in the beginning and 6.7 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.9 GB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,180 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1223.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 298.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -868.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.52 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 5493.35 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: 258.9 MB). Peak memory consumption was 258.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192997.20 ms. Allocated memory was 2.3 GB in the beginning and 6.7 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.9 GB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1620]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1620). Cancelled while BasicCegarLoop was constructing difference of abstraction (721230states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1650618 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.9s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 108.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6310 SDtfs, 14484 SDslu, 4314 SDs, 0 SdLazy, 27790 SolverSat, 5378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 1086 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=721230occurred 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: 65.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 296115 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 7308 NumberOfCodeBlocks, 7308 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 7285 ConstructedInterpolants, 0 QuantifiedInterpolants, 7345331 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1754 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 4306/4378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown