java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label06_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:52:31,997 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:52:31,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:52:32,011 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:52:32,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:52:32,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:52:32,013 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:52:32,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:52:32,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:52:32,017 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:52:32,018 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:52:32,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:52:32,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:52:32,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:52:32,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:52:32,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:52:32,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:52:32,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:52:32,027 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:52:32,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:52:32,030 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:52:32,031 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:52:32,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:52:32,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:52:32,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:52:32,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:52:32,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:52:32,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:52:32,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:52:32,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:52:32,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:52:32,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:52:32,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:52:32,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:52:32,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:52:32,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:52:32,042 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-11-06 19:52:32,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:52:32,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:52:32,058 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:52:32,058 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:52:32,059 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:52:32,059 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:52:32,059 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:52:32,059 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:52:32,060 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:52:32,060 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:52:32,060 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:52:32,060 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:52:32,060 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:52:32,061 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:52:32,061 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:52:32,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:52:32,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:52:32,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:52:32,062 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:52:32,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:32,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:52:32,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:52:32,062 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:52:32,062 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:52:32,063 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:52:32,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:52:32,063 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:52:32,063 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:52:32,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:52:32,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:52:32,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:52:32,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:52:32,124 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:52:32,125 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label06_true-unreach-call.c [2018-11-06 19:52:32,182 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4136987/f53a59464d4a4fe8ac838f714ec7848b/FLAG6891a8012 [2018-11-06 19:52:32,817 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:52:32,817 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label06_true-unreach-call.c [2018-11-06 19:52:32,834 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4136987/f53a59464d4a4fe8ac838f714ec7848b/FLAG6891a8012 [2018-11-06 19:52:32,852 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4136987/f53a59464d4a4fe8ac838f714ec7848b [2018-11-06 19:52:32,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:52:32,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:52:32,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:32,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:52:32,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:52:32,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:32" (1/1) ... [2018-11-06 19:52:32,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e912aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:32, skipping insertion in model container [2018-11-06 19:52:32,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:32" (1/1) ... [2018-11-06 19:52:32,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:52:32,987 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:52:33,691 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:33,696 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:52:33,919 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:33,942 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:52:33,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33 WrapperNode [2018-11-06 19:52:33,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:33,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:33,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:52:33,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:52:33,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:34,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:52:34,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:52:34,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:52:34,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (1/1) ... [2018-11-06 19:52:34,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:52:34,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:52:34,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:52:34,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:52:34,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (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-11-06 19:52:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:52:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:52:34,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:52:40,075 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:52:40,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:40 BoogieIcfgContainer [2018-11-06 19:52:40,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:52:40,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:52:40,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:52:40,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:52:40,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:52:32" (1/3) ... [2018-11-06 19:52:40,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33303176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:40, skipping insertion in model container [2018-11-06 19:52:40,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:33" (2/3) ... [2018-11-06 19:52:40,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33303176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:40, skipping insertion in model container [2018-11-06 19:52:40,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:40" (3/3) ... [2018-11-06 19:52:40,085 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label06_true-unreach-call.c [2018-11-06 19:52:40,096 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:52:40,106 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:52:40,124 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:52:40,163 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:52:40,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:52:40,164 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:52:40,164 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:52:40,164 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:52:40,164 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:52:40,165 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:52:40,165 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:52:40,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:52:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:52:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-06 19:52:40,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:40,212 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:40,214 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:40,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash -696038692, now seen corresponding path program 1 times [2018-11-06 19:52:40,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:40,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:40,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:40,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:40,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:41,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:41,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:41,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:41,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:41,208 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:52:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:44,778 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-11-06 19:52:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:44,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-11-06 19:52:44,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:44,804 INFO L225 Difference]: With dead ends: 1027 [2018-11-06 19:52:44,805 INFO L226 Difference]: Without dead ends: 717 [2018-11-06 19:52:44,810 INFO L604 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-11-06 19:52:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-11-06 19:52:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-11-06 19:52:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-06 19:52:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-11-06 19:52:44,910 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 170 [2018-11-06 19:52:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:44,911 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-11-06 19:52:44,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-11-06 19:52:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-06 19:52:44,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:44,918 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:44,919 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:44,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1090071323, now seen corresponding path program 1 times [2018-11-06 19:52:44,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:44,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:44,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:45,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:45,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:45,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:45,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:45,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:45,065 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-11-06 19:52:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:46,701 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-11-06 19:52:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:46,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2018-11-06 19:52:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:46,711 INFO L225 Difference]: With dead ends: 2058 [2018-11-06 19:52:46,711 INFO L226 Difference]: Without dead ends: 1345 [2018-11-06 19:52:46,714 INFO L604 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-11-06 19:52:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-11-06 19:52:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-11-06 19:52:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-11-06 19:52:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-11-06 19:52:46,761 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 179 [2018-11-06 19:52:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:46,762 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-11-06 19:52:46,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-11-06 19:52:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-06 19:52:46,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:46,766 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:46,767 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:46,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:46,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1031939488, now seen corresponding path program 1 times [2018-11-06 19:52:46,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:46,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:46,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:52:46,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:46,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:46,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:46,918 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-11-06 19:52:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:49,361 INFO L93 Difference]: Finished difference Result 3977 states and 6209 transitions. [2018-11-06 19:52:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:49,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-11-06 19:52:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:49,377 INFO L225 Difference]: With dead ends: 3977 [2018-11-06 19:52:49,377 INFO L226 Difference]: Without dead ends: 2648 [2018-11-06 19:52:49,380 INFO L604 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-11-06 19:52:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-11-06 19:52:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2645. [2018-11-06 19:52:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-11-06 19:52:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4120 transitions. [2018-11-06 19:52:49,455 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4120 transitions. Word has length 193 [2018-11-06 19:52:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:49,455 INFO L480 AbstractCegarLoop]: Abstraction has 2645 states and 4120 transitions. [2018-11-06 19:52:49,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4120 transitions. [2018-11-06 19:52:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-06 19:52:49,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:49,464 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:49,464 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:49,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 133312332, now seen corresponding path program 1 times [2018-11-06 19:52:49,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:49,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:49,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:49,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:49,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:52:49,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:49,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:49,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:49,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:49,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:49,685 INFO L87 Difference]: Start difference. First operand 2645 states and 4120 transitions. Second operand 3 states. [2018-11-06 19:52:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:50,605 INFO L93 Difference]: Finished difference Result 5250 states and 8186 transitions. [2018-11-06 19:52:50,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:50,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-11-06 19:52:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:50,618 INFO L225 Difference]: With dead ends: 5250 [2018-11-06 19:52:50,619 INFO L226 Difference]: Without dead ends: 2607 [2018-11-06 19:52:50,623 INFO L604 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-11-06 19:52:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2018-11-06 19:52:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2607. [2018-11-06 19:52:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2018-11-06 19:52:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3992 transitions. [2018-11-06 19:52:50,677 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3992 transitions. Word has length 201 [2018-11-06 19:52:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:50,677 INFO L480 AbstractCegarLoop]: Abstraction has 2607 states and 3992 transitions. [2018-11-06 19:52:50,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3992 transitions. [2018-11-06 19:52:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-06 19:52:50,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:50,683 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:52:50,683 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:50,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:50,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1347645992, now seen corresponding path program 1 times [2018-11-06 19:52:50,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:50,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:50,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:50,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:50,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:51,201 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:52:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:51,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:51,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:52:51,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:52:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:52:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:52:51,268 INFO L87 Difference]: Start difference. First operand 2607 states and 3992 transitions. Second operand 5 states. [2018-11-06 19:52:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:55,371 INFO L93 Difference]: Finished difference Result 6279 states and 9778 transitions. [2018-11-06 19:52:55,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:52:55,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2018-11-06 19:52:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:55,390 INFO L225 Difference]: With dead ends: 6279 [2018-11-06 19:52:55,391 INFO L226 Difference]: Without dead ends: 3674 [2018-11-06 19:52:55,395 INFO L604 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-11-06 19:52:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2018-11-06 19:52:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3015. [2018-11-06 19:52:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2018-11-06 19:52:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 4612 transitions. [2018-11-06 19:52:55,457 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 4612 transitions. Word has length 210 [2018-11-06 19:52:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:55,457 INFO L480 AbstractCegarLoop]: Abstraction has 3015 states and 4612 transitions. [2018-11-06 19:52:55,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:52:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 4612 transitions. [2018-11-06 19:52:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-06 19:52:55,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:55,464 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:52:55,465 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:55,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1621362332, now seen corresponding path program 1 times [2018-11-06 19:52:55,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:55,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:55,753 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:52:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-06 19:52:55,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:52:55,811 INFO L225 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-11-06 19:52:55,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:55,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:52:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-06 19:52:56,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:52:56,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-11-06 19:52:56,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:56,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:56,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:56,095 INFO L87 Difference]: Start difference. First operand 3015 states and 4612 transitions. Second operand 4 states. [2018-11-06 19:52:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:59,646 INFO L93 Difference]: Finished difference Result 12048 states and 18435 transitions. [2018-11-06 19:52:59,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:59,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2018-11-06 19:52:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:59,691 INFO L225 Difference]: With dead ends: 12048 [2018-11-06 19:52:59,691 INFO L226 Difference]: Without dead ends: 9035 [2018-11-06 19:52:59,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 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-11-06 19:52:59,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states. [2018-11-06 19:52:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9035 to 6022. [2018-11-06 19:52:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2018-11-06 19:52:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 9192 transitions. [2018-11-06 19:52:59,848 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 9192 transitions. Word has length 246 [2018-11-06 19:52:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:59,848 INFO L480 AbstractCegarLoop]: Abstraction has 6022 states and 9192 transitions. [2018-11-06 19:52:59,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 9192 transitions. [2018-11-06 19:52:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-06 19:52:59,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:59,858 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:52:59,858 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:59,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1056061885, now seen corresponding path program 1 times [2018-11-06 19:52:59,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:59,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:59,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:59,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:00,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:00,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:00,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:00,107 INFO L87 Difference]: Start difference. First operand 6022 states and 9192 transitions. Second operand 3 states. [2018-11-06 19:53:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:01,990 INFO L93 Difference]: Finished difference Result 17361 states and 26560 transitions. [2018-11-06 19:53:01,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:01,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-06 19:53:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:02,036 INFO L225 Difference]: With dead ends: 17361 [2018-11-06 19:53:02,037 INFO L226 Difference]: Without dead ends: 11341 [2018-11-06 19:53:02,048 INFO L604 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-11-06 19:53:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11341 states. [2018-11-06 19:53:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11341 to 11337. [2018-11-06 19:53:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11337 states. [2018-11-06 19:53:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11337 states to 11337 states and 15999 transitions. [2018-11-06 19:53:02,271 INFO L78 Accepts]: Start accepts. Automaton has 11337 states and 15999 transitions. Word has length 246 [2018-11-06 19:53:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:02,271 INFO L480 AbstractCegarLoop]: Abstraction has 11337 states and 15999 transitions. [2018-11-06 19:53:02,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 11337 states and 15999 transitions. [2018-11-06 19:53:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-06 19:53:02,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:02,372 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:53:02,372 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:02,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:02,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2143225122, now seen corresponding path program 1 times [2018-11-06 19:53:02,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:02,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:02,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:02,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:02,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:02,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:02,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:02,737 INFO L87 Difference]: Start difference. First operand 11337 states and 15999 transitions. Second operand 4 states. [2018-11-06 19:53:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:06,236 INFO L93 Difference]: Finished difference Result 41586 states and 58258 transitions. [2018-11-06 19:53:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:06,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2018-11-06 19:53:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:06,314 INFO L225 Difference]: With dead ends: 41586 [2018-11-06 19:53:06,315 INFO L226 Difference]: Without dead ends: 30251 [2018-11-06 19:53:06,334 INFO L604 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-11-06 19:53:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30251 states. [2018-11-06 19:53:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30251 to 21129. [2018-11-06 19:53:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-11-06 19:53:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 28285 transitions. [2018-11-06 19:53:06,684 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 28285 transitions. Word has length 249 [2018-11-06 19:53:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:06,684 INFO L480 AbstractCegarLoop]: Abstraction has 21129 states and 28285 transitions. [2018-11-06 19:53:06,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 28285 transitions. [2018-11-06 19:53:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-06 19:53:06,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:06,708 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:53:06,708 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:06,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:06,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2086343220, now seen corresponding path program 1 times [2018-11-06 19:53:06,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:06,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:06,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:06,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:06,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 19:53:06,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:06,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:06,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:06,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:06,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:06,866 INFO L87 Difference]: Start difference. First operand 21129 states and 28285 transitions. Second operand 3 states. [2018-11-06 19:53:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:09,139 INFO L93 Difference]: Finished difference Result 42264 states and 56582 transitions. [2018-11-06 19:53:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:09,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-11-06 19:53:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:09,181 INFO L225 Difference]: With dead ends: 42264 [2018-11-06 19:53:09,182 INFO L226 Difference]: Without dead ends: 21137 [2018-11-06 19:53:09,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2018-11-06 19:53:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 21129. [2018-11-06 19:53:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-11-06 19:53:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 25984 transitions. [2018-11-06 19:53:09,674 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 25984 transitions. Word has length 256 [2018-11-06 19:53:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:09,674 INFO L480 AbstractCegarLoop]: Abstraction has 21129 states and 25984 transitions. [2018-11-06 19:53:09,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 25984 transitions. [2018-11-06 19:53:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-06 19:53:09,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:09,699 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:09,699 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:09,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:09,699 INFO L82 PathProgramCache]: Analyzing trace with hash 118608097, now seen corresponding path program 1 times [2018-11-06 19:53:09,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:09,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:09,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 19:53:09,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:09,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:09,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:09,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:09,988 INFO L87 Difference]: Start difference. First operand 21129 states and 25984 transitions. Second operand 4 states. [2018-11-06 19:53:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:11,537 INFO L93 Difference]: Finished difference Result 41848 states and 51444 transitions. [2018-11-06 19:53:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:11,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2018-11-06 19:53:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:11,567 INFO L225 Difference]: With dead ends: 41848 [2018-11-06 19:53:11,567 INFO L226 Difference]: Without dead ends: 20721 [2018-11-06 19:53:11,592 INFO L604 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-11-06 19:53:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2018-11-06 19:53:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 20721. [2018-11-06 19:53:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20721 states. [2018-11-06 19:53:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20721 states to 20721 states and 24096 transitions. [2018-11-06 19:53:11,855 INFO L78 Accepts]: Start accepts. Automaton has 20721 states and 24096 transitions. Word has length 273 [2018-11-06 19:53:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:11,856 INFO L480 AbstractCegarLoop]: Abstraction has 20721 states and 24096 transitions. [2018-11-06 19:53:11,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 20721 states and 24096 transitions. [2018-11-06 19:53:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-06 19:53:11,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:11,881 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:11,881 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:11,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1644802394, now seen corresponding path program 1 times [2018-11-06 19:53:11,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:11,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:11,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:11,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 19:53:12,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:12,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:12,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:12,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:12,275 INFO L87 Difference]: Start difference. First operand 20721 states and 24096 transitions. Second operand 4 states. [2018-11-06 19:53:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:14,565 INFO L93 Difference]: Finished difference Result 81404 states and 94705 transitions. [2018-11-06 19:53:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:14,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 275 [2018-11-06 19:53:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:14,635 INFO L225 Difference]: With dead ends: 81404 [2018-11-06 19:53:14,635 INFO L226 Difference]: Without dead ends: 60685 [2018-11-06 19:53:14,660 INFO L604 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-11-06 19:53:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60685 states. [2018-11-06 19:53:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60685 to 60681. [2018-11-06 19:53:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60681 states. [2018-11-06 19:53:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60681 states to 60681 states and 70472 transitions. [2018-11-06 19:53:15,634 INFO L78 Accepts]: Start accepts. Automaton has 60681 states and 70472 transitions. Word has length 275 [2018-11-06 19:53:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:15,635 INFO L480 AbstractCegarLoop]: Abstraction has 60681 states and 70472 transitions. [2018-11-06 19:53:15,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 60681 states and 70472 transitions. [2018-11-06 19:53:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-06 19:53:15,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:15,654 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-06 19:53:15,655 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:15,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 300378130, now seen corresponding path program 1 times [2018-11-06 19:53:15,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:15,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:15,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-06 19:53:15,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:15,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:15,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:15,835 INFO L87 Difference]: Start difference. First operand 60681 states and 70472 transitions. Second operand 3 states. [2018-11-06 19:53:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:17,522 INFO L93 Difference]: Finished difference Result 165649 states and 191375 transitions. [2018-11-06 19:53:17,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:17,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-11-06 19:53:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:17,643 INFO L225 Difference]: With dead ends: 165649 [2018-11-06 19:53:17,643 INFO L226 Difference]: Without dead ends: 104970 [2018-11-06 19:53:17,695 INFO L604 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-11-06 19:53:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104970 states. [2018-11-06 19:53:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104970 to 104934. [2018-11-06 19:53:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104934 states. [2018-11-06 19:53:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104934 states to 104934 states and 118153 transitions. [2018-11-06 19:53:19,354 INFO L78 Accepts]: Start accepts. Automaton has 104934 states and 118153 transitions. Word has length 308 [2018-11-06 19:53:19,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:19,354 INFO L480 AbstractCegarLoop]: Abstraction has 104934 states and 118153 transitions. [2018-11-06 19:53:19,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 104934 states and 118153 transitions. [2018-11-06 19:53:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-06 19:53:19,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:19,372 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:19,372 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:19,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1533517783, now seen corresponding path program 1 times [2018-11-06 19:53:19,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:19,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:19,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:53:19,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:19,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:19,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:19,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:19,594 INFO L87 Difference]: Start difference. First operand 104934 states and 118153 transitions. Second operand 3 states. [2018-11-06 19:53:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:21,680 INFO L93 Difference]: Finished difference Result 263408 states and 296380 transitions. [2018-11-06 19:53:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:21,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-11-06 19:53:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:21,845 INFO L225 Difference]: With dead ends: 263408 [2018-11-06 19:53:21,845 INFO L226 Difference]: Without dead ends: 158476 [2018-11-06 19:53:21,915 INFO L604 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-11-06 19:53:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158476 states. [2018-11-06 19:53:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158476 to 158458. [2018-11-06 19:53:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158458 states. [2018-11-06 19:53:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158458 states to 158458 states and 178048 transitions. [2018-11-06 19:53:24,530 INFO L78 Accepts]: Start accepts. Automaton has 158458 states and 178048 transitions. Word has length 309 [2018-11-06 19:53:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:24,530 INFO L480 AbstractCegarLoop]: Abstraction has 158458 states and 178048 transitions. [2018-11-06 19:53:24,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 158458 states and 178048 transitions. [2018-11-06 19:53:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-06 19:53:24,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:24,547 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:24,547 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:24,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:24,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1717724757, now seen corresponding path program 1 times [2018-11-06 19:53:24,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:24,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:24,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:24,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:24,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:24,899 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:53:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:53:25,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:53:25,107 INFO L225 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-11-06 19:53:25,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:25,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:53:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-06 19:53:25,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:53:25,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 19:53:25,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:53:25,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:53:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:53:25,531 INFO L87 Difference]: Start difference. First operand 158458 states and 178048 transitions. Second operand 6 states. [2018-11-06 19:53:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:32,545 INFO L93 Difference]: Finished difference Result 454965 states and 512229 transitions. [2018-11-06 19:53:32,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:53:32,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 317 [2018-11-06 19:53:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:32,896 INFO L225 Difference]: With dead ends: 454965 [2018-11-06 19:53:32,896 INFO L226 Difference]: Without dead ends: 296509 [2018-11-06 19:53:33,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:53:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296509 states. [2018-11-06 19:53:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296509 to 295200. [2018-11-06 19:53:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295200 states. [2018-11-06 19:53:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295200 states to 295200 states and 321945 transitions. [2018-11-06 19:53:37,221 INFO L78 Accepts]: Start accepts. Automaton has 295200 states and 321945 transitions. Word has length 317 [2018-11-06 19:53:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:37,221 INFO L480 AbstractCegarLoop]: Abstraction has 295200 states and 321945 transitions. [2018-11-06 19:53:37,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:53:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 295200 states and 321945 transitions. [2018-11-06 19:53:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-11-06 19:53:37,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:37,258 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:53:37,259 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:37,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:37,259 INFO L82 PathProgramCache]: Analyzing trace with hash -22662564, now seen corresponding path program 1 times [2018-11-06 19:53:37,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:37,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:37,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:37,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:37,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:37,773 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:53:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-06 19:53:37,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:37,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:37,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:53:37,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:53:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:37,986 INFO L87 Difference]: Start difference. First operand 295200 states and 321945 transitions. Second operand 5 states. [2018-11-06 19:53:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:52,210 INFO L93 Difference]: Finished difference Result 788120 states and 855300 transitions. [2018-11-06 19:53:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:53:52,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 369 [2018-11-06 19:53:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:52,822 INFO L225 Difference]: With dead ends: 788120 [2018-11-06 19:53:52,823 INFO L226 Difference]: Without dead ends: 492922 [2018-11-06 19:53:52,951 INFO L604 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-11-06 19:53:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492922 states. [2018-11-06 19:53:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492922 to 461133. [2018-11-06 19:53:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461133 states. [2018-11-06 19:53:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461133 states to 461133 states and 499637 transitions. [2018-11-06 19:53:59,728 INFO L78 Accepts]: Start accepts. Automaton has 461133 states and 499637 transitions. Word has length 369 [2018-11-06 19:53:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:59,728 INFO L480 AbstractCegarLoop]: Abstraction has 461133 states and 499637 transitions. [2018-11-06 19:53:59,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:53:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 461133 states and 499637 transitions. [2018-11-06 19:53:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-11-06 19:53:59,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:59,769 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:59,770 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:59,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash 621590431, now seen corresponding path program 1 times [2018-11-06 19:53:59,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:59,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:59,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-06 19:54:00,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:00,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:00,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:00,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:00,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:00,015 INFO L87 Difference]: Start difference. First operand 461133 states and 499637 transitions. Second operand 4 states. [2018-11-06 19:54:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:08,610 INFO L93 Difference]: Finished difference Result 1337409 states and 1443549 transitions. [2018-11-06 19:54:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:54:08,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-11-06 19:54:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:09,727 INFO L225 Difference]: With dead ends: 1337409 [2018-11-06 19:54:09,728 INFO L226 Difference]: Without dead ends: 876278 [2018-11-06 19:54:09,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876278 states. [2018-11-06 19:54:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876278 to 732371. [2018-11-06 19:54:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732371 states. [2018-11-06 19:54:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732371 states to 732371 states and 786049 transitions. [2018-11-06 19:54:31,571 INFO L78 Accepts]: Start accepts. Automaton has 732371 states and 786049 transitions. Word has length 380 [2018-11-06 19:54:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:31,571 INFO L480 AbstractCegarLoop]: Abstraction has 732371 states and 786049 transitions. [2018-11-06 19:54:31,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 732371 states and 786049 transitions. [2018-11-06 19:54:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-11-06 19:54:31,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:31,605 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:54:31,605 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:31,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2012126856, now seen corresponding path program 1 times [2018-11-06 19:54:31,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:31,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:31,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:31,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:31,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 203 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 19:54:32,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:54:32,095 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:54:32,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:32,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:54:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-06 19:54:32,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:54:32,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 19:54:32,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:54:32,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:54:32,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:54:32,392 INFO L87 Difference]: Start difference. First operand 732371 states and 786049 transitions. Second operand 8 states. [2018-11-06 19:54:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:52,536 INFO L93 Difference]: Finished difference Result 1975978 states and 2123306 transitions. [2018-11-06 19:54:52,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 19:54:52,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 393 [2018-11-06 19:54:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:52,537 INFO L225 Difference]: With dead ends: 1975978 [2018-11-06 19:54:52,537 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:54:52,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-11-06 19:54:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:54:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:54:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:54:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:54:52,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 393 [2018-11-06 19:54:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:52,951 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:54:52,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:54:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:54:52,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:54:52,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:55:11,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:12,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:12,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:18,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:27,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:27,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:30,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:30,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:30,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:31,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:32,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:32,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:32,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:32,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:32,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:32,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:33,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:33,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:33,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:33,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:33,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:33,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:33,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:34,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:35,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:35,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:35,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:35,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:35,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:36,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:36,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:37,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:37,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:37,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:37,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:37,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:37,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:38,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:38,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:38,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:38,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:38,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:39,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:39,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:39,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:39,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:40,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:40,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:41,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:42,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:42,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:43,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:43,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:43,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:43,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:44,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:44,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:44,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:44,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:45,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:46,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:47,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:47,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:48,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:49,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:49,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:49,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:49,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:50,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:52,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:53,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:53,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:54,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:54,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:54,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:55,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:55,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:55,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:56,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:56,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:57,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:58,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:58,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:55:59,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:00,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:01,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:01,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:01,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:01,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:01,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:01,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:02,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:03,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:03,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:03,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:04,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:04,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:56:06,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. Received shutdown request... [2018-11-06 19:56:06,897 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-11-06 19:56:06,898 INFO L168 Benchmark]: Toolchain (without parser) took 214033.37 ms. Allocated memory was 1.5 GB in the beginning and 6.0 GB in the end (delta: 4.4 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 5.8 GB. Max. memory is 7.1 GB. [2018-11-06 19:56:06,900 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-11-06 19:56:06,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1076.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:56:06,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 312.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -887.1 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:56:06,905 INFO L168 Benchmark]: Boogie Preprocessor took 134.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:56:06,909 INFO L168 Benchmark]: RCFGBuilder took 5685.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 270.9 MB). Peak memory consumption was 270.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:56:06,912 INFO L168 Benchmark]: TraceAbstraction took 206820.49 ms. Allocated memory was 2.3 GB in the beginning and 6.0 GB in the end (delta: 3.7 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. [2018-11-06 19:56:06,920 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 1076.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 312.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -887.1 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5685.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 270.9 MB). Peak memory consumption was 270.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206820.49 ms. Allocated memory was 2.3 GB in the beginning and 6.0 GB in the end (delta: 3.7 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1542]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 7818. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown