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/Problem18_label52_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:40:12,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:40:12,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:40:13,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:40:13,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:40:13,001 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:40:13,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:40:13,007 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:40:13,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:40:13,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:40:13,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:40:13,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:40:13,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:40:13,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:40:13,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:40:13,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:40:13,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:40:13,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:40:13,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:40:13,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:40:13,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:40:13,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:40:13,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:40:13,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:40:13,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:40:13,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:40:13,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:40:13,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:40:13,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:40:13,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:40:13,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:40:13,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:40:13,047 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:40:13,047 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:40:13,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:40:13,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:40:13,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:40:13,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:40:13,078 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:40:13,079 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:40:13,079 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:40:13,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:40:13,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:40:13,080 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:40:13,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:40:13,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:40:13,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:40:13,081 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:40:13,081 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:40:13,081 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:40:13,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:40:13,081 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:40:13,082 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:40:13,082 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:40:13,082 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:40:13,082 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:40:13,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:40:13,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:40:13,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:40:13,083 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:40:13,083 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:40:13,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:40:13,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:40:13,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:40:13,084 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:40:13,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:40:13,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:40:13,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:40:13,155 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:40:13,155 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:40:13,156 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label52_false-unreach-call.c [2018-11-06 19:40:13,237 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e26bc77/2101359766bf492fb32604707e266d97/FLAG14e899d78 [2018-11-06 19:40:13,943 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:40:13,944 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label52_false-unreach-call.c [2018-11-06 19:40:13,967 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e26bc77/2101359766bf492fb32604707e266d97/FLAG14e899d78 [2018-11-06 19:40:13,985 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e26bc77/2101359766bf492fb32604707e266d97 [2018-11-06 19:40:13,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:40:14,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:40:14,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:40:14,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:40:14,007 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:40:14,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:40:13" (1/1) ... [2018-11-06 19:40:14,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7aa46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:14, skipping insertion in model container [2018-11-06 19:40:14,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:40:13" (1/1) ... [2018-11-06 19:40:14,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:40:14,145 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:40:15,372 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:40:15,377 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:40:15,817 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:40:15,848 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:40:15,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15 WrapperNode [2018-11-06 19:40:15,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:40:15,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:40:15,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:40:15,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:40:15,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:40:16,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:40:16,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:40:16,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:40:16,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... [2018-11-06 19:40:16,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:40:16,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:40:16,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:40:16,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:40:16,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:40:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:40:16,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:40:16,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:40:23,830 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:40:23,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:40:23 BoogieIcfgContainer [2018-11-06 19:40:23,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:40:23,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:40:23,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:40:23,835 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:40:23,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:40:13" (1/3) ... [2018-11-06 19:40:23,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667dabd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:40:23, skipping insertion in model container [2018-11-06 19:40:23,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:15" (2/3) ... [2018-11-06 19:40:23,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667dabd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:40:23, skipping insertion in model container [2018-11-06 19:40:23,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:40:23" (3/3) ... [2018-11-06 19:40:23,839 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label52_false-unreach-call.c [2018-11-06 19:40:23,850 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:40:23,859 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:40:23,877 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:40:23,921 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:40:23,922 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:40:23,922 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:40:23,923 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:40:23,923 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:40:23,923 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:40:23,923 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:40:23,923 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:40:23,923 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:40:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2018-11-06 19:40:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-06 19:40:23,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:40:23,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:40:23,985 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:40:23,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:40:23,991 INFO L82 PathProgramCache]: Analyzing trace with hash -809652462, now seen corresponding path program 1 times [2018-11-06 19:40:23,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:40:23,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:40:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:40:24,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:40:24,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:40:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:40:24,394 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:40:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:40:24,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:40:24,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:40:24,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:40:24,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:40:24,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:40:24,504 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2018-11-06 19:40:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:40:35,509 INFO L93 Difference]: Finished difference Result 2902 states and 5650 transitions. [2018-11-06 19:40:35,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:40:35,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-06 19:40:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:40:35,550 INFO L225 Difference]: With dead ends: 2902 [2018-11-06 19:40:35,550 INFO L226 Difference]: Without dead ends: 2137 [2018-11-06 19:40:35,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:40:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-11-06 19:40:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2137. [2018-11-06 19:40:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-11-06 19:40:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3734 transitions. [2018-11-06 19:40:35,730 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3734 transitions. Word has length 17 [2018-11-06 19:40:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:40:35,730 INFO L480 AbstractCegarLoop]: Abstraction has 2137 states and 3734 transitions. [2018-11-06 19:40:35,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:40:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3734 transitions. [2018-11-06 19:40:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-06 19:40:35,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:40:35,738 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:40:35,738 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:40:35,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:40:35,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1345110262, now seen corresponding path program 1 times [2018-11-06 19:40:35,740 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:40:35,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:40:35,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:40:35,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:40:35,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:40:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:40:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:40:36,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:40:36,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:40:36,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:40:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:40:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:40:36,104 INFO L87 Difference]: Start difference. First operand 2137 states and 3734 transitions. Second operand 4 states. [2018-11-06 19:40:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:40:45,487 INFO L93 Difference]: Finished difference Result 8418 states and 14808 transitions. [2018-11-06 19:40:45,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:40:45,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-06 19:40:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:40:45,525 INFO L225 Difference]: With dead ends: 8418 [2018-11-06 19:40:45,526 INFO L226 Difference]: Without dead ends: 6283 [2018-11-06 19:40:45,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:40:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2018-11-06 19:40:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 6283. [2018-11-06 19:40:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6283 states. [2018-11-06 19:40:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6283 states to 6283 states and 9360 transitions. [2018-11-06 19:40:45,672 INFO L78 Accepts]: Start accepts. Automaton has 6283 states and 9360 transitions. Word has length 102 [2018-11-06 19:40:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:40:45,673 INFO L480 AbstractCegarLoop]: Abstraction has 6283 states and 9360 transitions. [2018-11-06 19:40:45,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:40:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6283 states and 9360 transitions. [2018-11-06 19:40:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-06 19:40:45,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:40:45,681 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:40:45,682 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:40:45,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:40:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2002561737, now seen corresponding path program 1 times [2018-11-06 19:40:45,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:40:45,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:40:45,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:40:45,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:40:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:40:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:40:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-06 19:40:45,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:40:45,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:40:45,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:40:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:40:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:40:45,928 INFO L87 Difference]: Start difference. First operand 6283 states and 9360 transitions. Second operand 4 states. [2018-11-06 19:40:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:40:52,158 INFO L93 Difference]: Finished difference Result 23636 states and 35291 transitions. [2018-11-06 19:40:52,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:40:52,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-11-06 19:40:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:40:52,233 INFO L225 Difference]: With dead ends: 23636 [2018-11-06 19:40:52,233 INFO L226 Difference]: Without dead ends: 17355 [2018-11-06 19:40:52,246 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 19:40:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17355 states. [2018-11-06 19:40:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17355 to 12502. [2018-11-06 19:40:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12502 states. [2018-11-06 19:40:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12502 states to 12502 states and 16539 transitions. [2018-11-06 19:40:52,521 INFO L78 Accepts]: Start accepts. Automaton has 12502 states and 16539 transitions. Word has length 157 [2018-11-06 19:40:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:40:52,522 INFO L480 AbstractCegarLoop]: Abstraction has 12502 states and 16539 transitions. [2018-11-06 19:40:52,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:40:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12502 states and 16539 transitions. [2018-11-06 19:40:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-06 19:40:52,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:40:52,525 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:40:52,525 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:40:52,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:40:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash 479069292, now seen corresponding path program 1 times [2018-11-06 19:40:52,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:40:52,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:40:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:40:52,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:40:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:40:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:40:53,453 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-11-06 19:40:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-06 19:40:53,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:40:53,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:40:53,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:40:53,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:40:53,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:40:53,647 INFO L87 Difference]: Start difference. First operand 12502 states and 16539 transitions. Second operand 5 states. [2018-11-06 19:41:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:41:01,527 INFO L93 Difference]: Finished difference Result 36058 states and 47103 transitions. [2018-11-06 19:41:01,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:41:01,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2018-11-06 19:41:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:41:01,582 INFO L225 Difference]: With dead ends: 36058 [2018-11-06 19:41:01,583 INFO L226 Difference]: Without dead ends: 23558 [2018-11-06 19:41:01,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:41:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23558 states. [2018-11-06 19:41:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23558 to 20103. [2018-11-06 19:41:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20103 states. [2018-11-06 19:41:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20103 states to 20103 states and 24657 transitions. [2018-11-06 19:41:01,960 INFO L78 Accepts]: Start accepts. Automaton has 20103 states and 24657 transitions. Word has length 227 [2018-11-06 19:41:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:41:01,961 INFO L480 AbstractCegarLoop]: Abstraction has 20103 states and 24657 transitions. [2018-11-06 19:41:01,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:41:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 20103 states and 24657 transitions. [2018-11-06 19:41:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-11-06 19:41:01,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:41:01,968 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:41:01,968 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:41:01,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:41:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -487714139, now seen corresponding path program 1 times [2018-11-06 19:41:01,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:41:01,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:41:01,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:01,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:41:01,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:41:02,484 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:41:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 285 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-06 19:41:02,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:41:02,962 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:41:02,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:41:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:41:03,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:41:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-11-06 19:41:03,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:41:03,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:41:03,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:41:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:41:03,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:41:03,449 INFO L87 Difference]: Start difference. First operand 20103 states and 24657 transitions. Second operand 6 states. [2018-11-06 19:41:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:41:17,621 INFO L93 Difference]: Finished difference Result 58186 states and 71459 transitions. [2018-11-06 19:41:17,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:41:17,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 410 [2018-11-06 19:41:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:41:17,671 INFO L225 Difference]: With dead ends: 58186 [2018-11-06 19:41:17,671 INFO L226 Difference]: Without dead ends: 30434 [2018-11-06 19:41:17,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 412 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:41:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30434 states. [2018-11-06 19:41:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30434 to 26973. [2018-11-06 19:41:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26973 states. [2018-11-06 19:41:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26973 states to 26973 states and 29360 transitions. [2018-11-06 19:41:18,139 INFO L78 Accepts]: Start accepts. Automaton has 26973 states and 29360 transitions. Word has length 410 [2018-11-06 19:41:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:41:18,140 INFO L480 AbstractCegarLoop]: Abstraction has 26973 states and 29360 transitions. [2018-11-06 19:41:18,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:41:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26973 states and 29360 transitions. [2018-11-06 19:41:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2018-11-06 19:41:18,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:41:18,173 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:41:18,174 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:41:18,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:41:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash 801439540, now seen corresponding path program 1 times [2018-11-06 19:41:18,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:41:18,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:41:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:41:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:41:19,417 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:41:19,648 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-11-06 19:41:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 30 proven. 419 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-06 19:41:20,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:41:20,956 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:41:20,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:41:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:41:21,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:41:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-11-06 19:41:21,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:41:21,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-06 19:41:21,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:41:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:41:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:41:21,646 INFO L87 Difference]: Start difference. First operand 26973 states and 29360 transitions. Second operand 9 states. [2018-11-06 19:41:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:41:37,819 INFO L93 Difference]: Finished difference Result 117806 states and 130992 transitions. [2018-11-06 19:41:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 19:41:37,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 941 [2018-11-06 19:41:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:41:37,977 INFO L225 Difference]: With dead ends: 117806 [2018-11-06 19:41:37,977 INFO L226 Difference]: Without dead ends: 91526 [2018-11-06 19:41:38,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 968 GetRequests, 950 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-06 19:41:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91526 states. [2018-11-06 19:41:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91526 to 35265. [2018-11-06 19:41:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35265 states. [2018-11-06 19:41:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35265 states to 35265 states and 38707 transitions. [2018-11-06 19:41:39,128 INFO L78 Accepts]: Start accepts. Automaton has 35265 states and 38707 transitions. Word has length 941 [2018-11-06 19:41:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:41:39,130 INFO L480 AbstractCegarLoop]: Abstraction has 35265 states and 38707 transitions. [2018-11-06 19:41:39,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:41:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 35265 states and 38707 transitions. [2018-11-06 19:41:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1164 [2018-11-06 19:41:39,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:41:39,205 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:41:39,205 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:41:39,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:41:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash -25764603, now seen corresponding path program 1 times [2018-11-06 19:41:39,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:41:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:41:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:39,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:41:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:41:40,140 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 19:41:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 923 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-11-06 19:41:40,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:41:40,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:41:40,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:41:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:41:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:41:40,692 INFO L87 Difference]: Start difference. First operand 35265 states and 38707 transitions. Second operand 4 states. [2018-11-06 19:41:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:41:46,068 INFO L93 Difference]: Finished difference Result 97482 states and 108238 transitions. [2018-11-06 19:41:46,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:41:46,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1163 [2018-11-06 19:41:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:41:46,147 INFO L225 Difference]: With dead ends: 97482 [2018-11-06 19:41:46,148 INFO L226 Difference]: Without dead ends: 62910 [2018-11-06 19:41:46,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:41:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62910 states. [2018-11-06 19:41:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62910 to 62910. [2018-11-06 19:41:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62910 states. [2018-11-06 19:41:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62910 states to 62910 states and 67813 transitions. [2018-11-06 19:41:46,934 INFO L78 Accepts]: Start accepts. Automaton has 62910 states and 67813 transitions. Word has length 1163 [2018-11-06 19:41:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:41:46,936 INFO L480 AbstractCegarLoop]: Abstraction has 62910 states and 67813 transitions. [2018-11-06 19:41:46,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:41:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 62910 states and 67813 transitions. [2018-11-06 19:41:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1178 [2018-11-06 19:41:46,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:41:46,961 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:41:46,962 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:41:46,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:41:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1119157346, now seen corresponding path program 1 times [2018-11-06 19:41:46,963 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:41:46,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:41:46,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:46,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:41:46,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:41:47,917 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:41:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 949 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2018-11-06 19:41:48,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:41:48,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:41:48,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:41:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:41:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:41:48,808 INFO L87 Difference]: Start difference. First operand 62910 states and 67813 transitions. Second operand 4 states. [2018-11-06 19:41:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:41:54,025 INFO L93 Difference]: Finished difference Result 160368 states and 173172 transitions. [2018-11-06 19:41:54,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:41:54,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1177 [2018-11-06 19:41:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:41:54,176 INFO L225 Difference]: With dead ends: 160368 [2018-11-06 19:41:54,176 INFO L226 Difference]: Without dead ends: 98151 [2018-11-06 19:41:54,245 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 19:41:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98151 states. [2018-11-06 19:41:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98151 to 96769. [2018-11-06 19:41:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96769 states. [2018-11-06 19:41:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96769 states to 96769 states and 103125 transitions. [2018-11-06 19:41:55,294 INFO L78 Accepts]: Start accepts. Automaton has 96769 states and 103125 transitions. Word has length 1177 [2018-11-06 19:41:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:41:55,296 INFO L480 AbstractCegarLoop]: Abstraction has 96769 states and 103125 transitions. [2018-11-06 19:41:55,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:41:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 96769 states and 103125 transitions. [2018-11-06 19:41:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2018-11-06 19:41:55,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:41:55,321 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:41:55,321 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:41:55,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:41:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash 941859746, now seen corresponding path program 1 times [2018-11-06 19:41:55,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:41:55,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:41:55,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:55,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:41:55,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:41:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:41:56,052 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:41:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 1020 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-11-06 19:41:56,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:41:56,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:41:56,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:41:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:41:56,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:41:56,914 INFO L87 Difference]: Start difference. First operand 96769 states and 103125 transitions. Second operand 4 states. [2018-11-06 19:42:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:42:02,211 INFO L93 Difference]: Finished difference Result 196991 states and 209761 transitions. [2018-11-06 19:42:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:42:02,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1213 [2018-11-06 19:42:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:42:02,337 INFO L225 Difference]: With dead ends: 196991 [2018-11-06 19:42:02,337 INFO L226 Difference]: Without dead ends: 100915 [2018-11-06 19:42:02,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:42:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100915 states. [2018-11-06 19:42:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100915 to 99533. [2018-11-06 19:42:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99533 states. [2018-11-06 19:42:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99533 states to 99533 states and 104529 transitions. [2018-11-06 19:42:04,131 INFO L78 Accepts]: Start accepts. Automaton has 99533 states and 104529 transitions. Word has length 1213 [2018-11-06 19:42:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:42:04,132 INFO L480 AbstractCegarLoop]: Abstraction has 99533 states and 104529 transitions. [2018-11-06 19:42:04,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:42:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 99533 states and 104529 transitions. [2018-11-06 19:42:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-11-06 19:42:04,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:42:04,164 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:42:04,164 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:42:04,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:42:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1638611681, now seen corresponding path program 1 times [2018-11-06 19:42:04,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:42:04,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:42:04,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:42:04,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:42:04,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:42:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:42:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1793 backedges. 781 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-06 19:42:06,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:42:06,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:42:06,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:42:06,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:42:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:42:06,309 INFO L87 Difference]: Start difference. First operand 99533 states and 104529 transitions. Second operand 4 states. [2018-11-06 19:42:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:42:11,171 INFO L93 Difference]: Finished difference Result 212193 states and 222875 transitions. [2018-11-06 19:42:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:42:11,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1354 [2018-11-06 19:42:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:42:11,297 INFO L225 Difference]: With dead ends: 212193 [2018-11-06 19:42:11,298 INFO L226 Difference]: Without dead ends: 113353 [2018-11-06 19:42:11,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:42:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113353 states. [2018-11-06 19:42:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113353 to 111971. [2018-11-06 19:42:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111971 states. [2018-11-06 19:42:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111971 states to 111971 states and 116643 transitions. [2018-11-06 19:42:12,321 INFO L78 Accepts]: Start accepts. Automaton has 111971 states and 116643 transitions. Word has length 1354 [2018-11-06 19:42:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:42:12,322 INFO L480 AbstractCegarLoop]: Abstraction has 111971 states and 116643 transitions. [2018-11-06 19:42:12,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:42:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 111971 states and 116643 transitions. [2018-11-06 19:42:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1460 [2018-11-06 19:42:12,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:42:12,354 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:42:12,355 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:42:12,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:42:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1015955712, now seen corresponding path program 1 times [2018-11-06 19:42:12,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:42:12,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:42:12,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:42:12,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:42:12,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:42:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:42:14,269 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-11-06 19:42:14,545 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-11-06 19:42:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2847 backedges. 1479 proven. 1047 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-06 19:42:18,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:42:18,573 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:42:18,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:42:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:42:18,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:42:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2847 backedges. 1780 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-06 19:42:20,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:42:20,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-11-06 19:42:20,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 19:42:20,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 19:42:20,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:42:20,102 INFO L87 Difference]: Start difference. First operand 111971 states and 116643 transitions. Second operand 12 states. [2018-11-06 19:42:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:42:37,527 INFO L93 Difference]: Finished difference Result 260543 states and 271419 transitions. [2018-11-06 19:42:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-06 19:42:37,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1459 [2018-11-06 19:42:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:42:37,674 INFO L225 Difference]: With dead ends: 260543 [2018-11-06 19:42:37,674 INFO L226 Difference]: Without dead ends: 149265 [2018-11-06 19:42:37,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1502 GetRequests, 1472 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2018-11-06 19:42:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149265 states. [2018-11-06 19:42:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149265 to 105056. [2018-11-06 19:42:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105056 states. [2018-11-06 19:42:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105056 states to 105056 states and 107945 transitions. [2018-11-06 19:42:38,782 INFO L78 Accepts]: Start accepts. Automaton has 105056 states and 107945 transitions. Word has length 1459 [2018-11-06 19:42:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:42:38,783 INFO L480 AbstractCegarLoop]: Abstraction has 105056 states and 107945 transitions. [2018-11-06 19:42:38,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 19:42:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 105056 states and 107945 transitions. [2018-11-06 19:42:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1484 [2018-11-06 19:42:38,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:42:38,814 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:42:38,814 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:42:38,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:42:38,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1795957083, now seen corresponding path program 1 times [2018-11-06 19:42:38,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:42:38,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:42:38,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:42:38,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:42:38,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:42:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:42:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2018-11-06 19:42:41,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:42:41,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:42:41,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:42:41,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:42:41,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:42:41,388 INFO L87 Difference]: Start difference. First operand 105056 states and 107945 transitions. Second operand 4 states. [2018-11-06 19:42:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:42:46,217 INFO L93 Difference]: Finished difference Result 209419 states and 215196 transitions. [2018-11-06 19:42:46,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:42:46,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1483 [2018-11-06 19:42:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:42:46,317 INFO L225 Difference]: With dead ends: 209419 [2018-11-06 19:42:46,317 INFO L226 Difference]: Without dead ends: 96056 [2018-11-06 19:42:46,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:42:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96056 states. [2018-11-06 19:42:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96056 to 95365. [2018-11-06 19:42:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95365 states. [2018-11-06 19:42:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95365 states to 95365 states and 97284 transitions. [2018-11-06 19:42:47,247 INFO L78 Accepts]: Start accepts. Automaton has 95365 states and 97284 transitions. Word has length 1483 [2018-11-06 19:42:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:42:47,248 INFO L480 AbstractCegarLoop]: Abstraction has 95365 states and 97284 transitions. [2018-11-06 19:42:47,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:42:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 95365 states and 97284 transitions. [2018-11-06 19:42:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1547 [2018-11-06 19:42:47,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:42:47,278 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:42:47,279 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:42:47,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:42:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash 49121253, now seen corresponding path program 1 times [2018-11-06 19:42:47,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:42:47,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:42:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:42:47,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:42:47,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:42:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:42:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1700 proven. 70 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-11-06 19:42:49,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:42:49,746 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:42:49,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:42:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:42:50,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:42:50,475 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2018-11-06 19:42:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2018-11-06 19:42:52,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:42:52,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 19:42:52,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:42:52,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:42:52,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:42:52,274 INFO L87 Difference]: Start difference. First operand 95365 states and 97284 transitions. Second operand 5 states. [2018-11-06 19:43:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:43:03,434 INFO L93 Difference]: Finished difference Result 206620 states and 210843 transitions. [2018-11-06 19:43:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:43:03,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1546 [2018-11-06 19:43:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:43:03,551 INFO L225 Difference]: With dead ends: 206620 [2018-11-06 19:43:03,551 INFO L226 Difference]: Without dead ends: 111948 [2018-11-06 19:43:03,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1554 GetRequests, 1548 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:43:03,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111948 states. [2018-11-06 19:43:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111948 to 105729. [2018-11-06 19:43:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105729 states. [2018-11-06 19:43:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105729 states to 105729 states and 107583 transitions. [2018-11-06 19:43:04,596 INFO L78 Accepts]: Start accepts. Automaton has 105729 states and 107583 transitions. Word has length 1546 [2018-11-06 19:43:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:43:04,597 INFO L480 AbstractCegarLoop]: Abstraction has 105729 states and 107583 transitions. [2018-11-06 19:43:04,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:43:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 105729 states and 107583 transitions. [2018-11-06 19:43:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1689 [2018-11-06 19:43:04,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:43:04,886 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:43:04,886 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:43:04,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:43:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1113072581, now seen corresponding path program 1 times [2018-11-06 19:43:04,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:43:04,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:43:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:43:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:43:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3392 backedges. 2161 proven. 0 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2018-11-06 19:43:07,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:43:07,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:43:07,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:43:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:43:07,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:43:07,257 INFO L87 Difference]: Start difference. First operand 105729 states and 107583 transitions. Second operand 4 states. [2018-11-06 19:43:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:43:11,587 INFO L93 Difference]: Finished difference Result 210074 states and 213770 transitions. [2018-11-06 19:43:11,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:43:11,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1688 [2018-11-06 19:43:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:43:11,685 INFO L225 Difference]: With dead ends: 210074 [2018-11-06 19:43:11,685 INFO L226 Difference]: Without dead ends: 105038 [2018-11-06 19:43:11,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:43:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105038 states. [2018-11-06 19:43:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105038 to 104347. [2018-11-06 19:43:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104347 states. [2018-11-06 19:43:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104347 states to 104347 states and 105827 transitions. [2018-11-06 19:43:12,641 INFO L78 Accepts]: Start accepts. Automaton has 104347 states and 105827 transitions. Word has length 1688 [2018-11-06 19:43:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:43:12,642 INFO L480 AbstractCegarLoop]: Abstraction has 104347 states and 105827 transitions. [2018-11-06 19:43:12,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:43:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 104347 states and 105827 transitions. [2018-11-06 19:43:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1707 [2018-11-06 19:43:12,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:43:12,689 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:43:12,689 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:43:12,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:43:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1345634122, now seen corresponding path program 1 times [2018-11-06 19:43:12,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:43:12,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:43:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:12,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:43:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:43:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2801 backedges. 2213 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-11-06 19:43:17,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:43:17,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:43:17,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:43:17,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:43:17,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:43:17,097 INFO L87 Difference]: Start difference. First operand 104347 states and 105827 transitions. Second operand 4 states. [2018-11-06 19:43:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:43:21,656 INFO L93 Difference]: Finished difference Result 227349 states and 230641 transitions. [2018-11-06 19:43:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:43:21,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1706 [2018-11-06 19:43:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:43:21,792 INFO L225 Difference]: With dead ends: 227349 [2018-11-06 19:43:21,792 INFO L226 Difference]: Without dead ends: 123003 [2018-11-06 19:43:21,853 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 19:43:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123003 states. [2018-11-06 19:43:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123003 to 119548. [2018-11-06 19:43:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119548 states. [2018-11-06 19:43:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119548 states to 119548 states and 121089 transitions. [2018-11-06 19:43:23,432 INFO L78 Accepts]: Start accepts. Automaton has 119548 states and 121089 transitions. Word has length 1706 [2018-11-06 19:43:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:43:23,432 INFO L480 AbstractCegarLoop]: Abstraction has 119548 states and 121089 transitions. [2018-11-06 19:43:23,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:43:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 119548 states and 121089 transitions. [2018-11-06 19:43:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1724 [2018-11-06 19:43:23,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:43:23,464 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:43:23,465 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:43:23,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:43:23,465 INFO L82 PathProgramCache]: Analyzing trace with hash 365289868, now seen corresponding path program 1 times [2018-11-06 19:43:23,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:43:23,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:43:23,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:23,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:43:23,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:43:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 2791 trivial. 0 not checked. [2018-11-06 19:43:25,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:43:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:43:25,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:43:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:43:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:43:25,473 INFO L87 Difference]: Start difference. First operand 119548 states and 121089 transitions. Second operand 3 states. [2018-11-06 19:43:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:43:28,800 INFO L93 Difference]: Finished difference Result 239785 states and 242883 transitions. [2018-11-06 19:43:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:43:28,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1723 [2018-11-06 19:43:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:43:28,917 INFO L225 Difference]: With dead ends: 239785 [2018-11-06 19:43:28,918 INFO L226 Difference]: Without dead ends: 120238 [2018-11-06 19:43:28,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:43:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120238 states. [2018-11-06 19:43:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120238 to 107109. [2018-11-06 19:43:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107109 states. [2018-11-06 19:43:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107109 states to 107109 states and 108399 transitions. [2018-11-06 19:43:30,013 INFO L78 Accepts]: Start accepts. Automaton has 107109 states and 108399 transitions. Word has length 1723 [2018-11-06 19:43:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:43:30,014 INFO L480 AbstractCegarLoop]: Abstraction has 107109 states and 108399 transitions. [2018-11-06 19:43:30,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:43:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 107109 states and 108399 transitions. [2018-11-06 19:43:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2018-11-06 19:43:30,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:43:30,047 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 7, 7, 7, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:43:30,048 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:43:30,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:43:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash 166708093, now seen corresponding path program 1 times [2018-11-06 19:43:30,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:43:30,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:43:30,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:30,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:43:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:43:31,461 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:43:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3615 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 2919 trivial. 0 not checked. [2018-11-06 19:43:33,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:43:33,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:43:33,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:43:33,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:43:33,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:43:33,134 INFO L87 Difference]: Start difference. First operand 107109 states and 108399 transitions. Second operand 4 states. [2018-11-06 19:43:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:43:37,457 INFO L93 Difference]: Finished difference Result 219744 states and 222398 transitions. [2018-11-06 19:43:37,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:43:37,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1727 [2018-11-06 19:43:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:43:37,563 INFO L225 Difference]: With dead ends: 219744 [2018-11-06 19:43:37,563 INFO L226 Difference]: Without dead ends: 113328 [2018-11-06 19:43:37,620 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 19:43:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113328 states. [2018-11-06 19:43:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113328 to 107109. [2018-11-06 19:43:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107109 states. [2018-11-06 19:43:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107109 states to 107109 states and 108370 transitions. [2018-11-06 19:43:38,835 INFO L78 Accepts]: Start accepts. Automaton has 107109 states and 108370 transitions. Word has length 1727 [2018-11-06 19:43:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:43:38,836 INFO L480 AbstractCegarLoop]: Abstraction has 107109 states and 108370 transitions. [2018-11-06 19:43:38,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:43:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 107109 states and 108370 transitions. [2018-11-06 19:43:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1831 [2018-11-06 19:43:38,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:43:38,876 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:43:38,876 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:43:38,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:43:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1839974445, now seen corresponding path program 1 times [2018-11-06 19:43:38,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:43:38,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:43:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:38,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:43:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:43:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:43:39,965 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:43:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3451 backedges. 2404 proven. 306 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-06 19:43:42,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:43:42,951 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:43:42,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:43:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:43:43,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:43:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3451 backedges. 2438 proven. 0 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2018-11-06 19:43:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:43:45,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-11-06 19:43:45,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:43:45,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:43:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:43:45,209 INFO L87 Difference]: Start difference. First operand 107109 states and 108370 transitions. Second operand 10 states. Received shutdown request... [2018-11-06 19:43:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 19:43:56,674 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:43:56,681 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:43:56,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:43:56 BoogieIcfgContainer [2018-11-06 19:43:56,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:43:56,682 INFO L168 Benchmark]: Toolchain (without parser) took 222684.28 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-06 19:43:56,683 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:43:56,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1848.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:43:56,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 561.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -899.5 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:43:56,686 INFO L168 Benchmark]: Boogie Preprocessor took 218.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:43:56,686 INFO L168 Benchmark]: RCFGBuilder took 7199.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 534.9 MB). Peak memory consumption was 534.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:43:56,687 INFO L168 Benchmark]: TraceAbstraction took 212849.67 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.3 GB). Free memory was 1.6 GB in the beginning and 2.2 GB in the end (delta: -652.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-06 19:43:56,692 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 1848.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 561.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -899.5 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 218.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7199.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 534.9 MB). Peak memory consumption was 534.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 212849.67 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.3 GB). Free memory was 1.6 GB in the beginning and 2.2 GB in the end (delta: -652.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 57). Cancelled while BasicCegarLoop was constructing difference of abstraction (107109states) and FLOYD_HOARE automaton (currently 15 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (100027 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 758 locations, 1 error locations. TIMEOUT Result, 212.7s OverallTime, 18 OverallIterations, 9 TraceHistogramMax, 149.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8596 SDtfs, 48253 SDslu, 1817 SDs, 0 SdLazy, 104934 SolverSat, 14331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6369 GetRequests, 6248 SyntacticMatches, 21 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119548occurred in iteration=15, 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: 14.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 146789 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 26109 NumberOfCodeBlocks, 26109 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 26086 ConstructedInterpolants, 86 QuantifiedInterpolants, 73800381 SizeOfPredicates, 3 NumberOfNonLiveVariables, 7168 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 38985/40831 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown