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/Problem12_label04_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:07:28,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:07:28,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:07:28,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:07:28,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:07:28,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:07:28,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:07:28,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:07:28,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:07:28,829 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:07:28,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:07:28,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:07:28,832 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:07:28,833 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:07:28,834 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:07:28,835 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:07:28,836 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:07:28,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:07:28,840 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:07:28,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:07:28,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:07:28,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:07:28,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:07:28,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:07:28,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:07:28,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:07:28,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:07:28,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:07:28,852 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:07:28,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:07:28,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:07:28,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:07:28,855 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:07:28,855 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:07:28,856 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:07:28,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:07:28,857 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:07:28,873 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:07:28,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:07:28,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:07:28,875 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:07:28,876 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:07:28,876 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:07:28,876 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:07:28,877 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:07:28,877 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:07:28,877 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:07:28,877 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:07:28,877 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:07:28,878 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:07:28,878 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:07:28,878 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:07:28,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:07:28,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:07:28,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:07:28,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:07:28,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:07:28,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:07:28,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:07:28,880 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:07:28,880 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:07:28,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:07:28,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:07:28,881 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:07:28,881 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:07:28,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:07:28,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:07:28,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:07:28,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:07:28,948 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:07:28,949 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label04_true-unreach-call.c [2018-11-06 21:07:29,017 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c77696c3/cd5d8a3b817645e9bb7ebfd66a1b14a3/FLAG5ef406f09 [2018-11-06 21:07:29,838 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:07:29,839 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label04_true-unreach-call.c [2018-11-06 21:07:29,868 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c77696c3/cd5d8a3b817645e9bb7ebfd66a1b14a3/FLAG5ef406f09 [2018-11-06 21:07:29,885 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c77696c3/cd5d8a3b817645e9bb7ebfd66a1b14a3 [2018-11-06 21:07:29,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:07:29,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:07:29,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:07:29,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:07:29,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:07:29,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:07:29" (1/1) ... [2018-11-06 21:07:29,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19823fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:29, skipping insertion in model container [2018-11-06 21:07:29,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:07:29" (1/1) ... [2018-11-06 21:07:29,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:07:30,087 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:07:31,378 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:07:31,384 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:07:31,995 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:07:32,031 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:07:32,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32 WrapperNode [2018-11-06 21:07:32,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:07:32,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:07:32,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:07:32,035 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:07:32,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:32,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:32,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:07:32,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:07:32,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:07:32,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:07:32,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:32,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:32,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:32,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:32,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:32,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:32,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... [2018-11-06 21:07:33,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:07:33,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:07:33,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:07:33,075 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:07:33,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:07:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:07:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:07:33,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:07:41,247 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:07:41,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:07:41 BoogieIcfgContainer [2018-11-06 21:07:41,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:07:41,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:07:41,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:07:41,252 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:07:41,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:07:29" (1/3) ... [2018-11-06 21:07:41,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcfc81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:07:41, skipping insertion in model container [2018-11-06 21:07:41,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:07:32" (2/3) ... [2018-11-06 21:07:41,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcfc81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:07:41, skipping insertion in model container [2018-11-06 21:07:41,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:07:41" (3/3) ... [2018-11-06 21:07:41,257 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label04_true-unreach-call.c [2018-11-06 21:07:41,267 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:07:41,277 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:07:41,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:07:41,339 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:07:41,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:07:41,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:07:41,341 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:07:41,341 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:07:41,341 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:07:41,341 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:07:41,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:07:41,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:07:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-11-06 21:07:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-06 21:07:41,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:07:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:07:41,390 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:07:41,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:07:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1059493314, now seen corresponding path program 1 times [2018-11-06 21:07:41,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:07:41,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:07:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:41,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:07:41,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:07:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:07:41,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:07:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:07:41,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:07:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:07:41,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:07:41,885 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-11-06 21:07:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:07:54,117 INFO L93 Difference]: Finished difference Result 3162 states and 6150 transitions. [2018-11-06 21:07:54,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:07:54,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-11-06 21:07:54,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:07:54,171 INFO L225 Difference]: With dead ends: 3162 [2018-11-06 21:07:54,171 INFO L226 Difference]: Without dead ends: 2336 [2018-11-06 21:07:54,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:07:54,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2018-11-06 21:07:54,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1568. [2018-11-06 21:07:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2018-11-06 21:07:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2556 transitions. [2018-11-06 21:07:54,373 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2556 transitions. Word has length 61 [2018-11-06 21:07:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:07:54,375 INFO L480 AbstractCegarLoop]: Abstraction has 1568 states and 2556 transitions. [2018-11-06 21:07:54,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:07:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2556 transitions. [2018-11-06 21:07:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-06 21:07:54,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:07:54,388 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:07:54,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:07:54,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:07:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash 165959356, now seen corresponding path program 1 times [2018-11-06 21:07:54,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:07:54,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:07:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:07:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:07:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:07:54,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:07:54,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:07:54,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:07:54,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:07:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:07:54,692 INFO L87 Difference]: Start difference. First operand 1568 states and 2556 transitions. Second operand 4 states. [2018-11-06 21:08:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:05,186 INFO L93 Difference]: Finished difference Result 6142 states and 10096 transitions. [2018-11-06 21:08:05,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:08:05,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-11-06 21:08:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:05,212 INFO L225 Difference]: With dead ends: 6142 [2018-11-06 21:08:05,212 INFO L226 Difference]: Without dead ends: 4576 [2018-11-06 21:08:05,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:08:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2018-11-06 21:08:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4576. [2018-11-06 21:08:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4576 states. [2018-11-06 21:08:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 6531 transitions. [2018-11-06 21:08:05,307 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 6531 transitions. Word has length 137 [2018-11-06 21:08:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:05,308 INFO L480 AbstractCegarLoop]: Abstraction has 4576 states and 6531 transitions. [2018-11-06 21:08:05,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:08:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 6531 transitions. [2018-11-06 21:08:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-06 21:08:05,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:08:05,312 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:08:05,312 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:08:05,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:08:05,312 INFO L82 PathProgramCache]: Analyzing trace with hash -947691967, now seen corresponding path program 1 times [2018-11-06 21:08:05,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:08:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:08:05,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:05,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:05,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:08:05,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:08:05,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:08:05,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:08:05,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:08:05,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:08:05,982 INFO L87 Difference]: Start difference. First operand 4576 states and 6531 transitions. Second operand 6 states. [2018-11-06 21:08:06,165 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-06 21:08:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:16,209 INFO L93 Difference]: Finished difference Result 15166 states and 21142 transitions. [2018-11-06 21:08:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:08:16,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-11-06 21:08:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:16,263 INFO L225 Difference]: With dead ends: 15166 [2018-11-06 21:08:16,263 INFO L226 Difference]: Without dead ends: 10592 [2018-11-06 21:08:16,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:08:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10592 states. [2018-11-06 21:08:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10592 to 10592. [2018-11-06 21:08:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10592 states. [2018-11-06 21:08:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10592 states to 10592 states and 14292 transitions. [2018-11-06 21:08:16,482 INFO L78 Accepts]: Start accepts. Automaton has 10592 states and 14292 transitions. Word has length 139 [2018-11-06 21:08:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:16,483 INFO L480 AbstractCegarLoop]: Abstraction has 10592 states and 14292 transitions. [2018-11-06 21:08:16,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:08:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 10592 states and 14292 transitions. [2018-11-06 21:08:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-06 21:08:16,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:08:16,488 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:08:16,493 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:08:16,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:08:16,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1986074575, now seen corresponding path program 1 times [2018-11-06 21:08:16,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:08:16,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:08:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 159 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 21:08:17,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:08:17,069 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:08:17,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:17,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:08:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:08:17,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:08:17,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 21:08:17,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:08:17,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:08:17,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:08:17,328 INFO L87 Difference]: Start difference. First operand 10592 states and 14292 transitions. Second operand 7 states. [2018-11-06 21:08:18,410 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-11-06 21:08:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:36,019 INFO L93 Difference]: Finished difference Result 41518 states and 54744 transitions. [2018-11-06 21:08:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:08:36,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 211 [2018-11-06 21:08:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:36,099 INFO L225 Difference]: With dead ends: 41518 [2018-11-06 21:08:36,100 INFO L226 Difference]: Without dead ends: 29421 [2018-11-06 21:08:36,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:08:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29421 states. [2018-11-06 21:08:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29421 to 20367. [2018-11-06 21:08:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20367 states. [2018-11-06 21:08:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20367 states to 20367 states and 25010 transitions. [2018-11-06 21:08:36,538 INFO L78 Accepts]: Start accepts. Automaton has 20367 states and 25010 transitions. Word has length 211 [2018-11-06 21:08:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:36,539 INFO L480 AbstractCegarLoop]: Abstraction has 20367 states and 25010 transitions. [2018-11-06 21:08:36,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:08:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 20367 states and 25010 transitions. [2018-11-06 21:08:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-06 21:08:36,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:08:36,546 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:08:36,546 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:08:36,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:08:36,547 INFO L82 PathProgramCache]: Analyzing trace with hash 61082558, now seen corresponding path program 1 times [2018-11-06 21:08:36,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:08:36,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:08:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:36,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-06 21:08:36,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:08:36,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:08:36,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:08:36,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:08:36,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:08:36,912 INFO L87 Difference]: Start difference. First operand 20367 states and 25010 transitions. Second operand 3 states. [2018-11-06 21:08:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:41,184 INFO L93 Difference]: Finished difference Result 46748 states and 57858 transitions. [2018-11-06 21:08:41,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:08:41,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2018-11-06 21:08:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:41,237 INFO L225 Difference]: With dead ends: 46748 [2018-11-06 21:08:41,237 INFO L226 Difference]: Without dead ends: 27135 [2018-11-06 21:08:41,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:08:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27135 states. [2018-11-06 21:08:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27135 to 27135. [2018-11-06 21:08:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27135 states. [2018-11-06 21:08:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27135 states to 27135 states and 32871 transitions. [2018-11-06 21:08:41,641 INFO L78 Accepts]: Start accepts. Automaton has 27135 states and 32871 transitions. Word has length 293 [2018-11-06 21:08:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:41,642 INFO L480 AbstractCegarLoop]: Abstraction has 27135 states and 32871 transitions. [2018-11-06 21:08:41,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:08:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27135 states and 32871 transitions. [2018-11-06 21:08:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-11-06 21:08:41,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:08:41,651 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:08:41,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:08:41,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:08:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1506042153, now seen corresponding path program 1 times [2018-11-06 21:08:41,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:08:41,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:08:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:41,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-06 21:08:41,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:08:42,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:08:42,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:08:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:08:42,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:08:42,001 INFO L87 Difference]: Start difference. First operand 27135 states and 32871 transitions. Second operand 3 states. [2018-11-06 21:08:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:46,215 INFO L93 Difference]: Finished difference Result 53516 states and 64983 transitions. [2018-11-06 21:08:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:08:46,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 363 [2018-11-06 21:08:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:46,272 INFO L225 Difference]: With dead ends: 53516 [2018-11-06 21:08:46,272 INFO L226 Difference]: Without dead ends: 27135 [2018-11-06 21:08:46,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:08:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27135 states. [2018-11-06 21:08:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27135 to 25631. [2018-11-06 21:08:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25631 states. [2018-11-06 21:08:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25631 states to 25631 states and 29966 transitions. [2018-11-06 21:08:46,623 INFO L78 Accepts]: Start accepts. Automaton has 25631 states and 29966 transitions. Word has length 363 [2018-11-06 21:08:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:46,624 INFO L480 AbstractCegarLoop]: Abstraction has 25631 states and 29966 transitions. [2018-11-06 21:08:46,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:08:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 25631 states and 29966 transitions. [2018-11-06 21:08:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-11-06 21:08:46,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:08:46,637 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:08:46,637 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:08:46,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:08:46,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1983113583, now seen corresponding path program 1 times [2018-11-06 21:08:46,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:08:46,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:08:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:46,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-06 21:08:47,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:08:47,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:08:47,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:08:47,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:08:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:08:47,481 INFO L87 Difference]: Start difference. First operand 25631 states and 29966 transitions. Second operand 4 states. [2018-11-06 21:08:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:55,170 INFO L93 Difference]: Finished difference Result 87356 states and 102501 transitions. [2018-11-06 21:08:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:08:55,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2018-11-06 21:08:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:55,254 INFO L225 Difference]: With dead ends: 87356 [2018-11-06 21:08:55,254 INFO L226 Difference]: Without dead ends: 59459 [2018-11-06 21:08:55,283 INFO L604 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-11-06 21:08:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59459 states. [2018-11-06 21:08:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59459 to 54195. [2018-11-06 21:08:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54195 states. [2018-11-06 21:08:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54195 states to 54195 states and 61228 transitions. [2018-11-06 21:08:55,954 INFO L78 Accepts]: Start accepts. Automaton has 54195 states and 61228 transitions. Word has length 391 [2018-11-06 21:08:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:55,955 INFO L480 AbstractCegarLoop]: Abstraction has 54195 states and 61228 transitions. [2018-11-06 21:08:55,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:08:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 54195 states and 61228 transitions. [2018-11-06 21:08:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-11-06 21:08:55,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:08:55,969 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:08:55,969 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:08:55,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:08:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash -770153544, now seen corresponding path program 1 times [2018-11-06 21:08:55,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:08:55,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:08:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:55,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-06 21:08:56,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:08:56,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:08:56,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:08:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:08:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:08:56,749 INFO L87 Difference]: Start difference. First operand 54195 states and 61228 transitions. Second operand 3 states. [2018-11-06 21:09:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:09:01,451 INFO L93 Difference]: Finished difference Result 133204 states and 151992 transitions. [2018-11-06 21:09:01,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:09:01,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2018-11-06 21:09:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:09:01,545 INFO L225 Difference]: With dead ends: 133204 [2018-11-06 21:09:01,545 INFO L226 Difference]: Without dead ends: 79763 [2018-11-06 21:09:01,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:09:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79763 states. [2018-11-06 21:09:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79763 to 79763. [2018-11-06 21:09:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79763 states. [2018-11-06 21:09:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79763 states to 79763 states and 90532 transitions. [2018-11-06 21:09:02,463 INFO L78 Accepts]: Start accepts. Automaton has 79763 states and 90532 transitions. Word has length 402 [2018-11-06 21:09:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:09:02,464 INFO L480 AbstractCegarLoop]: Abstraction has 79763 states and 90532 transitions. [2018-11-06 21:09:02,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:09:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 79763 states and 90532 transitions. [2018-11-06 21:09:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-06 21:09:02,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:09:02,482 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:09:02,482 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:09:02,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:09:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1633068981, now seen corresponding path program 1 times [2018-11-06 21:09:02,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:09:02,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:09:02,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:02,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:09:02,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:09:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-06 21:09:03,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:09:03,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:09:03,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:09:03,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:09:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:09:03,070 INFO L87 Difference]: Start difference. First operand 79763 states and 90532 transitions. Second operand 4 states. [2018-11-06 21:09:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:09:09,768 INFO L93 Difference]: Finished difference Result 158772 states and 180305 transitions. [2018-11-06 21:09:09,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:09:09,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2018-11-06 21:09:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:09:09,876 INFO L225 Difference]: With dead ends: 158772 [2018-11-06 21:09:09,876 INFO L226 Difference]: Without dead ends: 79763 [2018-11-06 21:09:09,924 INFO L604 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-11-06 21:09:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79763 states. [2018-11-06 21:09:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79763 to 79763. [2018-11-06 21:09:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79763 states. [2018-11-06 21:09:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79763 states to 79763 states and 86954 transitions. [2018-11-06 21:09:10,822 INFO L78 Accepts]: Start accepts. Automaton has 79763 states and 86954 transitions. Word has length 419 [2018-11-06 21:09:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:09:10,823 INFO L480 AbstractCegarLoop]: Abstraction has 79763 states and 86954 transitions. [2018-11-06 21:09:10,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:09:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 79763 states and 86954 transitions. [2018-11-06 21:09:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-11-06 21:09:10,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:09:10,834 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:09:10,834 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:09:10,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:09:10,835 INFO L82 PathProgramCache]: Analyzing trace with hash 702803135, now seen corresponding path program 1 times [2018-11-06 21:09:10,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:09:10,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:09:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:10,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:09:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:09:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-06 21:09:11,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:09:11,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:09:11,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:09:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:09:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:09:11,405 INFO L87 Difference]: Start difference. First operand 79763 states and 86954 transitions. Second operand 4 states. [2018-11-06 21:09:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:09:19,903 INFO L93 Difference]: Finished difference Result 205396 states and 223119 transitions. [2018-11-06 21:09:19,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:09:19,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2018-11-06 21:09:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:09:20,026 INFO L225 Difference]: With dead ends: 205396 [2018-11-06 21:09:20,026 INFO L226 Difference]: Without dead ends: 126387 [2018-11-06 21:09:20,061 INFO L604 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-11-06 21:09:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126387 states. [2018-11-06 21:09:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126387 to 111347. [2018-11-06 21:09:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111347 states. [2018-11-06 21:09:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111347 states to 111347 states and 119692 transitions. [2018-11-06 21:09:20,986 INFO L78 Accepts]: Start accepts. Automaton has 111347 states and 119692 transitions. Word has length 423 [2018-11-06 21:09:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:09:20,987 INFO L480 AbstractCegarLoop]: Abstraction has 111347 states and 119692 transitions. [2018-11-06 21:09:20,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:09:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 111347 states and 119692 transitions. [2018-11-06 21:09:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-11-06 21:09:21,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:09:21,010 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:09:21,010 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:09:21,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:09:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1094920460, now seen corresponding path program 1 times [2018-11-06 21:09:21,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:09:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:09:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:21,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:09:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:09:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-06 21:09:21,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:09:21,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:09:21,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:09:21,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:09:21,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:09:21,333 INFO L87 Difference]: Start difference. First operand 111347 states and 119692 transitions. Second operand 3 states. [2018-11-06 21:09:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:09:26,388 INFO L93 Difference]: Finished difference Result 235476 states and 253237 transitions. [2018-11-06 21:09:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:09:26,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 506 [2018-11-06 21:09:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:09:26,534 INFO L225 Difference]: With dead ends: 235476 [2018-11-06 21:09:26,534 INFO L226 Difference]: Without dead ends: 124883 [2018-11-06 21:09:26,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:09:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124883 states. [2018-11-06 21:09:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124883 to 121123. [2018-11-06 21:09:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121123 states. [2018-11-06 21:09:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121123 states to 121123 states and 128712 transitions. [2018-11-06 21:09:27,545 INFO L78 Accepts]: Start accepts. Automaton has 121123 states and 128712 transitions. Word has length 506 [2018-11-06 21:09:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:09:27,546 INFO L480 AbstractCegarLoop]: Abstraction has 121123 states and 128712 transitions. [2018-11-06 21:09:27,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:09:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 121123 states and 128712 transitions. [2018-11-06 21:09:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-11-06 21:09:27,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:09:27,559 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:09:27,559 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:09:27,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:09:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash -14304776, now seen corresponding path program 1 times [2018-11-06 21:09:27,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:09:27,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:09:27,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:27,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:09:27,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:09:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 618 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-11-06 21:09:27,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:09:27,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:09:27,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:09:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:09:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:09:27,947 INFO L87 Difference]: Start difference. First operand 121123 states and 128712 transitions. Second operand 4 states. [2018-11-06 21:09:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:09:34,520 INFO L93 Difference]: Finished difference Result 251268 states and 267125 transitions. [2018-11-06 21:09:34,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:09:34,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 506 [2018-11-06 21:09:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:09:34,657 INFO L225 Difference]: With dead ends: 251268 [2018-11-06 21:09:34,658 INFO L226 Difference]: Without dead ends: 130899 [2018-11-06 21:09:34,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:09:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130899 states. [2018-11-06 21:09:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130899 to 130147. [2018-11-06 21:09:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130147 states. [2018-11-06 21:09:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130147 states to 130147 states and 136549 transitions. [2018-11-06 21:09:35,781 INFO L78 Accepts]: Start accepts. Automaton has 130147 states and 136549 transitions. Word has length 506 [2018-11-06 21:09:35,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:09:35,781 INFO L480 AbstractCegarLoop]: Abstraction has 130147 states and 136549 transitions. [2018-11-06 21:09:35,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:09:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 130147 states and 136549 transitions. [2018-11-06 21:09:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-11-06 21:09:35,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:09:35,793 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:09:35,793 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:09:35,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:09:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash -5835663, now seen corresponding path program 1 times [2018-11-06 21:09:35,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:09:35,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:09:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:35,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:09:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:09:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:09:36,500 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:09:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 242 proven. 461 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-06 21:09:37,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:09:37,056 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:09:37,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:09:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:09:37,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:09:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2018-11-06 21:09:37,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:09:37,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-11-06 21:09:37,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:09:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:09:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:09:37,977 INFO L87 Difference]: Start difference. First operand 130147 states and 136549 transitions. Second operand 11 states. [2018-11-06 21:10:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:10:17,942 INFO L93 Difference]: Finished difference Result 279840 states and 293678 transitions. [2018-11-06 21:10:17,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 21:10:17,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 560 [2018-11-06 21:10:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:10:18,091 INFO L225 Difference]: With dead ends: 279840 [2018-11-06 21:10:18,091 INFO L226 Difference]: Without dead ends: 145175 [2018-11-06 21:10:18,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 567 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-06 21:10:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145175 states. [2018-11-06 21:10:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145175 to 116595. [2018-11-06 21:10:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116595 states. [2018-11-06 21:10:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116595 states to 116595 states and 120677 transitions. [2018-11-06 21:10:19,110 INFO L78 Accepts]: Start accepts. Automaton has 116595 states and 120677 transitions. Word has length 560 [2018-11-06 21:10:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:10:19,110 INFO L480 AbstractCegarLoop]: Abstraction has 116595 states and 120677 transitions. [2018-11-06 21:10:19,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:10:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 116595 states and 120677 transitions. [2018-11-06 21:10:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2018-11-06 21:10:19,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:10:19,139 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:10:19,140 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:10:19,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:10:19,140 INFO L82 PathProgramCache]: Analyzing trace with hash -752154942, now seen corresponding path program 1 times [2018-11-06 21:10:19,140 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:10:19,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:10:19,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:10:19,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:10:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:10:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:10:19,795 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-11-06 21:10:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 879 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-06 21:10:21,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:10:21,115 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 21:10:21,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:10:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:10:21,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:10:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 886 proven. 110 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-06 21:10:22,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:10:22,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-11-06 21:10:22,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:10:22,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:10:22,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:10:22,223 INFO L87 Difference]: Start difference. First operand 116595 states and 120677 transitions. Second operand 10 states. [2018-11-06 21:10:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:10:35,029 INFO L93 Difference]: Finished difference Result 250096 states and 258755 transitions. [2018-11-06 21:10:35,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 21:10:35,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 775 [2018-11-06 21:10:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:10:35,163 INFO L225 Difference]: With dead ends: 250096 [2018-11-06 21:10:35,163 INFO L226 Difference]: Without dead ends: 134255 [2018-11-06 21:10:35,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 772 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-11-06 21:10:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134255 states. [2018-11-06 21:10:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134255 to 116595. [2018-11-06 21:10:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116595 states. [2018-11-06 21:10:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116595 states to 116595 states and 120235 transitions. [2018-11-06 21:10:36,421 INFO L78 Accepts]: Start accepts. Automaton has 116595 states and 120235 transitions. Word has length 775 [2018-11-06 21:10:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:10:36,421 INFO L480 AbstractCegarLoop]: Abstraction has 116595 states and 120235 transitions. [2018-11-06 21:10:36,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:10:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 116595 states and 120235 transitions. [2018-11-06 21:10:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2018-11-06 21:10:36,912 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:10:36,912 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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] [2018-11-06 21:10:36,913 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:10:36,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:10:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash 347022633, now seen corresponding path program 1 times [2018-11-06 21:10:36,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:10:36,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:10:36,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:10:36,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:10:36,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:10:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:10:37,615 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 21:10:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 21:10:38,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:10:38,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:10:38,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:10:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:10:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:10:38,357 INFO L87 Difference]: Start difference. First operand 116595 states and 120235 transitions. Second operand 4 states. [2018-11-06 21:10:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:10:45,002 INFO L93 Difference]: Finished difference Result 242212 states and 249716 transitions. [2018-11-06 21:10:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:10:45,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 793 [2018-11-06 21:10:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:10:45,132 INFO L225 Difference]: With dead ends: 242212 [2018-11-06 21:10:45,133 INFO L226 Difference]: Without dead ends: 124866 [2018-11-06 21:10:45,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:10:45,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124866 states. [2018-11-06 21:10:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124866 to 116594. [2018-11-06 21:10:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116594 states. [2018-11-06 21:10:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116594 states to 116594 states and 120153 transitions. [2018-11-06 21:10:46,069 INFO L78 Accepts]: Start accepts. Automaton has 116594 states and 120153 transitions. Word has length 793 [2018-11-06 21:10:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:10:46,069 INFO L480 AbstractCegarLoop]: Abstraction has 116594 states and 120153 transitions. [2018-11-06 21:10:46,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:10:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 116594 states and 120153 transitions. [2018-11-06 21:10:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2018-11-06 21:10:46,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:10:46,102 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:10:46,102 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:10:46,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:10:46,103 INFO L82 PathProgramCache]: Analyzing trace with hash -550988171, now seen corresponding path program 1 times [2018-11-06 21:10:46,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:10:46,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:10:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:10:46,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:10:46,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:10:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:10:46,929 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:10:47,291 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-11-06 21:10:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 377 proven. 869 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-06 21:10:49,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:10:49,034 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 21:10:49,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:10:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:10:49,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:10:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 788 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2018-11-06 21:10:50,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:10:50,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-11-06 21:10:50,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:10:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:10:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:10:50,313 INFO L87 Difference]: Start difference. First operand 116594 states and 120153 transitions. Second operand 12 states. [2018-11-06 21:11:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:11:20,057 INFO L93 Difference]: Finished difference Result 252137 states and 259770 transitions. [2018-11-06 21:11:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 21:11:20,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 821 [2018-11-06 21:11:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:11:20,191 INFO L225 Difference]: With dead ends: 252137 [2018-11-06 21:11:20,191 INFO L226 Difference]: Without dead ends: 130474 [2018-11-06 21:11:20,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 830 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 Received shutdown request... [2018-11-06 21:11:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130474 states. [2018-11-06 21:11:20,566 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:11:20,570 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:11:20,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:11:20 BoogieIcfgContainer [2018-11-06 21:11:20,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:11:20,571 INFO L168 Benchmark]: Toolchain (without parser) took 230673.39 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-06 21:11:20,572 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:11:20,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2129.25 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-11-06 21:11:20,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 595.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 803.2 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -981.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:11:20,577 INFO L168 Benchmark]: Boogie Preprocessor took 442.77 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: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:11:20,579 INFO L168 Benchmark]: RCFGBuilder took 8173.77 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 221.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -168.5 MB). Peak memory consumption was 614.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:11:20,580 INFO L168 Benchmark]: TraceAbstraction took 219321.53 ms. Allocated memory was 2.6 GB in the beginning and 3.8 GB in the end (delta: 1.2 GB). Free memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: -263.7 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-11-06 21:11:20,590 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.25 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 2129.25 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 595.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 803.2 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -981.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 442.77 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: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8173.77 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 221.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -168.5 MB). Peak memory consumption was 614.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 219321.53 ms. Allocated memory was 2.6 GB in the beginning and 3.8 GB in the end (delta: 1.2 GB). Free memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: -263.7 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 192]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 192). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 219.2s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 190.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9073 SDtfs, 51029 SDslu, 2543 SDs, 0 SdLazy, 143434 SolverSat, 14616 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 149.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2509 GetRequests, 2403 SyntacticMatches, 24 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130147occurred in iteration=12, 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: 10.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 90654 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 9167 NumberOfCodeBlocks, 9167 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 9147 ConstructedInterpolants, 0 QuantifiedInterpolants, 21868600 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2923 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 10477/11930 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown