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/Problem11_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:01:57,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:01:57,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:01:57,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:01:57,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:01:57,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:01:57,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:01:57,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:01:57,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:01:57,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:01:57,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:01:57,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:01:57,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:01:57,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:01:57,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:01:57,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:01:57,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:01:57,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:01:57,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:01:57,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:01:57,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:01:57,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:01:57,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:01:57,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:01:57,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:01:57,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:01:57,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:01:57,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:01:57,184 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:01:57,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:01:57,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:01:57,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:01:57,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:01:57,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:01:57,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:01:57,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:01:57,190 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 21:01:57,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:01:57,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:01:57,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:01:57,220 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:01:57,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:01:57,220 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:01:57,220 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:01:57,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:01:57,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:01:57,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:01:57,221 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:01:57,222 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:01:57,222 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:01:57,222 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:01:57,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:01:57,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:01:57,223 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:01:57,223 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:01:57,223 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:01:57,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:01:57,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:01:57,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:01:57,224 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:01:57,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:01:57,224 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:01:57,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:01:57,224 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:01:57,225 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:01:57,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:01:57,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:01:57,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:01:57,294 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:01:57,295 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:01:57,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label02_true-unreach-call.c [2018-11-06 21:01:57,355 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12ae7218/817be734da1f4af8b1992038663de957/FLAGfe89b04ef [2018-11-06 21:01:57,937 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:01:57,938 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label02_true-unreach-call.c [2018-11-06 21:01:57,956 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12ae7218/817be734da1f4af8b1992038663de957/FLAGfe89b04ef [2018-11-06 21:01:57,976 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12ae7218/817be734da1f4af8b1992038663de957 [2018-11-06 21:01:57,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:01:57,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:01:57,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:01:57,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:01:57,996 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:01:57,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:57" (1/1) ... [2018-11-06 21:01:58,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567b4d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:57, skipping insertion in model container [2018-11-06 21:01:58,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:57" (1/1) ... [2018-11-06 21:01:58,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:01:58,100 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:01:58,718 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:01:58,724 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:01:58,956 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:01:58,976 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:01:58,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58 WrapperNode [2018-11-06 21:01:58,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:01:58,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:01:58,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:01:58,979 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:01:58,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (1/1) ... [2018-11-06 21:01:59,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 09:01:58" (1/1) ... [2018-11-06 21:01:59,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:01:59,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:01:59,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:01:59,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:01:59,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (1/1) ... [2018-11-06 21:01:59,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (1/1) ... [2018-11-06 21:01:59,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (1/1) ... [2018-11-06 21:01:59,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (1/1) ... [2018-11-06 21:01:59,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (1/1) ... [2018-11-06 21:01:59,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (1/1) ... [2018-11-06 21:01:59,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (1/1) ... [2018-11-06 21:01:59,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:01:59,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:01:59,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:01:59,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:01:59,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (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 21:01:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:01:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:01:59,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:02:03,930 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:02:03,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:03 BoogieIcfgContainer [2018-11-06 21:02:03,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:02:03,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:02:03,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:02:03,936 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:02:03,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:01:57" (1/3) ... [2018-11-06 21:02:03,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ee10d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:03, skipping insertion in model container [2018-11-06 21:02:03,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:58" (2/3) ... [2018-11-06 21:02:03,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ee10d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:03, skipping insertion in model container [2018-11-06 21:02:03,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:03" (3/3) ... [2018-11-06 21:02:03,940 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label02_true-unreach-call.c [2018-11-06 21:02:03,950 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:02:03,959 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:02:03,978 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:02:04,016 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:02:04,017 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:02:04,017 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:02:04,018 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:02:04,018 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:02:04,018 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:02:04,018 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:02:04,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:02:04,019 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:02:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:02:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-06 21:02:04,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:04,058 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] [2018-11-06 21:02:04,060 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:04,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:04,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1306950314, now seen corresponding path program 1 times [2018-11-06 21:02:04,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:04,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:04,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:04,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:04,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:04,599 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 21:02:04,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:04,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:04,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:04,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:04,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:04,627 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:02:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:08,156 INFO L93 Difference]: Finished difference Result 961 states and 1728 transitions. [2018-11-06 21:02:08,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:08,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-06 21:02:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:08,182 INFO L225 Difference]: With dead ends: 961 [2018-11-06 21:02:08,182 INFO L226 Difference]: Without dead ends: 670 [2018-11-06 21:02:08,187 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 21:02:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-06 21:02:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-11-06 21:02:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-06 21:02:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1024 transitions. [2018-11-06 21:02:08,283 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1024 transitions. Word has length 55 [2018-11-06 21:02:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:08,283 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 1024 transitions. [2018-11-06 21:02:08,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1024 transitions. [2018-11-06 21:02:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-06 21:02:08,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:08,291 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, 1, 1, 1, 1, 1, 1, 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 21:02:08,291 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:08,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1782139322, now seen corresponding path program 1 times [2018-11-06 21:02:08,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:08,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:08,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:08,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:08,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:08,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:08,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:08,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:08,674 INFO L87 Difference]: Start difference. First operand 670 states and 1024 transitions. Second operand 4 states. [2018-11-06 21:02:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:13,506 INFO L93 Difference]: Finished difference Result 2479 states and 3869 transitions. [2018-11-06 21:02:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:13,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-11-06 21:02:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:13,519 INFO L225 Difference]: With dead ends: 2479 [2018-11-06 21:02:13,519 INFO L226 Difference]: Without dead ends: 1811 [2018-11-06 21:02:13,527 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 21:02:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-11-06 21:02:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1226. [2018-11-06 21:02:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-11-06 21:02:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1709 transitions. [2018-11-06 21:02:13,611 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1709 transitions. Word has length 132 [2018-11-06 21:02:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:13,612 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 1709 transitions. [2018-11-06 21:02:13,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1709 transitions. [2018-11-06 21:02:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-06 21:02:13,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:13,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:02:13,621 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:13,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash -568493175, now seen corresponding path program 1 times [2018-11-06 21:02:13,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:13,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:13,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:13,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:13,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:14,084 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-11-06 21:02:14,368 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-06 21:02:14,730 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-11-06 21:02:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:14,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:14,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:02:14,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:02:14,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:02:14,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:02:14,947 INFO L87 Difference]: Start difference. First operand 1226 states and 1709 transitions. Second operand 7 states. [2018-11-06 21:02:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:19,300 INFO L93 Difference]: Finished difference Result 3945 states and 5454 transitions. [2018-11-06 21:02:19,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:02:19,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-11-06 21:02:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:19,317 INFO L225 Difference]: With dead ends: 3945 [2018-11-06 21:02:19,317 INFO L226 Difference]: Without dead ends: 2721 [2018-11-06 21:02:19,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:02:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2018-11-06 21:02:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2714. [2018-11-06 21:02:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2018-11-06 21:02:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3564 transitions. [2018-11-06 21:02:19,384 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3564 transitions. Word has length 146 [2018-11-06 21:02:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:19,385 INFO L480 AbstractCegarLoop]: Abstraction has 2714 states and 3564 transitions. [2018-11-06 21:02:19,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:02:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3564 transitions. [2018-11-06 21:02:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-06 21:02:19,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:19,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:02:19,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:19,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1340316364, now seen corresponding path program 1 times [2018-11-06 21:02:19,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:19,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:19,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:19,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:19,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:19,652 INFO L87 Difference]: Start difference. First operand 2714 states and 3564 transitions. Second operand 4 states. [2018-11-06 21:02:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:21,638 INFO L93 Difference]: Finished difference Result 8225 states and 11197 transitions. [2018-11-06 21:02:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:21,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-06 21:02:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:21,664 INFO L225 Difference]: With dead ends: 8225 [2018-11-06 21:02:21,665 INFO L226 Difference]: Without dead ends: 5513 [2018-11-06 21:02:21,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2018-11-06 21:02:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 4193. [2018-11-06 21:02:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4193 states. [2018-11-06 21:02:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4193 states to 4193 states and 5299 transitions. [2018-11-06 21:02:21,754 INFO L78 Accepts]: Start accepts. Automaton has 4193 states and 5299 transitions. Word has length 183 [2018-11-06 21:02:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:21,754 INFO L480 AbstractCegarLoop]: Abstraction has 4193 states and 5299 transitions. [2018-11-06 21:02:21,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4193 states and 5299 transitions. [2018-11-06 21:02:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-06 21:02:21,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:21,760 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:21,760 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:21,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2049054914, now seen corresponding path program 1 times [2018-11-06 21:02:21,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:21,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:21,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:21,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:21,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-06 21:02:21,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:21,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:21,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:21,920 INFO L87 Difference]: Start difference. First operand 4193 states and 5299 transitions. Second operand 4 states. [2018-11-06 21:02:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:24,012 INFO L93 Difference]: Finished difference Result 12653 states and 16214 transitions. [2018-11-06 21:02:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:24,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-06 21:02:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:24,044 INFO L225 Difference]: With dead ends: 12653 [2018-11-06 21:02:24,044 INFO L226 Difference]: Without dead ends: 8462 [2018-11-06 21:02:24,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8462 states. [2018-11-06 21:02:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8462 to 7516. [2018-11-06 21:02:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7516 states. [2018-11-06 21:02:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7516 states to 7516 states and 9287 transitions. [2018-11-06 21:02:24,193 INFO L78 Accepts]: Start accepts. Automaton has 7516 states and 9287 transitions. Word has length 201 [2018-11-06 21:02:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:24,194 INFO L480 AbstractCegarLoop]: Abstraction has 7516 states and 9287 transitions. [2018-11-06 21:02:24,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states and 9287 transitions. [2018-11-06 21:02:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-06 21:02:24,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:24,201 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:02:24,201 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:24,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2085589310, now seen corresponding path program 1 times [2018-11-06 21:02:24,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:24,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:24,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-06 21:02:24,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:24,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:24,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:02:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:02:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:02:24,409 INFO L87 Difference]: Start difference. First operand 7516 states and 9287 transitions. Second operand 3 states. [2018-11-06 21:02:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:25,964 INFO L93 Difference]: Finished difference Result 16139 states and 20088 transitions. [2018-11-06 21:02:25,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:02:25,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-11-06 21:02:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:26,067 INFO L225 Difference]: With dead ends: 16139 [2018-11-06 21:02:26,067 INFO L226 Difference]: Without dead ends: 8625 [2018-11-06 21:02:26,076 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 21:02:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2018-11-06 21:02:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 8438. [2018-11-06 21:02:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8438 states. [2018-11-06 21:02:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8438 states to 8438 states and 10204 transitions. [2018-11-06 21:02:26,199 INFO L78 Accepts]: Start accepts. Automaton has 8438 states and 10204 transitions. Word has length 245 [2018-11-06 21:02:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:26,200 INFO L480 AbstractCegarLoop]: Abstraction has 8438 states and 10204 transitions. [2018-11-06 21:02:26,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:02:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8438 states and 10204 transitions. [2018-11-06 21:02:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-06 21:02:26,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:26,208 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:02:26,208 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:26,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash 116161471, now seen corresponding path program 1 times [2018-11-06 21:02:26,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:26,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:26,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:26,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:26,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:02:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:02:26,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:26,730 INFO L87 Difference]: Start difference. First operand 8438 states and 10204 transitions. Second operand 5 states. [2018-11-06 21:02:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:29,574 INFO L93 Difference]: Finished difference Result 24504 states and 29750 transitions. [2018-11-06 21:02:29,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:02:29,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-11-06 21:02:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:29,613 INFO L225 Difference]: With dead ends: 24504 [2018-11-06 21:02:29,613 INFO L226 Difference]: Without dead ends: 16068 [2018-11-06 21:02:29,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16068 states. [2018-11-06 21:02:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16068 to 14192. [2018-11-06 21:02:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14192 states. [2018-11-06 21:02:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14192 states to 14192 states and 16726 transitions. [2018-11-06 21:02:29,820 INFO L78 Accepts]: Start accepts. Automaton has 14192 states and 16726 transitions. Word has length 284 [2018-11-06 21:02:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:29,820 INFO L480 AbstractCegarLoop]: Abstraction has 14192 states and 16726 transitions. [2018-11-06 21:02:29,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:02:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 14192 states and 16726 transitions. [2018-11-06 21:02:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-06 21:02:29,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:29,837 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:29,837 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:29,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1753861991, now seen corresponding path program 1 times [2018-11-06 21:02:29,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:29,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:29,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-06 21:02:30,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:30,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:02:30,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:02:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:02:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:02:30,137 INFO L87 Difference]: Start difference. First operand 14192 states and 16726 transitions. Second operand 3 states. [2018-11-06 21:02:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:31,691 INFO L93 Difference]: Finished difference Result 25594 states and 30418 transitions. [2018-11-06 21:02:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:02:31,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-11-06 21:02:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:31,717 INFO L225 Difference]: With dead ends: 25594 [2018-11-06 21:02:31,717 INFO L226 Difference]: Without dead ends: 12327 [2018-11-06 21:02:31,730 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 21:02:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12327 states. [2018-11-06 21:02:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12327 to 10658. [2018-11-06 21:02:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10658 states. [2018-11-06 21:02:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10658 states to 10658 states and 12227 transitions. [2018-11-06 21:02:31,876 INFO L78 Accepts]: Start accepts. Automaton has 10658 states and 12227 transitions. Word has length 350 [2018-11-06 21:02:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:31,877 INFO L480 AbstractCegarLoop]: Abstraction has 10658 states and 12227 transitions. [2018-11-06 21:02:31,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:02:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 10658 states and 12227 transitions. [2018-11-06 21:02:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-11-06 21:02:31,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:31,902 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:02:31,902 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:31,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:31,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1911231991, now seen corresponding path program 1 times [2018-11-06 21:02:31,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:31,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:31,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:31,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-06 21:02:32,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:32,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:32,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:32,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:32,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:32,265 INFO L87 Difference]: Start difference. First operand 10658 states and 12227 transitions. Second operand 4 states. [2018-11-06 21:02:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:34,077 INFO L93 Difference]: Finished difference Result 25024 states and 28838 transitions. [2018-11-06 21:02:34,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:34,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2018-11-06 21:02:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:34,096 INFO L225 Difference]: With dead ends: 25024 [2018-11-06 21:02:34,097 INFO L226 Difference]: Without dead ends: 15294 [2018-11-06 21:02:34,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15294 states. [2018-11-06 21:02:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15294 to 14540. [2018-11-06 21:02:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14540 states. [2018-11-06 21:02:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14540 states to 14540 states and 16425 transitions. [2018-11-06 21:02:34,293 INFO L78 Accepts]: Start accepts. Automaton has 14540 states and 16425 transitions. Word has length 434 [2018-11-06 21:02:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:34,294 INFO L480 AbstractCegarLoop]: Abstraction has 14540 states and 16425 transitions. [2018-11-06 21:02:34,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14540 states and 16425 transitions. [2018-11-06 21:02:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-11-06 21:02:34,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:34,320 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-06 21:02:34,320 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:34,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:34,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2124655912, now seen corresponding path program 1 times [2018-11-06 21:02:34,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:34,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:34,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 640 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-11-06 21:02:34,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:34,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:34,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:02:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:02:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:34,969 INFO L87 Difference]: Start difference. First operand 14540 states and 16425 transitions. Second operand 5 states. [2018-11-06 21:02:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:37,243 INFO L93 Difference]: Finished difference Result 35749 states and 40495 transitions. [2018-11-06 21:02:37,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:02:37,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 517 [2018-11-06 21:02:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:37,269 INFO L225 Difference]: With dead ends: 35749 [2018-11-06 21:02:37,269 INFO L226 Difference]: Without dead ends: 21211 [2018-11-06 21:02:37,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21211 states. [2018-11-06 21:02:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21211 to 17680. [2018-11-06 21:02:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17680 states. [2018-11-06 21:02:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17680 states to 17680 states and 19676 transitions. [2018-11-06 21:02:37,515 INFO L78 Accepts]: Start accepts. Automaton has 17680 states and 19676 transitions. Word has length 517 [2018-11-06 21:02:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:37,516 INFO L480 AbstractCegarLoop]: Abstraction has 17680 states and 19676 transitions. [2018-11-06 21:02:37,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:02:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17680 states and 19676 transitions. [2018-11-06 21:02:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-11-06 21:02:37,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:37,543 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-06 21:02:37,544 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:37,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:37,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1052980990, now seen corresponding path program 1 times [2018-11-06 21:02:37,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:37,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:37,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:37,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:37,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-11-06 21:02:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:37,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:37,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:37,953 INFO L87 Difference]: Start difference. First operand 17680 states and 19676 transitions. Second operand 4 states. [2018-11-06 21:02:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:39,531 INFO L93 Difference]: Finished difference Result 35378 states and 39414 transitions. [2018-11-06 21:02:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:39,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 523 [2018-11-06 21:02:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:39,550 INFO L225 Difference]: With dead ends: 35378 [2018-11-06 21:02:39,551 INFO L226 Difference]: Without dead ends: 16772 [2018-11-06 21:02:39,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16772 states. [2018-11-06 21:02:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16772 to 16565. [2018-11-06 21:02:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16565 states. [2018-11-06 21:02:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16565 states to 16565 states and 18015 transitions. [2018-11-06 21:02:39,756 INFO L78 Accepts]: Start accepts. Automaton has 16565 states and 18015 transitions. Word has length 523 [2018-11-06 21:02:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:39,757 INFO L480 AbstractCegarLoop]: Abstraction has 16565 states and 18015 transitions. [2018-11-06 21:02:39,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 16565 states and 18015 transitions. [2018-11-06 21:02:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2018-11-06 21:02:39,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:39,783 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:39,783 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:39,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1120006104, now seen corresponding path program 1 times [2018-11-06 21:02:39,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:39,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:39,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2018-11-06 21:02:40,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:40,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:40,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:40,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:40,490 INFO L87 Difference]: Start difference. First operand 16565 states and 18015 transitions. Second operand 4 states. [2018-11-06 21:02:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:43,444 INFO L93 Difference]: Finished difference Result 30725 states and 33462 transitions. [2018-11-06 21:02:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:43,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 623 [2018-11-06 21:02:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:43,461 INFO L225 Difference]: With dead ends: 30725 [2018-11-06 21:02:43,462 INFO L226 Difference]: Without dead ends: 16013 [2018-11-06 21:02:43,473 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 21:02:43,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16013 states. [2018-11-06 21:02:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16013 to 14710. [2018-11-06 21:02:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14710 states. [2018-11-06 21:02:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14710 states to 14710 states and 15929 transitions. [2018-11-06 21:02:43,650 INFO L78 Accepts]: Start accepts. Automaton has 14710 states and 15929 transitions. Word has length 623 [2018-11-06 21:02:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:43,651 INFO L480 AbstractCegarLoop]: Abstraction has 14710 states and 15929 transitions. [2018-11-06 21:02:43,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 14710 states and 15929 transitions. [2018-11-06 21:02:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2018-11-06 21:02:43,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:43,668 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 21:02:43,669 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:43,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash -473584533, now seen corresponding path program 1 times [2018-11-06 21:02:43,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:43,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:43,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:43,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:44,293 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 21:02:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2018-11-06 21:02:44,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:44,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:44,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:44,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:44,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:44,864 INFO L87 Difference]: Start difference. First operand 14710 states and 15929 transitions. Second operand 4 states. [2018-11-06 21:02:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:46,045 INFO L93 Difference]: Finished difference Result 27565 states and 29891 transitions. [2018-11-06 21:02:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:46,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 657 [2018-11-06 21:02:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:46,061 INFO L225 Difference]: With dead ends: 27565 [2018-11-06 21:02:46,061 INFO L226 Difference]: Without dead ends: 14898 [2018-11-06 21:02:46,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14898 states. [2018-11-06 21:02:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14898 to 14710. [2018-11-06 21:02:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14710 states. [2018-11-06 21:02:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14710 states to 14710 states and 15922 transitions. [2018-11-06 21:02:46,222 INFO L78 Accepts]: Start accepts. Automaton has 14710 states and 15922 transitions. Word has length 657 [2018-11-06 21:02:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:46,224 INFO L480 AbstractCegarLoop]: Abstraction has 14710 states and 15922 transitions. [2018-11-06 21:02:46,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 14710 states and 15922 transitions. [2018-11-06 21:02:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2018-11-06 21:02:46,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:46,246 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:46,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:46,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1832297417, now seen corresponding path program 1 times [2018-11-06 21:02:46,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:46,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:46,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 1184 proven. 82 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2018-11-06 21:02:47,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:47,708 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 21:02:47,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:48,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:48,541 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 19 [2018-11-06 21:02:50,739 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2018-11-06 21:02:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 2245 proven. 0 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2018-11-06 21:02:54,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:02:54,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-11-06 21:02:54,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:02:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:02:54,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:02:54,107 INFO L87 Difference]: Start difference. First operand 14710 states and 15922 transitions. Second operand 7 states. [2018-11-06 21:02:57,535 WARN L179 SmtUtils]: Spent 971.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-06 21:03:00,289 WARN L179 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-06 21:03:07,016 WARN L179 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 63 [2018-11-06 21:03:10,282 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 63 [2018-11-06 21:03:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:17,417 INFO L93 Difference]: Finished difference Result 39657 states and 42973 transitions. [2018-11-06 21:03:17,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:03:17,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 861 [2018-11-06 21:03:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:17,490 INFO L225 Difference]: With dead ends: 39657 [2018-11-06 21:03:17,490 INFO L226 Difference]: Without dead ends: 25689 [2018-11-06 21:03:17,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 869 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=99, Invalid=206, Unknown=1, NotChecked=0, Total=306 [2018-11-06 21:03:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25689 states. [2018-11-06 21:03:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25689 to 18416. [2018-11-06 21:03:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18416 states. [2018-11-06 21:03:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18416 states to 18416 states and 19809 transitions. [2018-11-06 21:03:17,922 INFO L78 Accepts]: Start accepts. Automaton has 18416 states and 19809 transitions. Word has length 861 [2018-11-06 21:03:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:17,923 INFO L480 AbstractCegarLoop]: Abstraction has 18416 states and 19809 transitions. [2018-11-06 21:03:17,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:03:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 18416 states and 19809 transitions. [2018-11-06 21:03:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2018-11-06 21:03:17,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:17,949 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:03:17,949 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:17,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506700, now seen corresponding path program 1 times [2018-11-06 21:03:17,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:17,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:17,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:18,807 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:03:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 1766 proven. 0 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-06 21:03:19,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:19,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:19,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:19,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:19,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:19,385 INFO L87 Difference]: Start difference. First operand 18416 states and 19809 transitions. Second operand 4 states. [2018-11-06 21:03:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:21,442 INFO L93 Difference]: Finished difference Result 37214 states and 40014 transitions. [2018-11-06 21:03:21,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:21,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 932 [2018-11-06 21:03:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:21,468 INFO L225 Difference]: With dead ends: 37214 [2018-11-06 21:03:21,468 INFO L226 Difference]: Without dead ends: 20469 [2018-11-06 21:03:21,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20469 states. [2018-11-06 21:03:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20469 to 15263. [2018-11-06 21:03:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15263 states. [2018-11-06 21:03:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15263 states to 15263 states and 16397 transitions. [2018-11-06 21:03:21,786 INFO L78 Accepts]: Start accepts. Automaton has 15263 states and 16397 transitions. Word has length 932 [2018-11-06 21:03:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:21,787 INFO L480 AbstractCegarLoop]: Abstraction has 15263 states and 16397 transitions. [2018-11-06 21:03:21,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 15263 states and 16397 transitions. [2018-11-06 21:03:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2018-11-06 21:03:21,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:21,818 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:03:21,819 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:21,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash 230579494, now seen corresponding path program 1 times [2018-11-06 21:03:21,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:21,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:21,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:23,017 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:03:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3163 backedges. 1652 proven. 220 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2018-11-06 21:03:23,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:23,840 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 21:03:23,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:24,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:30,956 WARN L179 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-11-06 21:03:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3163 backedges. 2012 proven. 600 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-06 21:03:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:33,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-06 21:03:33,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:03:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:03:33,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:03:33,487 INFO L87 Difference]: Start difference. First operand 15263 states and 16397 transitions. Second operand 9 states. [2018-11-06 21:05:33,782 WARN L179 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-06 21:05:54,274 WARN L179 SmtUtils]: Spent 2.60 s on a formula simplification that was a NOOP. DAG size: 47 Received shutdown request... [2018-11-06 21:06:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:06:08,320 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:06:08,325 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:06:08,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:06:08 BoogieIcfgContainer [2018-11-06 21:06:08,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:06:08,326 INFO L168 Benchmark]: Toolchain (without parser) took 250336.92 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 731.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:08,327 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 21:06:08,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 985.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:08,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 292.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -848.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:08,330 INFO L168 Benchmark]: Boogie Preprocessor took 147.40 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.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:08,331 INFO L168 Benchmark]: RCFGBuilder took 4512.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 183.5 MB). Peak memory consumption was 183.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:08,331 INFO L168 Benchmark]: TraceAbstraction took 244392.94 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 3.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 566.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:08,338 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 985.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 292.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -848.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.40 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.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4512.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 183.5 MB). Peak memory consumption was 183.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244392.94 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 3.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 566.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 168]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 168). Cancelled while BasicCegarLoop was constructing difference of abstraction (15263states) and FLOYD_HOARE automaton (currently 16 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (29259 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 244.3s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 213.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3519 SDtfs, 11064 SDslu, 1958 SDs, 0 SdLazy, 24460 SolverSat, 4442 SolverUnsat, 66 SolverUnknown, 0 SolverNotchecked, 185.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1911 GetRequests, 1844 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 30.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18416occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 25052 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 8922 NumberOfCodeBlocks, 8922 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 8904 ConstructedInterpolants, 430 QuantifiedInterpolants, 35091868 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2349 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 20753/21655 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown