java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label41_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:04:48,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:04:48,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:04:48,899 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:04:48,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:04:48,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:04:48,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:04:48,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:04:48,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:04:48,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:04:48,907 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:04:48,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:04:48,908 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:04:48,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:04:48,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:04:48,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:04:48,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:04:48,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:04:48,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:04:48,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:04:48,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:04:48,920 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:04:48,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:04:48,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:04:48,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:04:48,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:04:48,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:04:48,926 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:04:48,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:04:48,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:04:48,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:04:48,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:04:48,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:04:48,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:04:48,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:04:48,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:04:48,932 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:04:48,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:04:48,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:04:48,959 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:04:48,959 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:04:48,959 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:04:48,960 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:04:48,960 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:04:48,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:04:48,960 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:04:48,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:04:48,961 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:04:48,961 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:04:48,961 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:04:48,961 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:04:48,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:04:48,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:04:48,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:04:48,962 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:04:48,962 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:04:48,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:04:48,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:04:48,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:04:48,963 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:04:48,963 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:04:48,963 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:04:48,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:04:48,964 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:04:48,964 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:04:49,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:04:49,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:04:49,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:04:49,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:04:49,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:04:49,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label41_true-unreach-call.c [2018-11-06 21:04:49,095 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1323ff5c4/56d72ac4f09645f489f8cc28025f6399/FLAG4dd228859 [2018-11-06 21:04:49,734 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:04:49,735 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label41_true-unreach-call.c [2018-11-06 21:04:49,754 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1323ff5c4/56d72ac4f09645f489f8cc28025f6399/FLAG4dd228859 [2018-11-06 21:04:49,780 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1323ff5c4/56d72ac4f09645f489f8cc28025f6399 [2018-11-06 21:04:49,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:04:49,795 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:04:49,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:04:49,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:04:49,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:04:49,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:49" (1/1) ... [2018-11-06 21:04:49,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9c8864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:49, skipping insertion in model container [2018-11-06 21:04:49,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:49" (1/1) ... [2018-11-06 21:04:49,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:04:49,915 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:04:50,647 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:04:50,652 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:04:50,817 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:04:50,837 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:04:50,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50 WrapperNode [2018-11-06 21:04:50,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:04:50,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:04:50,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:04:50,839 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:04:50,849 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:04:50" (1/1) ... [2018-11-06 21:04:51,017 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:04:50" (1/1) ... [2018-11-06 21:04:51,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:04:51,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:04:51,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:04:51,157 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:04:51,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (1/1) ... [2018-11-06 21:04:51,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (1/1) ... [2018-11-06 21:04:51,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (1/1) ... [2018-11-06 21:04:51,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (1/1) ... [2018-11-06 21:04:51,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (1/1) ... [2018-11-06 21:04:51,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (1/1) ... [2018-11-06 21:04:51,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (1/1) ... [2018-11-06 21:04:51,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:04:51,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:04:51,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:04:51,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:04:51,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (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:04:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:04:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:04:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:04:55,854 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:04:55,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:04:55 BoogieIcfgContainer [2018-11-06 21:04:55,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:04:55,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:04:55,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:04:55,860 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:04:55,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:04:49" (1/3) ... [2018-11-06 21:04:55,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9a4633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:04:55, skipping insertion in model container [2018-11-06 21:04:55,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:50" (2/3) ... [2018-11-06 21:04:55,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9a4633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:04:55, skipping insertion in model container [2018-11-06 21:04:55,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:04:55" (3/3) ... [2018-11-06 21:04:55,864 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label41_true-unreach-call.c [2018-11-06 21:04:55,875 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:04:55,886 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:04:55,901 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:04:55,939 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:04:55,940 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:04:55,940 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:04:55,941 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:04:55,941 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:04:55,941 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:04:55,941 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:04:55,941 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:04:55,942 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:04:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:04:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-06 21:04:55,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:55,984 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] [2018-11-06 21:04:55,987 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:55,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:55,994 INFO L82 PathProgramCache]: Analyzing trace with hash 682595178, now seen corresponding path program 1 times [2018-11-06 21:04:55,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:56,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:56,383 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 21:04:56,389 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:04:56,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:56,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:56,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:56,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:56,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:56,416 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:04:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:59,997 INFO L93 Difference]: Finished difference Result 955 states and 1722 transitions. [2018-11-06 21:04:59,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:00,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-06 21:05:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:00,025 INFO L225 Difference]: With dead ends: 955 [2018-11-06 21:05:00,026 INFO L226 Difference]: Without dead ends: 664 [2018-11-06 21:05:00,031 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:05:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-11-06 21:05:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 472. [2018-11-06 21:05:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-11-06 21:05:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 716 transitions. [2018-11-06 21:05:00,129 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 716 transitions. Word has length 22 [2018-11-06 21:05:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:00,131 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 716 transitions. [2018-11-06 21:05:00,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 716 transitions. [2018-11-06 21:05:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-06 21:05:00,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:00,136 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 21:05:00,137 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:00,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1022137437, now seen corresponding path program 1 times [2018-11-06 21:05:00,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:00,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:00,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:00,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:00,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:00,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:00,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:00,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:00,403 INFO L87 Difference]: Start difference. First operand 472 states and 716 transitions. Second operand 4 states. [2018-11-06 21:05:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:03,559 INFO L93 Difference]: Finished difference Result 1700 states and 2661 transitions. [2018-11-06 21:05:03,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:03,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-06 21:05:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:03,568 INFO L225 Difference]: With dead ends: 1700 [2018-11-06 21:05:03,568 INFO L226 Difference]: Without dead ends: 1230 [2018-11-06 21:05:03,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2018-11-06 21:05:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1216. [2018-11-06 21:05:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-06 21:05:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1756 transitions. [2018-11-06 21:05:03,612 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1756 transitions. Word has length 91 [2018-11-06 21:05:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:03,612 INFO L480 AbstractCegarLoop]: Abstraction has 1216 states and 1756 transitions. [2018-11-06 21:05:03,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1756 transitions. [2018-11-06 21:05:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-06 21:05:03,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:03,617 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 21:05:03,617 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:03,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:03,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1669703823, now seen corresponding path program 1 times [2018-11-06 21:05:03,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:03,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:03,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:03,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:03,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:03,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:03,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:03,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:03,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:03,937 INFO L87 Difference]: Start difference. First operand 1216 states and 1756 transitions. Second operand 4 states. [2018-11-06 21:05:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:08,216 INFO L93 Difference]: Finished difference Result 4494 states and 6609 transitions. [2018-11-06 21:05:08,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:08,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-06 21:05:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:08,233 INFO L225 Difference]: With dead ends: 4494 [2018-11-06 21:05:08,234 INFO L226 Difference]: Without dead ends: 3280 [2018-11-06 21:05:08,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2018-11-06 21:05:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 2327. [2018-11-06 21:05:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-11-06 21:05:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3050 transitions. [2018-11-06 21:05:08,290 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3050 transitions. Word has length 99 [2018-11-06 21:05:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:08,291 INFO L480 AbstractCegarLoop]: Abstraction has 2327 states and 3050 transitions. [2018-11-06 21:05:08,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3050 transitions. [2018-11-06 21:05:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-06 21:05:08,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:08,295 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:08,295 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:08,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:08,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2052942401, now seen corresponding path program 1 times [2018-11-06 21:05:08,295 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:08,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:08,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:08,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:08,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:08,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:08,725 INFO L87 Difference]: Start difference. First operand 2327 states and 3050 transitions. Second operand 4 states. [2018-11-06 21:05:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:11,958 INFO L93 Difference]: Finished difference Result 5960 states and 7948 transitions. [2018-11-06 21:05:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:11,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-06 21:05:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:11,982 INFO L225 Difference]: With dead ends: 5960 [2018-11-06 21:05:11,982 INFO L226 Difference]: Without dead ends: 3820 [2018-11-06 21:05:11,987 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:05:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2018-11-06 21:05:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3438. [2018-11-06 21:05:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2018-11-06 21:05:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4460 transitions. [2018-11-06 21:05:12,068 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4460 transitions. Word has length 150 [2018-11-06 21:05:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:12,069 INFO L480 AbstractCegarLoop]: Abstraction has 3438 states and 4460 transitions. [2018-11-06 21:05:12,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4460 transitions. [2018-11-06 21:05:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-06 21:05:12,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:12,079 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:12,079 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:12,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash 482276609, now seen corresponding path program 1 times [2018-11-06 21:05:12,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:12,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:12,618 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 21:05:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 39 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:12,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:12,900 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:05:12,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:13,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:13,932 WARN L179 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 20 [2018-11-06 21:05:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-06 21:05:14,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:14,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-11-06 21:05:14,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:05:14,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:05:14,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:05:14,103 INFO L87 Difference]: Start difference. First operand 3438 states and 4460 transitions. Second operand 8 states. [2018-11-06 21:05:14,330 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:05:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:27,521 INFO L93 Difference]: Finished difference Result 18190 states and 24162 transitions. [2018-11-06 21:05:27,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 21:05:27,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 206 [2018-11-06 21:05:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:27,579 INFO L225 Difference]: With dead ends: 18190 [2018-11-06 21:05:27,579 INFO L226 Difference]: Without dead ends: 11372 [2018-11-06 21:05:27,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-11-06 21:05:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11372 states. [2018-11-06 21:05:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11372 to 10067. [2018-11-06 21:05:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10067 states. [2018-11-06 21:05:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 11590 transitions. [2018-11-06 21:05:27,802 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 11590 transitions. Word has length 206 [2018-11-06 21:05:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:27,802 INFO L480 AbstractCegarLoop]: Abstraction has 10067 states and 11590 transitions. [2018-11-06 21:05:27,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:05:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 11590 transitions. [2018-11-06 21:05:27,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-06 21:05:27,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:27,817 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:27,817 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:27,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:27,817 INFO L82 PathProgramCache]: Analyzing trace with hash -993046551, now seen corresponding path program 1 times [2018-11-06 21:05:27,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:27,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:27,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:28,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:28,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:28,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:28,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:28,355 INFO L87 Difference]: Start difference. First operand 10067 states and 11590 transitions. Second operand 5 states. [2018-11-06 21:05:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:31,445 INFO L93 Difference]: Finished difference Result 25150 states and 29098 transitions. [2018-11-06 21:05:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:05:31,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2018-11-06 21:05:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:31,493 INFO L225 Difference]: With dead ends: 25150 [2018-11-06 21:05:31,493 INFO L226 Difference]: Without dead ends: 15085 [2018-11-06 21:05:31,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15085 states. [2018-11-06 21:05:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15085 to 13407. [2018-11-06 21:05:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13407 states. [2018-11-06 21:05:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13407 states to 13407 states and 15397 transitions. [2018-11-06 21:05:31,724 INFO L78 Accepts]: Start accepts. Automaton has 13407 states and 15397 transitions. Word has length 306 [2018-11-06 21:05:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:31,724 INFO L480 AbstractCegarLoop]: Abstraction has 13407 states and 15397 transitions. [2018-11-06 21:05:31,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 13407 states and 15397 transitions. [2018-11-06 21:05:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-06 21:05:31,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:31,740 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:05:31,740 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:31,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1731558857, now seen corresponding path program 1 times [2018-11-06 21:05:31,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:31,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:32,301 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:05:32,625 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-11-06 21:05:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-06 21:05:32,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:32,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:05:32,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:32,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:32,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:32,742 INFO L87 Difference]: Start difference. First operand 13407 states and 15397 transitions. Second operand 5 states. [2018-11-06 21:05:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:35,435 INFO L93 Difference]: Finished difference Result 28504 states and 32797 transitions. [2018-11-06 21:05:35,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:05:35,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2018-11-06 21:05:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:35,463 INFO L225 Difference]: With dead ends: 28504 [2018-11-06 21:05:35,463 INFO L226 Difference]: Without dead ends: 15099 [2018-11-06 21:05:35,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15099 states. [2018-11-06 21:05:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15099 to 12299. [2018-11-06 21:05:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12299 states. [2018-11-06 21:05:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12299 states to 12299 states and 14171 transitions. [2018-11-06 21:05:35,654 INFO L78 Accepts]: Start accepts. Automaton has 12299 states and 14171 transitions. Word has length 328 [2018-11-06 21:05:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:35,655 INFO L480 AbstractCegarLoop]: Abstraction has 12299 states and 14171 transitions. [2018-11-06 21:05:35,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 14171 transitions. [2018-11-06 21:05:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-06 21:05:35,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:35,669 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:05:35,670 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:35,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1879326908, now seen corresponding path program 1 times [2018-11-06 21:05:35,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:35,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:35,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:35,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-06 21:05:35,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:35,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:35,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:05:35,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:05:35,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:35,962 INFO L87 Difference]: Start difference. First operand 12299 states and 14171 transitions. Second operand 3 states. [2018-11-06 21:05:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:37,221 INFO L93 Difference]: Finished difference Result 21993 states and 25449 transitions. [2018-11-06 21:05:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:37,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-11-06 21:05:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:37,240 INFO L225 Difference]: With dead ends: 21993 [2018-11-06 21:05:37,241 INFO L226 Difference]: Without dead ends: 9695 [2018-11-06 21:05:37,251 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:05:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9695 states. [2018-11-06 21:05:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9695 to 9508. [2018-11-06 21:05:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9508 states. [2018-11-06 21:05:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 10825 transitions. [2018-11-06 21:05:37,366 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 10825 transitions. Word has length 341 [2018-11-06 21:05:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:37,367 INFO L480 AbstractCegarLoop]: Abstraction has 9508 states and 10825 transitions. [2018-11-06 21:05:37,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:05:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 10825 transitions. [2018-11-06 21:05:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-06 21:05:37,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:37,385 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-11-06 21:05:37,385 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:37,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1635049709, now seen corresponding path program 1 times [2018-11-06 21:05:37,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:37,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:37,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:37,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:37,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-06 21:05:37,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:37,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:37,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:05:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:05:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:37,749 INFO L87 Difference]: Start difference. First operand 9508 states and 10825 transitions. Second operand 3 states. [2018-11-06 21:05:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:39,864 INFO L93 Difference]: Finished difference Result 20308 states and 23109 transitions. [2018-11-06 21:05:39,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:39,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-11-06 21:05:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:39,885 INFO L225 Difference]: With dead ends: 20308 [2018-11-06 21:05:39,885 INFO L226 Difference]: Without dead ends: 10802 [2018-11-06 21:05:39,895 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:05:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10802 states. [2018-11-06 21:05:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10802 to 10432. [2018-11-06 21:05:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10432 states. [2018-11-06 21:05:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10432 states to 10432 states and 11830 transitions. [2018-11-06 21:05:40,029 INFO L78 Accepts]: Start accepts. Automaton has 10432 states and 11830 transitions. Word has length 383 [2018-11-06 21:05:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:40,030 INFO L480 AbstractCegarLoop]: Abstraction has 10432 states and 11830 transitions. [2018-11-06 21:05:40,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:05:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10432 states and 11830 transitions. [2018-11-06 21:05:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-06 21:05:40,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:40,050 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:40,050 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:40,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash -261141058, now seen corresponding path program 1 times [2018-11-06 21:05:40,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:40,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:40,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:40,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:40,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-06 21:05:40,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:40,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:05:40,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:05:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:05:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:40,467 INFO L87 Difference]: Start difference. First operand 10432 states and 11830 transitions. Second operand 3 states. [2018-11-06 21:05:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:41,329 INFO L93 Difference]: Finished difference Result 21047 states and 23847 transitions. [2018-11-06 21:05:41,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:41,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2018-11-06 21:05:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:41,349 INFO L225 Difference]: With dead ends: 21047 [2018-11-06 21:05:41,349 INFO L226 Difference]: Without dead ends: 10431 [2018-11-06 21:05:41,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10431 states. [2018-11-06 21:05:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10431 to 10245. [2018-11-06 21:05:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2018-11-06 21:05:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11407 transitions. [2018-11-06 21:05:41,479 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11407 transitions. Word has length 396 [2018-11-06 21:05:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:41,480 INFO L480 AbstractCegarLoop]: Abstraction has 10245 states and 11407 transitions. [2018-11-06 21:05:41,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:05:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11407 transitions. [2018-11-06 21:05:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-11-06 21:05:41,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:41,502 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:41,502 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:41,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash 433724850, now seen corresponding path program 1 times [2018-11-06 21:05:41,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:41,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:41,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:41,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 396 proven. 205 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 21:05:42,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:42,557 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:05:42,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:42,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:43,055 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2018-11-06 21:05:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 21:05:43,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:05:43,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-11-06 21:05:43,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:05:43,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:05:43,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:05:43,936 INFO L87 Difference]: Start difference. First operand 10245 states and 11407 transitions. Second operand 6 states. [2018-11-06 21:05:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:47,943 INFO L93 Difference]: Finished difference Result 29400 states and 32599 transitions. [2018-11-06 21:05:47,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:05:47,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 496 [2018-11-06 21:05:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:47,971 INFO L225 Difference]: With dead ends: 29400 [2018-11-06 21:05:47,971 INFO L226 Difference]: Without dead ends: 18602 [2018-11-06 21:05:47,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 495 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:05:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18602 states. [2018-11-06 21:05:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18602 to 14506. [2018-11-06 21:05:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14506 states. [2018-11-06 21:05:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14506 states to 14506 states and 16041 transitions. [2018-11-06 21:05:48,183 INFO L78 Accepts]: Start accepts. Automaton has 14506 states and 16041 transitions. Word has length 496 [2018-11-06 21:05:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:48,184 INFO L480 AbstractCegarLoop]: Abstraction has 14506 states and 16041 transitions. [2018-11-06 21:05:48,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:05:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 14506 states and 16041 transitions. [2018-11-06 21:05:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-11-06 21:05:48,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:48,213 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:48,213 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:48,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1721011334, now seen corresponding path program 1 times [2018-11-06 21:05:48,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:48,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:48,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:48,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:48,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:49,022 WARN L179 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-06 21:05:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-06 21:05:49,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:49,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:49,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:49,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:49,161 INFO L87 Difference]: Start difference. First operand 14506 states and 16041 transitions. Second operand 4 states. [2018-11-06 21:05:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:50,912 INFO L93 Difference]: Finished difference Result 29020 states and 32174 transitions. [2018-11-06 21:05:50,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:50,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 522 [2018-11-06 21:05:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:50,932 INFO L225 Difference]: With dead ends: 29020 [2018-11-06 21:05:50,932 INFO L226 Difference]: Without dead ends: 14329 [2018-11-06 21:05:50,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14329 states. [2018-11-06 21:05:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14329 to 14316. [2018-11-06 21:05:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14316 states. [2018-11-06 21:05:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14316 states to 14316 states and 15569 transitions. [2018-11-06 21:05:51,115 INFO L78 Accepts]: Start accepts. Automaton has 14316 states and 15569 transitions. Word has length 522 [2018-11-06 21:05:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:51,115 INFO L480 AbstractCegarLoop]: Abstraction has 14316 states and 15569 transitions. [2018-11-06 21:05:51,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 14316 states and 15569 transitions. [2018-11-06 21:05:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-11-06 21:05:51,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:51,135 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:51,136 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:51,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 634844804, now seen corresponding path program 1 times [2018-11-06 21:05:51,136 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:51,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:51,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 529 proven. 119 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-06 21:05:51,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:51,865 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:05:51,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:52,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 529 proven. 119 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-06 21:05:52,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:52,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-11-06 21:05:52,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:52,328 INFO L87 Difference]: Start difference. First operand 14316 states and 15569 transitions. Second operand 5 states. [2018-11-06 21:05:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:54,558 INFO L93 Difference]: Finished difference Result 30864 states and 33597 transitions. [2018-11-06 21:05:54,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:05:54,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 538 [2018-11-06 21:05:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:54,581 INFO L225 Difference]: With dead ends: 30864 [2018-11-06 21:05:54,582 INFO L226 Difference]: Without dead ends: 17290 [2018-11-06 21:05:54,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 537 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:05:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-11-06 21:05:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 14871. [2018-11-06 21:05:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-11-06 21:05:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 16154 transitions. [2018-11-06 21:05:54,786 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 16154 transitions. Word has length 538 [2018-11-06 21:05:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:54,787 INFO L480 AbstractCegarLoop]: Abstraction has 14871 states and 16154 transitions. [2018-11-06 21:05:54,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 16154 transitions. [2018-11-06 21:05:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-11-06 21:05:54,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:54,801 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:54,802 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:54,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash -783968333, now seen corresponding path program 1 times [2018-11-06 21:05:54,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:54,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:54,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:54,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:54,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 768 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-06 21:05:55,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:55,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:55,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:55,490 INFO L87 Difference]: Start difference. First operand 14871 states and 16154 transitions. Second operand 5 states. [2018-11-06 21:05:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:57,728 INFO L93 Difference]: Finished difference Result 34745 states and 37752 transitions. [2018-11-06 21:05:57,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:05:57,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 606 [2018-11-06 21:05:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:57,747 INFO L225 Difference]: With dead ends: 34745 [2018-11-06 21:05:57,748 INFO L226 Difference]: Without dead ends: 20061 [2018-11-06 21:05:57,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20061 states. [2018-11-06 21:05:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20061 to 16719. [2018-11-06 21:05:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16719 states. [2018-11-06 21:05:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16719 states to 16719 states and 17991 transitions. [2018-11-06 21:05:57,961 INFO L78 Accepts]: Start accepts. Automaton has 16719 states and 17991 transitions. Word has length 606 [2018-11-06 21:05:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:57,961 INFO L480 AbstractCegarLoop]: Abstraction has 16719 states and 17991 transitions. [2018-11-06 21:05:57,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 16719 states and 17991 transitions. [2018-11-06 21:05:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-11-06 21:05:57,973 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:57,973 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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] [2018-11-06 21:05:57,974 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:57,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:57,974 INFO L82 PathProgramCache]: Analyzing trace with hash 788418704, now seen corresponding path program 1 times [2018-11-06 21:05:57,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:57,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:57,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:57,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:57,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 742 proven. 46 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-06 21:05:59,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:59,137 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:05:59,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:59,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:06:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 750 proven. 38 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-06 21:06:00,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:06:00,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-06 21:06:00,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:06:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:06:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:06:00,281 INFO L87 Difference]: Start difference. First operand 16719 states and 17991 transitions. Second operand 8 states. [2018-11-06 21:06:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:05,093 INFO L93 Difference]: Finished difference Result 33498 states and 36038 transitions. [2018-11-06 21:06:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:06:05,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 648 [2018-11-06 21:06:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:05,109 INFO L225 Difference]: With dead ends: 33498 [2018-11-06 21:06:05,109 INFO L226 Difference]: Without dead ends: 17151 [2018-11-06 21:06:05,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 645 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:06:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17151 states. [2018-11-06 21:06:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17151 to 16346. [2018-11-06 21:06:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16346 states. [2018-11-06 21:06:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16346 states to 16346 states and 17577 transitions. [2018-11-06 21:06:05,344 INFO L78 Accepts]: Start accepts. Automaton has 16346 states and 17577 transitions. Word has length 648 [2018-11-06 21:06:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:05,345 INFO L480 AbstractCegarLoop]: Abstraction has 16346 states and 17577 transitions. [2018-11-06 21:06:05,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:06:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 16346 states and 17577 transitions. [2018-11-06 21:06:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2018-11-06 21:06:05,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:05,362 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:06:05,362 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:05,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1302145049, now seen corresponding path program 1 times [2018-11-06 21:06:05,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:05,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:05,928 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-06 21:06:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 1048 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-11-06 21:06:06,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:06,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:06:06,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:06:06,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:06:06,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:06:06,159 INFO L87 Difference]: Start difference. First operand 16346 states and 17577 transitions. Second operand 4 states. [2018-11-06 21:06:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:07,644 INFO L93 Difference]: Finished difference Result 32701 states and 35180 transitions. [2018-11-06 21:06:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:06:07,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 655 [2018-11-06 21:06:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:07,660 INFO L225 Difference]: With dead ends: 32701 [2018-11-06 21:06:07,660 INFO L226 Difference]: Without dead ends: 16727 [2018-11-06 21:06:07,668 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:06:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16727 states. [2018-11-06 21:06:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16727 to 15976. [2018-11-06 21:06:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15976 states. [2018-11-06 21:06:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15976 states to 15976 states and 17153 transitions. [2018-11-06 21:06:07,850 INFO L78 Accepts]: Start accepts. Automaton has 15976 states and 17153 transitions. Word has length 655 [2018-11-06 21:06:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:07,851 INFO L480 AbstractCegarLoop]: Abstraction has 15976 states and 17153 transitions. [2018-11-06 21:06:07,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:06:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 15976 states and 17153 transitions. [2018-11-06 21:06:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2018-11-06 21:06:07,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:07,868 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:06:07,868 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:07,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:07,869 INFO L82 PathProgramCache]: Analyzing trace with hash -530987743, now seen corresponding path program 1 times [2018-11-06 21:06:07,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:07,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:07,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:07,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:07,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 833 proven. 40 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2018-11-06 21:06:09,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:06:09,419 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:06:09,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:09,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:06:14,589 WARN L179 SmtUtils]: Spent 4.58 s on a formula simplification. DAG size of input: 1549 DAG size of output: 24 [2018-11-06 21:06:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 1081 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2018-11-06 21:06:15,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:06:15,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 21:06:15,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:06:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:06:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:06:15,595 INFO L87 Difference]: Start difference. First operand 15976 states and 17153 transitions. Second operand 6 states. [2018-11-06 21:06:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:22,141 INFO L93 Difference]: Finished difference Result 37154 states and 39915 transitions. [2018-11-06 21:06:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:06:22,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 668 [2018-11-06 21:06:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:22,161 INFO L225 Difference]: With dead ends: 37154 [2018-11-06 21:06:22,161 INFO L226 Difference]: Without dead ends: 21550 [2018-11-06 21:06:22,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:06:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21550 states. [2018-11-06 21:06:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21550 to 18206. [2018-11-06 21:06:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18206 states. [2018-11-06 21:06:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18206 states to 18206 states and 19449 transitions. [2018-11-06 21:06:22,372 INFO L78 Accepts]: Start accepts. Automaton has 18206 states and 19449 transitions. Word has length 668 [2018-11-06 21:06:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:22,372 INFO L480 AbstractCegarLoop]: Abstraction has 18206 states and 19449 transitions. [2018-11-06 21:06:22,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:06:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18206 states and 19449 transitions. [2018-11-06 21:06:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2018-11-06 21:06:22,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:22,390 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:06:22,391 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:22,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:22,391 INFO L82 PathProgramCache]: Analyzing trace with hash 96487399, now seen corresponding path program 1 times [2018-11-06 21:06:22,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:22,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:22,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:22,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:22,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1089 proven. 1278 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-06 21:06:24,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:06:24,655 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:06:24,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:24,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:06:25,588 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 29 [2018-11-06 21:06:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1293 proven. 40 refuted. 0 times theorem prover too weak. 1279 trivial. 0 not checked. [2018-11-06 21:06:27,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:06:27,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 21:06:27,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:06:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:06:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:06:27,835 INFO L87 Difference]: Start difference. First operand 18206 states and 19449 transitions. Second operand 9 states. [2018-11-06 21:06:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:38,540 INFO L93 Difference]: Finished difference Result 50501 states and 53799 transitions. [2018-11-06 21:06:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 21:06:38,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 888 [2018-11-06 21:06:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:38,572 INFO L225 Difference]: With dead ends: 50501 [2018-11-06 21:06:38,572 INFO L226 Difference]: Without dead ends: 31927 [2018-11-06 21:06:38,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 893 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:06:38,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31927 states. [2018-11-06 21:06:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31927 to 21172. [2018-11-06 21:06:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21172 states. [2018-11-06 21:06:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21172 states to 21172 states and 22559 transitions. [2018-11-06 21:06:38,823 INFO L78 Accepts]: Start accepts. Automaton has 21172 states and 22559 transitions. Word has length 888 [2018-11-06 21:06:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:38,824 INFO L480 AbstractCegarLoop]: Abstraction has 21172 states and 22559 transitions. [2018-11-06 21:06:38,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:06:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 21172 states and 22559 transitions. [2018-11-06 21:06:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2018-11-06 21:06:38,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:38,849 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:06:38,850 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:38,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:38,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1007317651, now seen corresponding path program 1 times [2018-11-06 21:06:38,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:38,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:38,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3228 backedges. 1504 proven. 0 refuted. 0 times theorem prover too weak. 1724 trivial. 0 not checked. [2018-11-06 21:06:40,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:40,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:06:40,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:06:40,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:06:40,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:06:40,278 INFO L87 Difference]: Start difference. First operand 21172 states and 22559 transitions. Second operand 3 states. [2018-11-06 21:06:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:40,894 INFO L93 Difference]: Finished difference Result 39378 states and 42009 transitions. [2018-11-06 21:06:40,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:06:40,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1015 [2018-11-06 21:06:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:40,911 INFO L225 Difference]: With dead ends: 39378 [2018-11-06 21:06:40,911 INFO L226 Difference]: Without dead ends: 20800 [2018-11-06 21:06:40,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:06:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20800 states. [2018-11-06 21:06:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20800 to 20799. [2018-11-06 21:06:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20799 states. [2018-11-06 21:06:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20799 states to 20799 states and 22160 transitions. [2018-11-06 21:06:41,127 INFO L78 Accepts]: Start accepts. Automaton has 20799 states and 22160 transitions. Word has length 1015 [2018-11-06 21:06:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:41,127 INFO L480 AbstractCegarLoop]: Abstraction has 20799 states and 22160 transitions. [2018-11-06 21:06:41,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:06:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 20799 states and 22160 transitions. [2018-11-06 21:06:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-11-06 21:06:41,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:41,147 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 21:06:41,147 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:41,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash -370381018, now seen corresponding path program 1 times [2018-11-06 21:06:41,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:41,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:41,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:42,087 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:06:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3990 backedges. 1992 proven. 220 refuted. 0 times theorem prover too weak. 1778 trivial. 0 not checked. [2018-11-06 21:06:42,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:06:42,852 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:06:42,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:43,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:06:43,682 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 13 [2018-11-06 21:06:47,259 WARN L179 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-11-06 21:06:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3990 backedges. 2548 proven. 600 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-06 21:06:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:06:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-06 21:06:50,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:06:50,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:06:50,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:06:50,589 INFO L87 Difference]: Start difference. First operand 20799 states and 22160 transitions. Second operand 9 states. [2018-11-06 21:08:19,308 WARN L179 SmtUtils]: Spent 3.73 s on a formula simplification that was a NOOP. DAG size: 47 [2018-11-06 21:08:40,279 WARN L179 SmtUtils]: Spent 7.44 s on a formula simplification. DAG size of input: 50 DAG size of output: 48 Received shutdown request... [2018-11-06 21:08:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:08:49,893 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:08:49,898 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:08:49,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:08:49 BoogieIcfgContainer [2018-11-06 21:08:49,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:08:49,900 INFO L168 Benchmark]: Toolchain (without parser) took 240106.44 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 290.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:49,901 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:08:49,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1042.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:49,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 317.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.3 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -791.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:49,903 INFO L168 Benchmark]: Boogie Preprocessor took 145.87 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:49,903 INFO L168 Benchmark]: RCFGBuilder took 4552.22 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 172.2 MB). Peak memory consumption was 172.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:49,904 INFO L168 Benchmark]: TraceAbstraction took 234042.60 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:49,909 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1042.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 317.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.3 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -791.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.87 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4552.22 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 172.2 MB). Peak memory consumption was 172.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 234042.60 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (20799states) and FLOYD_HOARE automaton (currently 16 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (36155 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 233.9s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 192.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3556 SDtfs, 13037 SDslu, 2604 SDs, 0 SdLazy, 41967 SolverSat, 5473 SolverUnsat, 48 SolverUnknown, 0 SolverNotchecked, 166.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4677 GetRequests, 4567 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 28.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21172occurred in iteration=18, 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: 3.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 33593 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 29.6s InterpolantComputationTime, 14020 NumberOfCodeBlocks, 14020 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 13993 ConstructedInterpolants, 738 QuantifiedInterpolants, 48076082 SizeOfPredicates, 11 NumberOfNonLiveVariables, 5882 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 27220/30034 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown