java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 20:09:55,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 20:09:55,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 20:09:55,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 20:09:55,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 20:09:55,843 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 20:09:55,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 20:09:55,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 20:09:55,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 20:09:55,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 20:09:55,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 20:09:55,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 20:09:55,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 20:09:55,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 20:09:55,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 20:09:55,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 20:09:55,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 20:09:55,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 20:09:55,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 20:09:55,873 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 20:09:55,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 20:09:55,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 20:09:55,887 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 20:09:55,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 20:09:55,887 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 20:09:55,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 20:09:55,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 20:09:55,893 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 20:09:55,894 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 20:09:55,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 20:09:55,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 20:09:55,899 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 20:09:55,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 20:09:55,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 20:09:55,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 20:09:55,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 20:09:55,902 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 20:09:55,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 20:09:55,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 20:09:55,922 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 20:09:55,922 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 20:09:55,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 20:09:55,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 20:09:55,924 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 20:09:55,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 20:09:55,924 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 20:09:55,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 20:09:55,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 20:09:55,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 20:09:55,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 20:09:55,925 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 20:09:55,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 20:09:55,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 20:09:55,926 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 20:09:55,926 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 20:09:55,927 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 20:09:55,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:09:55,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 20:09:55,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 20:09:55,927 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 20:09:55,928 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 20:09:55,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 20:09:55,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 20:09:55,929 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 20:09:55,930 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 20:09:55,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 20:09:55,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 20:09:56,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 20:09:56,003 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 20:09:56,003 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 20:09:56,004 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label23_true-unreach-call.c [2018-10-23 20:09:56,062 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9815d24b1/8c744f4a8e67402588e0208dadeada23/FLAGe28633fd9 [2018-10-23 20:09:56,831 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:09:56,832 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label23_true-unreach-call.c [2018-10-23 20:09:56,860 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9815d24b1/8c744f4a8e67402588e0208dadeada23/FLAGe28633fd9 [2018-10-23 20:09:56,876 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9815d24b1/8c744f4a8e67402588e0208dadeada23 [2018-10-23 20:09:56,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:09:56,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:09:56,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:09:56,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:09:56,896 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:09:56,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:09:56" (1/1) ... [2018-10-23 20:09:56,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b792d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:56, skipping insertion in model container [2018-10-23 20:09:56,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:09:56" (1/1) ... [2018-10-23 20:09:56,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:09:57,063 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:09:58,303 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:09:58,308 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:09:58,891 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:09:58,922 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:09:58,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58 WrapperNode [2018-10-23 20:09:58,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:09:58,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:09:58,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:09:58,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:09:58,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:09:59,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:09:59,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:09:59,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:09:59,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... [2018-10-23 20:09:59,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:09:59,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:09:59,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:09:59,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:09:59,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:09:59,999 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:10:00,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:10:00,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:10:10,247 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:10:10,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:10:10 BoogieIcfgContainer [2018-10-23 20:10:10,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:10:10,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:10:10,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:10:10,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:10:10,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:09:56" (1/3) ... [2018-10-23 20:10:10,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129d6f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:10:10, skipping insertion in model container [2018-10-23 20:10:10,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:09:58" (2/3) ... [2018-10-23 20:10:10,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129d6f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:10:10, skipping insertion in model container [2018-10-23 20:10:10,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:10:10" (3/3) ... [2018-10-23 20:10:10,258 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label23_true-unreach-call.c [2018-10-23 20:10:10,268 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:10:10,277 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:10:10,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:10:10,334 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:10:10,335 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:10:10,335 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:10:10,335 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:10:10,335 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:10:10,336 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:10:10,336 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:10:10,336 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:10:10,336 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:10:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-23 20:10:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-23 20:10:10,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:10:10,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:10:10,390 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:10:10,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:10:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1502078046, now seen corresponding path program 1 times [2018-10-23 20:10:10,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:10:10,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:10:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:10:10,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:10:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:10:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:10:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:10:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:10:10,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:10:10,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:10:10,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:10:10,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:10:10,806 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-10-23 20:10:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:10:25,271 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-10-23 20:10:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:10:25,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-23 20:10:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:10:25,317 INFO L225 Difference]: With dead ends: 3146 [2018-10-23 20:10:25,318 INFO L226 Difference]: Without dead ends: 2320 [2018-10-23 20:10:25,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:10:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-10-23 20:10:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-10-23 20:10:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-10-23 20:10:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3858 transitions. [2018-10-23 20:10:25,496 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3858 transitions. Word has length 36 [2018-10-23 20:10:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:10:25,498 INFO L481 AbstractCegarLoop]: Abstraction has 2320 states and 3858 transitions. [2018-10-23 20:10:25,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:10:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3858 transitions. [2018-10-23 20:10:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-23 20:10:25,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:10:25,503 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:10:25,503 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:10:25,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:10:25,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1839671471, now seen corresponding path program 1 times [2018-10-23 20:10:25,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:10:25,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:10:25,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:10:25,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:10:25,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:10:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:10:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:10:25,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:10:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:10:25,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:10:25,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:10:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:10:25,829 INFO L87 Difference]: Start difference. First operand 2320 states and 3858 transitions. Second operand 4 states. [2018-10-23 20:10:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:10:39,102 INFO L93 Difference]: Finished difference Result 9150 states and 15304 transitions. [2018-10-23 20:10:39,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:10:39,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-10-23 20:10:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:10:39,136 INFO L225 Difference]: With dead ends: 9150 [2018-10-23 20:10:39,136 INFO L226 Difference]: Without dead ends: 6832 [2018-10-23 20:10:39,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:10:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-10-23 20:10:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-10-23 20:10:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-10-23 20:10:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 9936 transitions. [2018-10-23 20:10:39,272 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 9936 transitions. Word has length 108 [2018-10-23 20:10:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:10:39,273 INFO L481 AbstractCegarLoop]: Abstraction has 6832 states and 9936 transitions. [2018-10-23 20:10:39,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:10:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 9936 transitions. [2018-10-23 20:10:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-23 20:10:39,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:10:39,280 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:10:39,281 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:10:39,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:10:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash 926228130, now seen corresponding path program 1 times [2018-10-23 20:10:39,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:10:39,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:10:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:10:39,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:10:39,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:10:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:10:39,655 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 20:10:39,835 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-10-23 20:10:40,335 WARN L179 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-10-23 20:10:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:10:40,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:10:40,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:10:40,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:10:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:10:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:10:40,548 INFO L87 Difference]: Start difference. First operand 6832 states and 9936 transitions. Second operand 6 states. [2018-10-23 20:10:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:10:54,651 INFO L93 Difference]: Finished difference Result 21934 states and 31609 transitions. [2018-10-23 20:10:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:10:54,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-10-23 20:10:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:10:54,714 INFO L225 Difference]: With dead ends: 21934 [2018-10-23 20:10:54,715 INFO L226 Difference]: Without dead ends: 15104 [2018-10-23 20:10:54,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:10:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15104 states. [2018-10-23 20:10:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15104 to 15104. [2018-10-23 20:10:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15104 states. [2018-10-23 20:10:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15104 states to 15104 states and 21135 transitions. [2018-10-23 20:10:55,039 INFO L78 Accepts]: Start accepts. Automaton has 15104 states and 21135 transitions. Word has length 114 [2018-10-23 20:10:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:10:55,040 INFO L481 AbstractCegarLoop]: Abstraction has 15104 states and 21135 transitions. [2018-10-23 20:10:55,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:10:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15104 states and 21135 transitions. [2018-10-23 20:10:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-23 20:10:55,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:10:55,051 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:10:55,051 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:10:55,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:10:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1799018400, now seen corresponding path program 1 times [2018-10-23 20:10:55,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:10:55,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:10:55,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:10:55,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:10:55,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:10:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:10:55,616 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-23 20:10:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 239 proven. 5 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-23 20:10:56,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:10:56,064 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:10:56,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:10:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:10:56,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:10:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-23 20:10:56,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:10:56,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-23 20:10:56,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:10:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:10:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:10:56,458 INFO L87 Difference]: Start difference. First operand 15104 states and 21135 transitions. Second operand 6 states. [2018-10-23 20:11:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:11:16,240 INFO L93 Difference]: Finished difference Result 65578 states and 91813 transitions. [2018-10-23 20:11:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 20:11:16,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-10-23 20:11:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:11:16,364 INFO L225 Difference]: With dead ends: 65578 [2018-10-23 20:11:16,365 INFO L226 Difference]: Without dead ends: 48969 [2018-10-23 20:11:16,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:11:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48969 states. [2018-10-23 20:11:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48969 to 26383. [2018-10-23 20:11:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26383 states. [2018-10-23 20:11:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26383 states to 26383 states and 31913 transitions. [2018-10-23 20:11:17,408 INFO L78 Accepts]: Start accepts. Automaton has 26383 states and 31913 transitions. Word has length 324 [2018-10-23 20:11:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:11:17,409 INFO L481 AbstractCegarLoop]: Abstraction has 26383 states and 31913 transitions. [2018-10-23 20:11:17,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:11:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 26383 states and 31913 transitions. [2018-10-23 20:11:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-10-23 20:11:17,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:11:17,436 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:11:17,437 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:11:17,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:11:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1446599930, now seen corresponding path program 1 times [2018-10-23 20:11:17,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:11:17,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:11:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:11:17,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:11:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:11:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:11:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-23 20:11:17,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:11:17,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:11:17,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:11:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:11:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:11:17,965 INFO L87 Difference]: Start difference. First operand 26383 states and 31913 transitions. Second operand 4 states. [2018-10-23 20:11:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:11:30,501 INFO L93 Difference]: Finished difference Result 64044 states and 77732 transitions. [2018-10-23 20:11:30,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:11:30,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2018-10-23 20:11:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:11:30,596 INFO L225 Difference]: With dead ends: 64044 [2018-10-23 20:11:30,597 INFO L226 Difference]: Without dead ends: 38415 [2018-10-23 20:11:30,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:11:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38415 states. [2018-10-23 20:11:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38415 to 38415. [2018-10-23 20:11:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38415 states. [2018-10-23 20:11:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38415 states to 38415 states and 45629 transitions. [2018-10-23 20:11:31,519 INFO L78 Accepts]: Start accepts. Automaton has 38415 states and 45629 transitions. Word has length 467 [2018-10-23 20:11:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:11:31,520 INFO L481 AbstractCegarLoop]: Abstraction has 38415 states and 45629 transitions. [2018-10-23 20:11:31,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:11:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 38415 states and 45629 transitions. [2018-10-23 20:11:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-10-23 20:11:31,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:11:31,556 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:11:31,556 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:11:31,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:11:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash 277246579, now seen corresponding path program 1 times [2018-10-23 20:11:31,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:11:31,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:11:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:11:31,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:11:31,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:11:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:11:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-23 20:11:32,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:11:32,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:11:32,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:11:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:11:32,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:11:32,014 INFO L87 Difference]: Start difference. First operand 38415 states and 45629 transitions. Second operand 3 states. [2018-10-23 20:11:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:11:38,540 INFO L93 Difference]: Finished difference Result 92620 states and 112241 transitions. [2018-10-23 20:11:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:11:38,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2018-10-23 20:11:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:11:38,635 INFO L225 Difference]: With dead ends: 92620 [2018-10-23 20:11:38,635 INFO L226 Difference]: Without dead ends: 54959 [2018-10-23 20:11:38,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:11:38,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54959 states. [2018-10-23 20:11:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54959 to 54959. [2018-10-23 20:11:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54959 states. [2018-10-23 20:11:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54959 states to 54959 states and 66627 transitions. [2018-10-23 20:11:39,258 INFO L78 Accepts]: Start accepts. Automaton has 54959 states and 66627 transitions. Word has length 484 [2018-10-23 20:11:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:11:39,259 INFO L481 AbstractCegarLoop]: Abstraction has 54959 states and 66627 transitions. [2018-10-23 20:11:39,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:11:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 54959 states and 66627 transitions. [2018-10-23 20:11:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-10-23 20:11:39,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:11:39,313 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:11:39,313 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:11:39,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:11:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1215082638, now seen corresponding path program 1 times [2018-10-23 20:11:39,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:11:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:11:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:11:39,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:11:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:11:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:11:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 429 proven. 4 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-10-23 20:11:40,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:11:40,380 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:11:40,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:11:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:11:40,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:11:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-23 20:11:40,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:11:40,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-23 20:11:40,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:11:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:11:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:11:40,747 INFO L87 Difference]: Start difference. First operand 54959 states and 66627 transitions. Second operand 4 states. [2018-10-23 20:11:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:11:52,137 INFO L93 Difference]: Finished difference Result 175394 states and 213428 transitions. [2018-10-23 20:11:52,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:11:52,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 612 [2018-10-23 20:11:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:11:52,288 INFO L225 Difference]: With dead ends: 175394 [2018-10-23 20:11:52,288 INFO L226 Difference]: Without dead ends: 121189 [2018-10-23 20:11:52,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 612 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:11:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121189 states. [2018-10-23 20:11:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121189 to 81279. [2018-10-23 20:11:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81279 states. [2018-10-23 20:11:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81279 states to 81279 states and 96271 transitions. [2018-10-23 20:11:53,474 INFO L78 Accepts]: Start accepts. Automaton has 81279 states and 96271 transitions. Word has length 612 [2018-10-23 20:11:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:11:53,475 INFO L481 AbstractCegarLoop]: Abstraction has 81279 states and 96271 transitions. [2018-10-23 20:11:53,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:11:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 81279 states and 96271 transitions. [2018-10-23 20:11:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2018-10-23 20:11:53,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:11:53,543 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:11:53,543 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:11:53,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:11:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash -335196038, now seen corresponding path program 1 times [2018-10-23 20:11:53,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:11:53,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:11:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:11:53,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:11:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:11:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:11:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-23 20:11:54,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:11:54,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:11:54,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:11:54,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:11:54,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:11:54,127 INFO L87 Difference]: Start difference. First operand 81279 states and 96271 transitions. Second operand 3 states. [2018-10-23 20:11:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:11:59,859 INFO L93 Difference]: Finished difference Result 176844 states and 209208 transitions. [2018-10-23 20:11:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:11:59,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 620 [2018-10-23 20:11:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:11:59,976 INFO L225 Difference]: With dead ends: 176844 [2018-10-23 20:11:59,976 INFO L226 Difference]: Without dead ends: 96319 [2018-10-23 20:12:00,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:12:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96319 states. [2018-10-23 20:12:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96319 to 94815. [2018-10-23 20:12:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94815 states. [2018-10-23 20:12:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94815 states to 94815 states and 109062 transitions. [2018-10-23 20:12:01,407 INFO L78 Accepts]: Start accepts. Automaton has 94815 states and 109062 transitions. Word has length 620 [2018-10-23 20:12:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:12:01,408 INFO L481 AbstractCegarLoop]: Abstraction has 94815 states and 109062 transitions. [2018-10-23 20:12:01,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:12:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 94815 states and 109062 transitions. [2018-10-23 20:12:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2018-10-23 20:12:01,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:12:01,430 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:12:01,430 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:12:01,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:12:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1900591059, now seen corresponding path program 1 times [2018-10-23 20:12:01,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:12:01,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:12:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:12:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:12:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 592 proven. 5 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-23 20:12:01,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:12:01,904 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:12:01,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:12:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:12:02,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:12:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-23 20:12:02,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:12:02,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-23 20:12:02,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:12:02,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:12:02,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:12:02,547 INFO L87 Difference]: Start difference. First operand 94815 states and 109062 transitions. Second operand 5 states. [2018-10-23 20:12:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:12:15,846 INFO L93 Difference]: Finished difference Result 242268 states and 279453 transitions. [2018-10-23 20:12:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 20:12:15,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 638 [2018-10-23 20:12:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:12:16,025 INFO L225 Difference]: With dead ends: 242268 [2018-10-23 20:12:16,025 INFO L226 Difference]: Without dead ends: 148207 [2018-10-23 20:12:16,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:12:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148207 states. [2018-10-23 20:12:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148207 to 145951. [2018-10-23 20:12:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145951 states. [2018-10-23 20:12:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145951 states to 145951 states and 160553 transitions. [2018-10-23 20:12:18,201 INFO L78 Accepts]: Start accepts. Automaton has 145951 states and 160553 transitions. Word has length 638 [2018-10-23 20:12:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:12:18,201 INFO L481 AbstractCegarLoop]: Abstraction has 145951 states and 160553 transitions. [2018-10-23 20:12:18,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:12:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 145951 states and 160553 transitions. [2018-10-23 20:12:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2018-10-23 20:12:18,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:12:18,237 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:12:18,237 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:12:18,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:12:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash 736340522, now seen corresponding path program 1 times [2018-10-23 20:12:18,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:12:18,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:12:18,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:18,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:12:18,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:12:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-23 20:12:19,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:12:19,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:12:19,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:12:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:12:19,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:12:19,015 INFO L87 Difference]: Start difference. First operand 145951 states and 160553 transitions. Second operand 4 states. [2018-10-23 20:12:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:12:29,884 INFO L93 Difference]: Finished difference Result 291900 states and 321286 transitions. [2018-10-23 20:12:29,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:12:29,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 652 [2018-10-23 20:12:29,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:12:30,050 INFO L225 Difference]: With dead ends: 291900 [2018-10-23 20:12:30,050 INFO L226 Difference]: Without dead ends: 146703 [2018-10-23 20:12:30,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:12:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146703 states. [2018-10-23 20:12:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146703 to 145199. [2018-10-23 20:12:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145199 states. [2018-10-23 20:12:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145199 states to 145199 states and 152295 transitions. [2018-10-23 20:12:31,425 INFO L78 Accepts]: Start accepts. Automaton has 145199 states and 152295 transitions. Word has length 652 [2018-10-23 20:12:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:12:31,426 INFO L481 AbstractCegarLoop]: Abstraction has 145199 states and 152295 transitions. [2018-10-23 20:12:31,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:12:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 145199 states and 152295 transitions. [2018-10-23 20:12:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2018-10-23 20:12:31,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:12:31,458 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:12:31,458 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:12:31,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:12:31,459 INFO L82 PathProgramCache]: Analyzing trace with hash -227132084, now seen corresponding path program 1 times [2018-10-23 20:12:31,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:12:31,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:12:31,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:31,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:12:31,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:12:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-23 20:12:33,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:12:33,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:12:33,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:12:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:12:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:12:33,015 INFO L87 Difference]: Start difference. First operand 145199 states and 152295 transitions. Second operand 3 states. [2018-10-23 20:12:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:12:41,610 INFO L93 Difference]: Finished difference Result 325739 states and 342008 transitions. [2018-10-23 20:12:41,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:12:41,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 653 [2018-10-23 20:12:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:12:41,825 INFO L225 Difference]: With dead ends: 325739 [2018-10-23 20:12:41,825 INFO L226 Difference]: Without dead ends: 181294 [2018-10-23 20:12:41,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:12:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181294 states. [2018-10-23 20:12:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181294 to 179790. [2018-10-23 20:12:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179790 states. [2018-10-23 20:12:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179790 states to 179790 states and 187725 transitions. [2018-10-23 20:12:44,660 INFO L78 Accepts]: Start accepts. Automaton has 179790 states and 187725 transitions. Word has length 653 [2018-10-23 20:12:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:12:44,661 INFO L481 AbstractCegarLoop]: Abstraction has 179790 states and 187725 transitions. [2018-10-23 20:12:44,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:12:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 179790 states and 187725 transitions. [2018-10-23 20:12:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2018-10-23 20:12:44,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:12:44,711 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:12:44,711 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:12:44,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:12:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash 613313174, now seen corresponding path program 1 times [2018-10-23 20:12:44,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:12:44,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:12:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:44,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:12:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:12:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-23 20:12:46,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:12:46,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:12:46,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:12:46,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:12:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:12:46,605 INFO L87 Difference]: Start difference. First operand 179790 states and 187725 transitions. Second operand 4 states. [2018-10-23 20:12:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:12:54,302 INFO L93 Difference]: Finished difference Result 360330 states and 376210 transitions. [2018-10-23 20:12:54,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:12:54,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 785 [2018-10-23 20:12:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:12:54,547 INFO L225 Difference]: With dead ends: 360330 [2018-10-23 20:12:54,548 INFO L226 Difference]: Without dead ends: 173764 [2018-10-23 20:12:54,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:12:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173764 states. [2018-10-23 20:12:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173764 to 167748. [2018-10-23 20:12:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167748 states. [2018-10-23 20:12:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167748 states to 167748 states and 173712 transitions. [2018-10-23 20:12:57,032 INFO L78 Accepts]: Start accepts. Automaton has 167748 states and 173712 transitions. Word has length 785 [2018-10-23 20:12:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:12:57,032 INFO L481 AbstractCegarLoop]: Abstraction has 167748 states and 173712 transitions. [2018-10-23 20:12:57,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:12:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 167748 states and 173712 transitions. [2018-10-23 20:12:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2018-10-23 20:12:57,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:12:57,066 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:12:57,066 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:12:57,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:12:57,066 INFO L82 PathProgramCache]: Analyzing trace with hash 850929166, now seen corresponding path program 1 times [2018-10-23 20:12:57,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:12:57,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:12:57,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:57,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:12:57,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:12:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:13:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-23 20:13:02,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:13:02,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:13:02,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:13:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:13:02,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:13:02,682 INFO L87 Difference]: Start difference. First operand 167748 states and 173712 transitions. Second operand 5 states. [2018-10-23 20:13:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:13:14,140 INFO L93 Difference]: Finished difference Result 472382 states and 489656 transitions. [2018-10-23 20:13:14,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:13:14,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 800 [2018-10-23 20:13:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:13:14,141 INFO L225 Difference]: With dead ends: 472382 [2018-10-23 20:13:14,141 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 20:13:14,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:13:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 20:13:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 20:13:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 20:13:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 20:13:14,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 800 [2018-10-23 20:13:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:13:14,268 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 20:13:14,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:13:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 20:13:14,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 20:13:14,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 20:13:14,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:15,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:16,917 WARN L179 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 732 DAG size of output: 566 [2018-10-23 20:13:17,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:17,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:18,753 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 732 DAG size of output: 566 [2018-10-23 20:13:19,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:19,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:20,294 WARN L179 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 732 DAG size of output: 566 [2018-10-23 20:13:20,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:20,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:21,811 WARN L179 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 732 DAG size of output: 566 [2018-10-23 20:13:22,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:22,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:13:23,261 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 732 DAG size of output: 566 [2018-10-23 20:13:28,823 WARN L179 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 562 DAG size of output: 62 [2018-10-23 20:13:34,381 WARN L179 SmtUtils]: Spent 5.55 s on a formula simplification. DAG size of input: 562 DAG size of output: 62 Received shutdown request... [2018-10-23 20:13:39,310 WARN L187 SmtUtils]: Removed 5 from assertion stack [2018-10-23 20:13:39,310 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-10-23 20:13:39,311 INFO L168 Benchmark]: Toolchain (without parser) took 222422.50 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-23 20:13:39,312 INFO L168 Benchmark]: CDTParser took 0.21 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-10-23 20:13:39,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2032.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-23 20:13:39,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 670.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 804.8 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -997.0 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. [2018-10-23 20:13:39,315 INFO L168 Benchmark]: Boogie Preprocessor took 321.99 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2018-10-23 20:13:39,315 INFO L168 Benchmark]: RCFGBuilder took 10330.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 214.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -164.3 MB). Peak memory consumption was 627.6 MB. Max. memory is 7.1 GB. [2018-10-23 20:13:39,319 INFO L168 Benchmark]: TraceAbstraction took 209060.74 ms. Allocated memory was 2.6 GB in the beginning and 4.5 GB in the end (delta: 2.0 GB). Free memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: -771.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-23 20:13:39,324 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.21 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 2032.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 670.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 804.8 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -997.0 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 321.99 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10330.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 214.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -164.3 MB). Peak memory consumption was 627.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209060.74 ms. Allocated memory was 2.6 GB in the beginning and 4.5 GB in the end (delta: 2.0 GB). Free memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: -771.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 117]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 562. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown