java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:30:11,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:30:11,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:30:11,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:30:11,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:30:11,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:30:11,171 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:30:11,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:30:11,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:30:11,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:30:11,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:30:11,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:30:11,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:30:11,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:30:11,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:30:11,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:30:11,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:30:11,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:30:11,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:30:11,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:30:11,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:30:11,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:30:11,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:30:11,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:30:11,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:30:11,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:30:11,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:30:11,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:30:11,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:30:11,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:30:11,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:30:11,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:30:11,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:30:11,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:30:11,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:30:11,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:30:11,201 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 01:30:11,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:30:11,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:30:11,220 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:30:11,220 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:30:11,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:30:11,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:30:11,221 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:30:11,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:30:11,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:30:11,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:30:11,222 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:30:11,222 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:30:11,222 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:30:11,222 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:30:11,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:30:11,223 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:30:11,223 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:30:11,223 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:30:11,223 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:30:11,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:30:11,224 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:30:11,224 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:30:11,224 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:30:11,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:30:11,224 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:30:11,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:30:11,225 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:30:11,225 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:30:11,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:30:11,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:30:11,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:30:11,312 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:30:11,313 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:30:11,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-07-24 01:30:11,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b97dba5/70245c5fefac4c1ebee25f66f1b319d5/FLAGe49b3bd93 [2018-07-24 01:30:12,076 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:30:12,079 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-07-24 01:30:12,106 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b97dba5/70245c5fefac4c1ebee25f66f1b319d5/FLAGe49b3bd93 [2018-07-24 01:30:12,129 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b97dba5/70245c5fefac4c1ebee25f66f1b319d5 [2018-07-24 01:30:12,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:30:12,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:30:12,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:30:12,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:30:12,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:30:12,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:30:12" (1/1) ... [2018-07-24 01:30:12,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e46634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:12, skipping insertion in model container [2018-07-24 01:30:12,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:30:12" (1/1) ... [2018-07-24 01:30:12,470 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:30:12,996 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:30:13,015 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:30:13,337 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:30:13,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13 WrapperNode [2018-07-24 01:30:13,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:30:13,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:30:13,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:30:13,456 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:30:13,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:30:13,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:30:13,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:30:13,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:30:13,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... [2018-07-24 01:30:13,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:30:13,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:30:13,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:30:13,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:30:14,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-07-24 01:30:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:30:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:30:14,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:30:19,645 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:30:19,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:30:19 BoogieIcfgContainer [2018-07-24 01:30:19,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:30:19,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:30:19,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:30:19,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:30:19,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:30:12" (1/3) ... [2018-07-24 01:30:19,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a01bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:30:19, skipping insertion in model container [2018-07-24 01:30:19,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:13" (2/3) ... [2018-07-24 01:30:19,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a01bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:30:19, skipping insertion in model container [2018-07-24 01:30:19,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:30:19" (3/3) ... [2018-07-24 01:30:19,655 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53_true-unreach-call.c [2018-07-24 01:30:19,665 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:30:19,675 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:30:19,729 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:30:19,730 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:30:19,730 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:30:19,731 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:30:19,731 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:30:19,731 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:30:19,731 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:30:19,731 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:30:19,732 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:30:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-07-24 01:30:19,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-24 01:30:19,778 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:19,780 INFO L353 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] [2018-07-24 01:30:19,780 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2009406410, now seen corresponding path program 1 times [2018-07-24 01:30:19,788 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:19,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:19,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:20,720 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-07-24 01:30:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:20,835 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:20,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:20,842 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:20,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:20,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:20,867 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-07-24 01:30:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:24,715 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-07-24 01:30:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:24,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-07-24 01:30:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:24,742 INFO L225 Difference]: With dead ends: 1089 [2018-07-24 01:30:24,742 INFO L226 Difference]: Without dead ends: 779 [2018-07-24 01:30:24,747 INFO L573 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-07-24 01:30:24,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-07-24 01:30:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-07-24 01:30:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-07-24 01:30:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-07-24 01:30:24,828 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 195 [2018-07-24 01:30:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:24,829 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-07-24 01:30:24,829 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-07-24 01:30:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-07-24 01:30:24,836 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:24,836 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 01:30:24,837 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash -907220423, now seen corresponding path program 1 times [2018-07-24 01:30:24,837 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:24,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:24,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:24,994 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:24,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:24,997 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:24,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:24,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:24,997 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 3 states. [2018-07-24 01:30:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:26,238 INFO L93 Difference]: Finished difference Result 1540 states and 2656 transitions. [2018-07-24 01:30:26,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:26,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-07-24 01:30:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:26,246 INFO L225 Difference]: With dead ends: 1540 [2018-07-24 01:30:26,247 INFO L226 Difference]: Without dead ends: 1027 [2018-07-24 01:30:26,254 INFO L573 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-07-24 01:30:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-07-24 01:30:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1025. [2018-07-24 01:30:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-07-24 01:30:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1764 transitions. [2018-07-24 01:30:26,330 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1764 transitions. Word has length 201 [2018-07-24 01:30:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:26,331 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1764 transitions. [2018-07-24 01:30:26,331 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1764 transitions. [2018-07-24 01:30:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-24 01:30:26,339 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:26,339 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:26,341 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:26,341 INFO L82 PathProgramCache]: Analyzing trace with hash 330620286, now seen corresponding path program 1 times [2018-07-24 01:30:26,342 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:26,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:26,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:26,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:26,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:26,485 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:26,485 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:26,485 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:26,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:26,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:26,488 INFO L87 Difference]: Start difference. First operand 1025 states and 1764 transitions. Second operand 3 states. [2018-07-24 01:30:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:29,812 INFO L93 Difference]: Finished difference Result 2950 states and 5148 transitions. [2018-07-24 01:30:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:29,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-07-24 01:30:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:29,824 INFO L225 Difference]: With dead ends: 2950 [2018-07-24 01:30:29,824 INFO L226 Difference]: Without dead ends: 1927 [2018-07-24 01:30:29,827 INFO L573 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-07-24 01:30:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2018-07-24 01:30:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1923. [2018-07-24 01:30:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2018-07-24 01:30:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 3088 transitions. [2018-07-24 01:30:29,875 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 3088 transitions. Word has length 202 [2018-07-24 01:30:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:29,875 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 3088 transitions. [2018-07-24 01:30:29,876 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 3088 transitions. [2018-07-24 01:30:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-24 01:30:29,882 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:29,882 INFO L353 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] [2018-07-24 01:30:29,882 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:29,882 INFO L82 PathProgramCache]: Analyzing trace with hash -400117653, now seen corresponding path program 1 times [2018-07-24 01:30:29,883 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:29,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:29,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:29,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:29,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:29,991 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:29,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:29,992 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:29,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:29,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:29,993 INFO L87 Difference]: Start difference. First operand 1923 states and 3088 transitions. Second operand 3 states. [2018-07-24 01:30:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:31,734 INFO L93 Difference]: Finished difference Result 5508 states and 8996 transitions. [2018-07-24 01:30:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:31,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-07-24 01:30:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:31,754 INFO L225 Difference]: With dead ends: 5508 [2018-07-24 01:30:31,755 INFO L226 Difference]: Without dead ends: 3587 [2018-07-24 01:30:31,759 INFO L573 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-07-24 01:30:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2018-07-24 01:30:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3555. [2018-07-24 01:30:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3555 states. [2018-07-24 01:30:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 5618 transitions. [2018-07-24 01:30:31,864 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 5618 transitions. Word has length 204 [2018-07-24 01:30:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:31,865 INFO L471 AbstractCegarLoop]: Abstraction has 3555 states and 5618 transitions. [2018-07-24 01:30:31,865 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 5618 transitions. [2018-07-24 01:30:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-24 01:30:31,876 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:31,876 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 01:30:31,876 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:31,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1444628378, now seen corresponding path program 1 times [2018-07-24 01:30:31,877 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:31,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:31,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:31,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:32,257 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:32,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:32,258 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:32,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:32,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:32,259 INFO L87 Difference]: Start difference. First operand 3555 states and 5618 transitions. Second operand 4 states. [2018-07-24 01:30:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:35,427 INFO L93 Difference]: Finished difference Result 13756 states and 21949 transitions. [2018-07-24 01:30:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:35,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-07-24 01:30:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:35,477 INFO L225 Difference]: With dead ends: 13756 [2018-07-24 01:30:35,477 INFO L226 Difference]: Without dead ends: 10203 [2018-07-24 01:30:35,485 INFO L573 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-07-24 01:30:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2018-07-24 01:30:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 6829. [2018-07-24 01:30:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6829 states. [2018-07-24 01:30:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6829 states to 6829 states and 10214 transitions. [2018-07-24 01:30:35,658 INFO L78 Accepts]: Start accepts. Automaton has 6829 states and 10214 transitions. Word has length 219 [2018-07-24 01:30:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:35,659 INFO L471 AbstractCegarLoop]: Abstraction has 6829 states and 10214 transitions. [2018-07-24 01:30:35,659 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 6829 states and 10214 transitions. [2018-07-24 01:30:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-07-24 01:30:35,677 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:35,677 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 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] [2018-07-24 01:30:35,678 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash -167349344, now seen corresponding path program 1 times [2018-07-24 01:30:35,678 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:35,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:35,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:35,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:35,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-07-24 01:30:35,858 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:35,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:35,859 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:35,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:35,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:35,859 INFO L87 Difference]: Start difference. First operand 6829 states and 10214 transitions. Second operand 3 states. [2018-07-24 01:30:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:38,788 INFO L93 Difference]: Finished difference Result 16939 states and 25201 transitions. [2018-07-24 01:30:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:38,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-07-24 01:30:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:38,831 INFO L225 Difference]: With dead ends: 16939 [2018-07-24 01:30:38,831 INFO L226 Difference]: Without dead ends: 10112 [2018-07-24 01:30:38,842 INFO L573 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-07-24 01:30:38,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2018-07-24 01:30:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 10110. [2018-07-24 01:30:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10110 states. [2018-07-24 01:30:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10110 states to 10110 states and 14797 transitions. [2018-07-24 01:30:39,079 INFO L78 Accepts]: Start accepts. Automaton has 10110 states and 14797 transitions. Word has length 229 [2018-07-24 01:30:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:39,079 INFO L471 AbstractCegarLoop]: Abstraction has 10110 states and 14797 transitions. [2018-07-24 01:30:39,079 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 10110 states and 14797 transitions. [2018-07-24 01:30:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-24 01:30:39,102 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:39,103 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:39,103 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:39,103 INFO L82 PathProgramCache]: Analyzing trace with hash -626143831, now seen corresponding path program 1 times [2018-07-24 01:30:39,103 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:39,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:39,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:39,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:39,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:30:39,523 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:39,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:30:39,524 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:39,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:39,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:39,525 INFO L87 Difference]: Start difference. First operand 10110 states and 14797 transitions. Second operand 4 states. [2018-07-24 01:30:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:42,512 INFO L93 Difference]: Finished difference Result 37768 states and 55510 transitions. [2018-07-24 01:30:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:42,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-07-24 01:30:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:42,582 INFO L225 Difference]: With dead ends: 37768 [2018-07-24 01:30:42,582 INFO L226 Difference]: Without dead ends: 27660 [2018-07-24 01:30:42,601 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27660 states. [2018-07-24 01:30:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27660 to 27654. [2018-07-24 01:30:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27654 states. [2018-07-24 01:30:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 35517 transitions. [2018-07-24 01:30:43,041 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 35517 transitions. Word has length 232 [2018-07-24 01:30:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:43,042 INFO L471 AbstractCegarLoop]: Abstraction has 27654 states and 35517 transitions. [2018-07-24 01:30:43,042 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 35517 transitions. [2018-07-24 01:30:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-24 01:30:43,098 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:43,098 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 01:30:43,098 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash -48503042, now seen corresponding path program 1 times [2018-07-24 01:30:43,099 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:43,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:43,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:43,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:43,698 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:43,698 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:43,698 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:43,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:43,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:43,699 INFO L87 Difference]: Start difference. First operand 27654 states and 35517 transitions. Second operand 4 states. [2018-07-24 01:30:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:46,502 INFO L93 Difference]: Finished difference Result 74525 states and 93744 transitions. [2018-07-24 01:30:46,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:46,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-07-24 01:30:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:46,598 INFO L225 Difference]: With dead ends: 74525 [2018-07-24 01:30:46,598 INFO L226 Difference]: Without dead ends: 46873 [2018-07-24 01:30:46,625 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46873 states. [2018-07-24 01:30:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46873 to 46845. [2018-07-24 01:30:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46845 states. [2018-07-24 01:30:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46845 states to 46845 states and 57879 transitions. [2018-07-24 01:30:47,258 INFO L78 Accepts]: Start accepts. Automaton has 46845 states and 57879 transitions. Word has length 270 [2018-07-24 01:30:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:47,258 INFO L471 AbstractCegarLoop]: Abstraction has 46845 states and 57879 transitions. [2018-07-24 01:30:47,258 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 46845 states and 57879 transitions. [2018-07-24 01:30:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-24 01:30:47,325 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:47,326 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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-07-24 01:30:47,326 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash 6766612, now seen corresponding path program 1 times [2018-07-24 01:30:47,327 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:47,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:47,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:47,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-07-24 01:30:47,501 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:47,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:47,503 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:47,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:47,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:47,504 INFO L87 Difference]: Start difference. First operand 46845 states and 57879 transitions. Second operand 3 states. [2018-07-24 01:30:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:48,858 INFO L93 Difference]: Finished difference Result 91542 states and 112705 transitions. [2018-07-24 01:30:48,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:48,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2018-07-24 01:30:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:48,943 INFO L225 Difference]: With dead ends: 91542 [2018-07-24 01:30:48,943 INFO L226 Difference]: Without dead ends: 44699 [2018-07-24 01:30:48,980 INFO L573 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-07-24 01:30:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44699 states. [2018-07-24 01:30:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44699 to 44699. [2018-07-24 01:30:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44699 states. [2018-07-24 01:30:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44699 states to 44699 states and 54075 transitions. [2018-07-24 01:30:49,542 INFO L78 Accepts]: Start accepts. Automaton has 44699 states and 54075 transitions. Word has length 276 [2018-07-24 01:30:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 44699 states and 54075 transitions. [2018-07-24 01:30:49,542 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 44699 states and 54075 transitions. [2018-07-24 01:30:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-24 01:30:49,579 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:49,580 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 01:30:49,580 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1036844217, now seen corresponding path program 1 times [2018-07-24 01:30:49,580 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:49,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:49,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:49,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:50,182 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:50,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:50,183 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:50,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:50,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:50,184 INFO L87 Difference]: Start difference. First operand 44699 states and 54075 transitions. Second operand 3 states. [2018-07-24 01:30:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:51,950 INFO L93 Difference]: Finished difference Result 89398 states and 108152 transitions. [2018-07-24 01:30:51,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:51,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-07-24 01:30:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:52,015 INFO L225 Difference]: With dead ends: 89398 [2018-07-24 01:30:52,016 INFO L226 Difference]: Without dead ends: 44701 [2018-07-24 01:30:52,052 INFO L573 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-07-24 01:30:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44701 states. [2018-07-24 01:30:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44701 to 44699. [2018-07-24 01:30:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44699 states. [2018-07-24 01:30:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44699 states to 44699 states and 51890 transitions. [2018-07-24 01:30:52,646 INFO L78 Accepts]: Start accepts. Automaton has 44699 states and 51890 transitions. Word has length 312 [2018-07-24 01:30:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:52,646 INFO L471 AbstractCegarLoop]: Abstraction has 44699 states and 51890 transitions. [2018-07-24 01:30:52,646 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 44699 states and 51890 transitions. [2018-07-24 01:30:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-07-24 01:30:52,684 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:52,684 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 01:30:52,684 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash 370758085, now seen corresponding path program 1 times [2018-07-24 01:30:52,685 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:52,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:52,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 01:30:52,917 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:52,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:52,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:52,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:52,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:52,919 INFO L87 Difference]: Start difference. First operand 44699 states and 51890 transitions. Second operand 3 states. [2018-07-24 01:30:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:55,815 INFO L93 Difference]: Finished difference Result 83553 states and 96956 transitions. [2018-07-24 01:30:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:56,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2018-07-24 01:30:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:56,259 INFO L225 Difference]: With dead ends: 83553 [2018-07-24 01:30:56,260 INFO L226 Difference]: Without dead ends: 38856 [2018-07-24 01:30:56,283 INFO L573 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-07-24 01:30:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38856 states. [2018-07-24 01:30:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38856 to 38848. [2018-07-24 01:30:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38848 states. [2018-07-24 01:30:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38848 states to 38848 states and 43770 transitions. [2018-07-24 01:30:56,660 INFO L78 Accepts]: Start accepts. Automaton has 38848 states and 43770 transitions. Word has length 319 [2018-07-24 01:30:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:56,660 INFO L471 AbstractCegarLoop]: Abstraction has 38848 states and 43770 transitions. [2018-07-24 01:30:56,660 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 38848 states and 43770 transitions. [2018-07-24 01:30:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-07-24 01:30:56,689 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:56,690 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 01:30:56,690 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash -539370600, now seen corresponding path program 1 times [2018-07-24 01:30:56,691 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-07-24 01:30:56,948 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:56,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:56,949 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:56,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:56,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:56,950 INFO L87 Difference]: Start difference. First operand 38848 states and 43770 transitions. Second operand 3 states. [2018-07-24 01:30:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:58,044 INFO L93 Difference]: Finished difference Result 76253 states and 85972 transitions. [2018-07-24 01:30:58,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:58,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2018-07-24 01:30:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:58,083 INFO L225 Difference]: With dead ends: 76253 [2018-07-24 01:30:58,084 INFO L226 Difference]: Without dead ends: 38844 [2018-07-24 01:30:58,106 INFO L573 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-07-24 01:30:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38844 states. [2018-07-24 01:30:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38844 to 38842. [2018-07-24 01:30:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38842 states. [2018-07-24 01:30:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38842 states to 38842 states and 43760 transitions. [2018-07-24 01:30:58,453 INFO L78 Accepts]: Start accepts. Automaton has 38842 states and 43760 transitions. Word has length 326 [2018-07-24 01:30:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:58,454 INFO L471 AbstractCegarLoop]: Abstraction has 38842 states and 43760 transitions. [2018-07-24 01:30:58,454 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 38842 states and 43760 transitions. [2018-07-24 01:30:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-07-24 01:30:58,478 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:58,479 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 01:30:58,479 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash -113672616, now seen corresponding path program 1 times [2018-07-24 01:30:58,479 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:58,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:58,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:58,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:58,769 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-07-24 01:30:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-07-24 01:30:58,846 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:58,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:30:58,847 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:58,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:58,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:58,847 INFO L87 Difference]: Start difference. First operand 38842 states and 43760 transitions. Second operand 4 states. [2018-07-24 01:31:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:02,070 INFO L93 Difference]: Finished difference Result 135756 states and 152529 transitions. [2018-07-24 01:31:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:31:02,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 341 [2018-07-24 01:31:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:02,656 INFO L225 Difference]: With dead ends: 135756 [2018-07-24 01:31:02,656 INFO L226 Difference]: Without dead ends: 96916 [2018-07-24 01:31:02,687 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96916 states. [2018-07-24 01:31:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96916 to 66178. [2018-07-24 01:31:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66178 states. [2018-07-24 01:31:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66178 states to 66178 states and 72977 transitions. [2018-07-24 01:31:03,424 INFO L78 Accepts]: Start accepts. Automaton has 66178 states and 72977 transitions. Word has length 341 [2018-07-24 01:31:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:03,425 INFO L471 AbstractCegarLoop]: Abstraction has 66178 states and 72977 transitions. [2018-07-24 01:31:03,425 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:31:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 66178 states and 72977 transitions. [2018-07-24 01:31:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-07-24 01:31:03,453 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:03,453 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 01:31:03,453 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -71967826, now seen corresponding path program 1 times [2018-07-24 01:31:03,454 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:03,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:03,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-07-24 01:31:03,803 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:03,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:31:03,804 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:31:03,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:31:03,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:03,805 INFO L87 Difference]: Start difference. First operand 66178 states and 72977 transitions. Second operand 4 states. [2018-07-24 01:31:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:06,194 INFO L93 Difference]: Finished difference Result 135236 states and 149012 transitions. [2018-07-24 01:31:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:31:06,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-07-24 01:31:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:06,268 INFO L225 Difference]: With dead ends: 135236 [2018-07-24 01:31:06,268 INFO L226 Difference]: Without dead ends: 69060 [2018-07-24 01:31:06,302 INFO L573 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-07-24 01:31:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69060 states. [2018-07-24 01:31:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69060 to 69034. [2018-07-24 01:31:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69034 states. [2018-07-24 01:31:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69034 states to 69034 states and 75238 transitions. [2018-07-24 01:31:07,568 INFO L78 Accepts]: Start accepts. Automaton has 69034 states and 75238 transitions. Word has length 342 [2018-07-24 01:31:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:07,568 INFO L471 AbstractCegarLoop]: Abstraction has 69034 states and 75238 transitions. [2018-07-24 01:31:07,568 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:31:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 69034 states and 75238 transitions. [2018-07-24 01:31:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-07-24 01:31:07,602 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:07,602 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-07-24 01:31:07,602 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:07,603 INFO L82 PathProgramCache]: Analyzing trace with hash 827161351, now seen corresponding path program 1 times [2018-07-24 01:31:07,603 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:07,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:07,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:07,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:07,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:31:07,871 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:07,871 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:31:07,872 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:31:07,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:31:07,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:31:07,872 INFO L87 Difference]: Start difference. First operand 69034 states and 75238 transitions. Second operand 3 states. [2018-07-24 01:31:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:09,481 INFO L93 Difference]: Finished difference Result 132548 states and 144613 transitions. [2018-07-24 01:31:09,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:31:09,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2018-07-24 01:31:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:09,551 INFO L225 Difference]: With dead ends: 132548 [2018-07-24 01:31:09,552 INFO L226 Difference]: Without dead ends: 63516 [2018-07-24 01:31:09,590 INFO L573 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-07-24 01:31:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63516 states. [2018-07-24 01:31:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63516 to 63507. [2018-07-24 01:31:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63507 states. [2018-07-24 01:31:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63507 states to 63507 states and 68328 transitions. [2018-07-24 01:31:10,196 INFO L78 Accepts]: Start accepts. Automaton has 63507 states and 68328 transitions. Word has length 354 [2018-07-24 01:31:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:10,197 INFO L471 AbstractCegarLoop]: Abstraction has 63507 states and 68328 transitions. [2018-07-24 01:31:10,197 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:31:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 63507 states and 68328 transitions. [2018-07-24 01:31:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-07-24 01:31:10,225 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:10,225 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 01:31:10,225 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2132933612, now seen corresponding path program 1 times [2018-07-24 01:31:10,226 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:10,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:10,568 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 01:31:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-07-24 01:31:10,738 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:31:10,738 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-07-24 01:31:10,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:11,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:31:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-07-24 01:31:11,294 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:31:11,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-24 01:31:11,295 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 01:31:11,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 01:31:11,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:31:11,296 INFO L87 Difference]: Start difference. First operand 63507 states and 68328 transitions. Second operand 6 states. [2018-07-24 01:31:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:21,305 INFO L93 Difference]: Finished difference Result 207275 states and 222902 transitions. [2018-07-24 01:31:21,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 01:31:21,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 356 [2018-07-24 01:31:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:21,491 INFO L225 Difference]: With dead ends: 207275 [2018-07-24 01:31:21,492 INFO L226 Difference]: Without dead ends: 145201 [2018-07-24 01:31:21,550 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-07-24 01:31:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145201 states. [2018-07-24 01:31:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145201 to 138443. [2018-07-24 01:31:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138443 states. [2018-07-24 01:31:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138443 states to 138443 states and 147686 transitions. [2018-07-24 01:31:23,698 INFO L78 Accepts]: Start accepts. Automaton has 138443 states and 147686 transitions. Word has length 356 [2018-07-24 01:31:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:23,699 INFO L471 AbstractCegarLoop]: Abstraction has 138443 states and 147686 transitions. [2018-07-24 01:31:23,699 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 01:31:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 138443 states and 147686 transitions. [2018-07-24 01:31:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-07-24 01:31:23,809 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:23,809 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 01:31:23,810 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:23,810 INFO L82 PathProgramCache]: Analyzing trace with hash 943914178, now seen corresponding path program 1 times [2018-07-24 01:31:23,810 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:23,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:23,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:23,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:23,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-07-24 01:31:24,426 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:24,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:31:24,427 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:31:24,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:31:24,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:24,427 INFO L87 Difference]: Start difference. First operand 138443 states and 147686 transitions. Second operand 4 states. [2018-07-24 01:31:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:29,184 INFO L93 Difference]: Finished difference Result 394650 states and 420935 transitions. [2018-07-24 01:31:29,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:31:29,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 452 [2018-07-24 01:31:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:29,518 INFO L225 Difference]: With dead ends: 394650 [2018-07-24 01:31:29,518 INFO L226 Difference]: Without dead ends: 257640 [2018-07-24 01:31:29,626 INFO L573 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-07-24 01:31:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257640 states. [2018-07-24 01:31:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257640 to 257634. [2018-07-24 01:31:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257634 states. [2018-07-24 01:31:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257634 states to 257634 states and 274549 transitions. [2018-07-24 01:31:33,281 INFO L78 Accepts]: Start accepts. Automaton has 257634 states and 274549 transitions. Word has length 452 [2018-07-24 01:31:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 257634 states and 274549 transitions. [2018-07-24 01:31:33,281 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:31:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 257634 states and 274549 transitions. [2018-07-24 01:31:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-07-24 01:31:33,346 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:33,346 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-07-24 01:31:33,347 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash -829229176, now seen corresponding path program 1 times [2018-07-24 01:31:33,347 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:33,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:33,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:33,881 WARN L169 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-07-24 01:31:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-07-24 01:31:34,049 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:34,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:31:34,051 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:31:34,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:31:34,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:31:34,051 INFO L87 Difference]: Start difference. First operand 257634 states and 274549 transitions. Second operand 5 states. [2018-07-24 01:31:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:41,064 INFO L93 Difference]: Finished difference Result 616907 states and 658260 transitions. [2018-07-24 01:31:41,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:31:41,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 483 [2018-07-24 01:31:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:41,521 INFO L225 Difference]: With dead ends: 616907 [2018-07-24 01:31:41,521 INFO L226 Difference]: Without dead ends: 359275 [2018-07-24 01:31:41,655 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:31:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359275 states. [2018-07-24 01:31:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359275 to 350604. [2018-07-24 01:31:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350604 states. [2018-07-24 01:31:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350604 states to 350604 states and 372946 transitions. [2018-07-24 01:31:52,774 INFO L78 Accepts]: Start accepts. Automaton has 350604 states and 372946 transitions. Word has length 483 [2018-07-24 01:31:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:52,774 INFO L471 AbstractCegarLoop]: Abstraction has 350604 states and 372946 transitions. [2018-07-24 01:31:52,774 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:31:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 350604 states and 372946 transitions. [2018-07-24 01:31:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-07-24 01:31:52,847 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:52,848 INFO L353 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, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-07-24 01:31:52,848 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash -704537317, now seen corresponding path program 1 times [2018-07-24 01:31:52,848 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:52,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:52,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:52,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:52,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-07-24 01:31:53,236 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:53,237 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:31:53,237 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:31:53,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:31:53,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:53,238 INFO L87 Difference]: Start difference. First operand 350604 states and 372946 transitions. Second operand 4 states. [2018-07-24 01:31:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:58,305 INFO L93 Difference]: Finished difference Result 964352 states and 1025174 transitions. [2018-07-24 01:31:58,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:31:58,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 502 [2018-07-24 01:31:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:59,134 INFO L225 Difference]: With dead ends: 964352 [2018-07-24 01:31:59,134 INFO L226 Difference]: Without dead ends: 607186 [2018-07-24 01:31:59,362 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607186 states. [2018-07-24 01:32:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607186 to 482366. [2018-07-24 01:32:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482366 states. [2018-07-24 01:32:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482366 states to 482366 states and 511169 transitions. [2018-07-24 01:32:08,487 INFO L78 Accepts]: Start accepts. Automaton has 482366 states and 511169 transitions. Word has length 502 [2018-07-24 01:32:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:32:08,488 INFO L471 AbstractCegarLoop]: Abstraction has 482366 states and 511169 transitions. [2018-07-24 01:32:08,488 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:32:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 482366 states and 511169 transitions. [2018-07-24 01:32:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-07-24 01:32:08,590 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:32:08,591 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 01:32:08,591 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:32:08,591 INFO L82 PathProgramCache]: Analyzing trace with hash -882507049, now seen corresponding path program 1 times [2018-07-24 01:32:08,591 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:32:08,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:32:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:08,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:32:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:32:09,094 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 01:32:09,299 WARN L169 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 01:32:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 430 proven. 33 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-07-24 01:32:11,264 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:32:11,264 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-07-24 01:32:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:32:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:32:11,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:32:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 396 proven. 90 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-07-24 01:32:11,969 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 01:32:11,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-07-24 01:32:11,971 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 01:32:11,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 01:32:11,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-07-24 01:32:11,972 INFO L87 Difference]: Start difference. First operand 482366 states and 511169 transitions. Second operand 12 states. [2018-07-24 01:32:12,877 WARN L169 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-07-24 01:32:21,237 WARN L169 SmtUtils]: Spent 3.88 s on a formula simplification that was a NOOP. DAG size: 30 [2018-07-24 01:32:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:32:52,764 INFO L93 Difference]: Finished difference Result 3398526 states and 3593152 transitions. [2018-07-24 01:32:52,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-24 01:32:52,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 504 [2018-07-24 01:32:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:32:57,980 INFO L225 Difference]: With dead ends: 3398526 [2018-07-24 01:32:57,980 INFO L226 Difference]: Without dead ends: 2849242 [2018-07-24 01:32:58,459 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 502 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2018-07-24 01:33:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849242 states. Received shutdown request... [2018-07-24 01:33:32,385 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 01:33:32,389 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 01:33:32,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:33:32 BoogieIcfgContainer [2018-07-24 01:33:32,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:33:32,391 INFO L168 Benchmark]: Toolchain (without parser) took 200248.51 ms. Allocated memory was 1.5 GB in the beginning and 7.4 GB in the end (delta: 5.8 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.6 GB. Max. memory is 7.1 GB. [2018-07-24 01:33:32,393 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:33:32,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1306.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:32,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:32,396 INFO L168 Benchmark]: Boogie Preprocessor took 373.53 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 817.9 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -952.0 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:32,397 INFO L168 Benchmark]: RCFGBuilder took 5648.42 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 280.2 MB). Peak memory consumption was 280.2 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:32,398 INFO L168 Benchmark]: TraceAbstraction took 192742.35 ms. Allocated memory was 2.4 GB in the beginning and 7.4 GB in the end (delta: 5.0 GB). Free memory was 2.0 GB in the beginning and 3.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. [2018-07-24 01:33:32,403 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1306.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 168.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 373.53 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 817.9 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -952.0 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5648.42 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 280.2 MB). Peak memory consumption was 280.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192742.35 ms. Allocated memory was 2.4 GB in the beginning and 7.4 GB in the end (delta: 5.0 GB). Free memory was 2.0 GB in the beginning and 3.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1617]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1617). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.6s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 114.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5166 SDtfs, 20816 SDslu, 3831 SDs, 0 SdLazy, 25009 SolverSat, 5276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 968 GetRequests, 885 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482366occurred 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: 66.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 174752 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 7179 NumberOfCodeBlocks, 7179 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7157 ConstructedInterpolants, 0 QuantifiedInterpolants, 6137459 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1546 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 5068/5195 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label53_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-33-32-418.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label53_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-33-32-418.csv Completed graceful shutdown