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/Problem17_label39_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:44:24,784 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:44:24,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:44:24,800 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:44:24,800 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:44:24,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:44:24,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:44:24,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:44:24,813 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:44:24,816 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:44:24,817 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:44:24,817 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:44:24,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:44:24,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:44:24,822 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:44:24,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:44:24,829 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:44:24,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:44:24,835 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:44:24,838 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:44:24,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:44:24,843 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:44:24,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:44:24,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:44:24,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:44:24,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:44:24,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:44:24,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:44:24,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:44:24,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:44:24,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:44:24,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:44:24,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:44:24,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:44:24,856 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:44:24,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:44:24,857 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:44:24,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:44:24,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:44:24,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:44:24,882 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:44:24,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:44:24,886 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:44:24,886 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:44:24,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:44:24,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:44:24,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:44:24,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:44:24,888 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:44:24,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:44:24,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:44:24,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:44:24,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:44:24,889 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:44:24,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:44:24,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:44:24,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:44:24,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:44:24,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:44:24,891 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:44:24,891 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:44:24,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:44:24,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:44:24,892 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:44:24,892 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:44:24,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:44:24,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:44:24,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:44:24,975 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:44:24,975 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:44:24,976 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label39_true-unreach-call.c [2018-11-06 21:44:25,038 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb3e5c7c/5523fd92d64d4331b431e9fadcbdb037/FLAG4050821df [2018-11-06 21:44:25,753 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:44:25,754 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label39_true-unreach-call.c [2018-11-06 21:44:25,784 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb3e5c7c/5523fd92d64d4331b431e9fadcbdb037/FLAG4050821df [2018-11-06 21:44:25,807 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb3e5c7c/5523fd92d64d4331b431e9fadcbdb037 [2018-11-06 21:44:25,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:44:25,823 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:44:25,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:44:25,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:44:25,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:44:25,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:44:25" (1/1) ... [2018-11-06 21:44:25,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710be24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:25, skipping insertion in model container [2018-11-06 21:44:25,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:44:25" (1/1) ... [2018-11-06 21:44:25,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:44:25,971 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:44:27,019 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:44:27,023 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:44:27,395 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:44:27,419 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:44:27,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27 WrapperNode [2018-11-06 21:44:27,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:44:27,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:44:27,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:44:27,421 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:44:27,431 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:44:27" (1/1) ... [2018-11-06 21:44:27,677 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:44:27" (1/1) ... [2018-11-06 21:44:27,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:44:27,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:44:27,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:44:27,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:44:27,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (1/1) ... [2018-11-06 21:44:27,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (1/1) ... [2018-11-06 21:44:27,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (1/1) ... [2018-11-06 21:44:27,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (1/1) ... [2018-11-06 21:44:28,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (1/1) ... [2018-11-06 21:44:28,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (1/1) ... [2018-11-06 21:44:28,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (1/1) ... [2018-11-06 21:44:28,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:44:28,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:44:28,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:44:28,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:44:28,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (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:44:28,217 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:44:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:44:28,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:44:35,966 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:44:35,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:44:35 BoogieIcfgContainer [2018-11-06 21:44:35,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:44:35,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:44:35,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:44:35,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:44:35,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:44:25" (1/3) ... [2018-11-06 21:44:35,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dec33c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:44:35, skipping insertion in model container [2018-11-06 21:44:35,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:44:27" (2/3) ... [2018-11-06 21:44:35,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dec33c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:44:35, skipping insertion in model container [2018-11-06 21:44:35,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:44:35" (3/3) ... [2018-11-06 21:44:35,976 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label39_true-unreach-call.c [2018-11-06 21:44:35,986 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:44:35,996 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:44:36,013 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:44:36,056 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:44:36,057 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:44:36,057 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:44:36,058 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:44:36,058 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:44:36,058 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:44:36,058 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:44:36,058 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:44:36,058 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:44:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 21:44:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-06 21:44:36,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:44:36,104 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:44:36,106 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:44:36,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:44:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash -344880110, now seen corresponding path program 1 times [2018-11-06 21:44:36,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:44:36,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:44:36,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:36,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:44:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:44:36,601 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:44:36,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:44:36,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:44:36,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:44:36,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:44:36,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:44:36,629 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 21:44:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:44:44,243 INFO L93 Difference]: Finished difference Result 2085 states and 3898 transitions. [2018-11-06 21:44:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:44:44,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-06 21:44:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:44:44,296 INFO L225 Difference]: With dead ends: 2085 [2018-11-06 21:44:44,296 INFO L226 Difference]: Without dead ends: 1487 [2018-11-06 21:44:44,303 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:44:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-11-06 21:44:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1023. [2018-11-06 21:44:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-06 21:44:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1623 transitions. [2018-11-06 21:44:44,436 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1623 transitions. Word has length 64 [2018-11-06 21:44:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:44:44,437 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1623 transitions. [2018-11-06 21:44:44,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:44:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1623 transitions. [2018-11-06 21:44:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-06 21:44:44,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:44:44,443 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:44:44,444 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:44:44,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:44:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1331898614, now seen corresponding path program 1 times [2018-11-06 21:44:44,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:44:44,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:44:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:44,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:44:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:44:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:44:44,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:44:44,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:44:44,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:44:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:44:44,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:44:44,670 INFO L87 Difference]: Start difference. First operand 1023 states and 1623 transitions. Second operand 4 states. [2018-11-06 21:44:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:44:52,556 INFO L93 Difference]: Finished difference Result 2908 states and 4662 transitions. [2018-11-06 21:44:52,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:44:52,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-11-06 21:44:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:44:52,568 INFO L225 Difference]: With dead ends: 2908 [2018-11-06 21:44:52,569 INFO L226 Difference]: Without dead ends: 1887 [2018-11-06 21:44:52,571 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:44:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2018-11-06 21:44:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1887. [2018-11-06 21:44:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2018-11-06 21:44:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2573 transitions. [2018-11-06 21:44:52,616 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2573 transitions. Word has length 132 [2018-11-06 21:44:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:44:52,616 INFO L480 AbstractCegarLoop]: Abstraction has 1887 states and 2573 transitions. [2018-11-06 21:44:52,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:44:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2573 transitions. [2018-11-06 21:44:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-06 21:44:52,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:44:52,620 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:44:52,620 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:44:52,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:44:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1607588607, now seen corresponding path program 1 times [2018-11-06 21:44:52,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:44:52,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:44:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:52,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:44:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:44:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:44:52,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:44:52,971 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:44:52,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:44:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:44:53,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:44:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:44:53,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:44:53,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 21:44:53,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:44:53,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:44:53,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:44:53,280 INFO L87 Difference]: Start difference. First operand 1887 states and 2573 transitions. Second operand 6 states. [2018-11-06 21:45:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:05,230 INFO L93 Difference]: Finished difference Result 9400 states and 12734 transitions. [2018-11-06 21:45:05,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:45:05,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-06 21:45:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:05,259 INFO L225 Difference]: With dead ends: 9400 [2018-11-06 21:45:05,259 INFO L226 Difference]: Without dead ends: 5746 [2018-11-06 21:45:05,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:45:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2018-11-06 21:45:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 5738. [2018-11-06 21:45:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5738 states. [2018-11-06 21:45:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5738 states to 5738 states and 6855 transitions. [2018-11-06 21:45:05,380 INFO L78 Accepts]: Start accepts. Automaton has 5738 states and 6855 transitions. Word has length 135 [2018-11-06 21:45:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:05,380 INFO L480 AbstractCegarLoop]: Abstraction has 5738 states and 6855 transitions. [2018-11-06 21:45:05,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:45:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5738 states and 6855 transitions. [2018-11-06 21:45:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-06 21:45:05,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:05,387 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:45:05,389 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:05,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1344223041, now seen corresponding path program 1 times [2018-11-06 21:45:05,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:05,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:05,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:45:05,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:05,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:45:05,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:45:05,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:45:05,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:05,645 INFO L87 Difference]: Start difference. First operand 5738 states and 6855 transitions. Second operand 3 states. [2018-11-06 21:45:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:08,832 INFO L93 Difference]: Finished difference Result 13608 states and 16656 transitions. [2018-11-06 21:45:08,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:45:08,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-11-06 21:45:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:08,859 INFO L225 Difference]: With dead ends: 13608 [2018-11-06 21:45:08,859 INFO L226 Difference]: Without dead ends: 8299 [2018-11-06 21:45:08,868 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:45:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2018-11-06 21:45:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 8299. [2018-11-06 21:45:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8299 states. [2018-11-06 21:45:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8299 states to 8299 states and 9697 transitions. [2018-11-06 21:45:09,007 INFO L78 Accepts]: Start accepts. Automaton has 8299 states and 9697 transitions. Word has length 214 [2018-11-06 21:45:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:09,008 INFO L480 AbstractCegarLoop]: Abstraction has 8299 states and 9697 transitions. [2018-11-06 21:45:09,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:45:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 8299 states and 9697 transitions. [2018-11-06 21:45:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-06 21:45:09,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:09,017 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:45:09,018 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:09,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 857329193, now seen corresponding path program 1 times [2018-11-06 21:45:09,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:09,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-06 21:45:09,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:09,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:45:09,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:45:09,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:45:09,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:09,517 INFO L87 Difference]: Start difference. First operand 8299 states and 9697 transitions. Second operand 3 states. [2018-11-06 21:45:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:12,010 INFO L93 Difference]: Finished difference Result 20427 states and 24160 transitions. [2018-11-06 21:45:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:45:12,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2018-11-06 21:45:12,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:12,053 INFO L225 Difference]: With dead ends: 20427 [2018-11-06 21:45:12,054 INFO L226 Difference]: Without dead ends: 12556 [2018-11-06 21:45:12,064 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:45:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12556 states. [2018-11-06 21:45:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12556 to 12129. [2018-11-06 21:45:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12129 states. [2018-11-06 21:45:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12129 states to 12129 states and 13784 transitions. [2018-11-06 21:45:12,252 INFO L78 Accepts]: Start accepts. Automaton has 12129 states and 13784 transitions. Word has length 319 [2018-11-06 21:45:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:12,253 INFO L480 AbstractCegarLoop]: Abstraction has 12129 states and 13784 transitions. [2018-11-06 21:45:12,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:45:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12129 states and 13784 transitions. [2018-11-06 21:45:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-06 21:45:12,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:12,260 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:45:12,261 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:12,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1619990034, now seen corresponding path program 1 times [2018-11-06 21:45:12,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:12,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:12,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:12,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:12,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 291 proven. 83 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 21:45:12,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:45:12,920 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:45:12,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:13,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:45:13,299 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-11-06 21:45:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-06 21:45:13,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:45:13,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:45:13,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:45:13,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:45:13,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:45:13,619 INFO L87 Difference]: Start difference. First operand 12129 states and 13784 transitions. Second operand 6 states. [2018-11-06 21:45:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:26,859 INFO L93 Difference]: Finished difference Result 55428 states and 63295 transitions. [2018-11-06 21:45:26,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:45:26,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2018-11-06 21:45:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:26,927 INFO L225 Difference]: With dead ends: 55428 [2018-11-06 21:45:26,927 INFO L226 Difference]: Without dead ends: 36432 [2018-11-06 21:45:26,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:45:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36432 states. [2018-11-06 21:45:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36432 to 36407. [2018-11-06 21:45:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36407 states. [2018-11-06 21:45:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36407 states to 36407 states and 39285 transitions. [2018-11-06 21:45:27,655 INFO L78 Accepts]: Start accepts. Automaton has 36407 states and 39285 transitions. Word has length 337 [2018-11-06 21:45:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:27,655 INFO L480 AbstractCegarLoop]: Abstraction has 36407 states and 39285 transitions. [2018-11-06 21:45:27,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:45:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36407 states and 39285 transitions. [2018-11-06 21:45:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-11-06 21:45:27,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:27,716 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 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] [2018-11-06 21:45:27,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:27,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash 184256243, now seen corresponding path program 1 times [2018-11-06 21:45:27,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:27,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:27,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-11-06 21:45:28,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:28,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:45:28,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:45:28,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:45:28,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:28,516 INFO L87 Difference]: Start difference. First operand 36407 states and 39285 transitions. Second operand 3 states. [2018-11-06 21:45:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:31,938 INFO L93 Difference]: Finished difference Result 82182 states and 88890 transitions. [2018-11-06 21:45:31,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:45:31,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 663 [2018-11-06 21:45:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:32,019 INFO L225 Difference]: With dead ends: 82182 [2018-11-06 21:45:32,019 INFO L226 Difference]: Without dead ends: 46203 [2018-11-06 21:45:32,051 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:45:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46203 states. [2018-11-06 21:45:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46203 to 43641. [2018-11-06 21:45:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43641 states. [2018-11-06 21:45:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43641 states to 43641 states and 46942 transitions. [2018-11-06 21:45:32,647 INFO L78 Accepts]: Start accepts. Automaton has 43641 states and 46942 transitions. Word has length 663 [2018-11-06 21:45:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:32,648 INFO L480 AbstractCegarLoop]: Abstraction has 43641 states and 46942 transitions. [2018-11-06 21:45:32,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:45:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 43641 states and 46942 transitions. [2018-11-06 21:45:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-11-06 21:45:33,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:33,098 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 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] [2018-11-06 21:45:33,099 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:33,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:33,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1994359213, now seen corresponding path program 1 times [2018-11-06 21:45:33,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:33,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:33,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:33,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:33,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-11-06 21:45:33,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:33,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:45:33,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:45:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:45:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:33,821 INFO L87 Difference]: Start difference. First operand 43641 states and 46942 transitions. Second operand 3 states. [2018-11-06 21:45:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:36,871 INFO L93 Difference]: Finished difference Result 97929 states and 105345 transitions. [2018-11-06 21:45:36,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:45:36,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 688 [2018-11-06 21:45:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:36,942 INFO L225 Difference]: With dead ends: 97929 [2018-11-06 21:45:36,942 INFO L226 Difference]: Without dead ends: 54716 [2018-11-06 21:45:36,976 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:45:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54716 states. [2018-11-06 21:45:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54716 to 50030. [2018-11-06 21:45:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50030 states. [2018-11-06 21:45:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50030 states to 50030 states and 53600 transitions. [2018-11-06 21:45:37,518 INFO L78 Accepts]: Start accepts. Automaton has 50030 states and 53600 transitions. Word has length 688 [2018-11-06 21:45:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:37,519 INFO L480 AbstractCegarLoop]: Abstraction has 50030 states and 53600 transitions. [2018-11-06 21:45:37,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:45:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50030 states and 53600 transitions. [2018-11-06 21:45:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-11-06 21:45:37,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:37,575 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:45:37,575 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:37,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash -414628312, now seen corresponding path program 1 times [2018-11-06 21:45:37,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:37,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:37,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:37,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:37,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 62 proven. 615 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 21:45:39,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:45:39,008 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:45:39,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:39,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:45:39,847 WARN L179 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 30 [2018-11-06 21:45:40,686 WARN L179 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-06 21:45:46,149 WARN L179 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2018-11-06 21:45:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 491 proven. 186 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 21:45:53,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:45:53,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-11-06 21:45:53,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:45:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:45:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:45:53,585 INFO L87 Difference]: Start difference. First operand 50030 states and 53600 transitions. Second operand 13 states. [2018-11-06 21:46:05,994 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2018-11-06 21:46:08,239 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 35 [2018-11-06 21:46:13,507 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2018-11-06 21:46:17,851 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2018-11-06 21:46:22,362 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 94 [2018-11-06 21:46:31,654 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2018-11-06 21:46:51,287 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-11-06 21:47:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:34,650 INFO L93 Difference]: Finished difference Result 170679 states and 182845 transitions. [2018-11-06 21:47:34,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-06 21:47:34,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 733 [2018-11-06 21:47:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:34,794 INFO L225 Difference]: With dead ends: 170679 [2018-11-06 21:47:34,794 INFO L226 Difference]: Without dead ends: 119799 [2018-11-06 21:47:34,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 668 SyntacticMatches, 91 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2018-11-06 21:47:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119799 states. [2018-11-06 21:47:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119799 to 89927. [2018-11-06 21:47:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89927 states. [2018-11-06 21:47:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89927 states to 89927 states and 95753 transitions. [2018-11-06 21:47:36,093 INFO L78 Accepts]: Start accepts. Automaton has 89927 states and 95753 transitions. Word has length 733 [2018-11-06 21:47:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:36,094 INFO L480 AbstractCegarLoop]: Abstraction has 89927 states and 95753 transitions. [2018-11-06 21:47:36,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 21:47:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 89927 states and 95753 transitions. [2018-11-06 21:47:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2018-11-06 21:47:36,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:36,143 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,143 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:36,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1541443329, now seen corresponding path program 1 times [2018-11-06 21:47:36,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:36,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:36,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:37,213 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 23 [2018-11-06 21:47:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 491 proven. 83 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-06 21:47:38,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:47:38,192 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:47:38,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:38,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:47:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 474 proven. 62 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-06 21:47:41,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:47:41,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-11-06 21:47:41,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:47:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:47:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:47:41,164 INFO L87 Difference]: Start difference. First operand 89927 states and 95753 transitions. Second operand 12 states. [2018-11-06 21:47:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:56,878 INFO L93 Difference]: Finished difference Result 197956 states and 210710 transitions. [2018-11-06 21:47:56,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:47:56,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 757 [2018-11-06 21:47:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:56,982 INFO L225 Difference]: With dead ends: 197956 [2018-11-06 21:47:56,983 INFO L226 Difference]: Without dead ends: 108031 [2018-11-06 21:47:57,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 759 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:47:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108031 states. [2018-11-06 21:47:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108031 to 95035. [2018-11-06 21:47:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95035 states. [2018-11-06 21:47:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95035 states to 95035 states and 100731 transitions. [2018-11-06 21:47:58,415 INFO L78 Accepts]: Start accepts. Automaton has 95035 states and 100731 transitions. Word has length 757 [2018-11-06 21:47:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:58,416 INFO L480 AbstractCegarLoop]: Abstraction has 95035 states and 100731 transitions. [2018-11-06 21:47:58,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:47:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 95035 states and 100731 transitions. [2018-11-06 21:47:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2018-11-06 21:47:58,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:58,484 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,484 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:58,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1308089540, now seen corresponding path program 1 times [2018-11-06 21:47:58,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:58,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:58,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:58,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:58,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2018-11-06 21:48:00,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:00,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:48:00,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:48:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:48:00,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:48:00,083 INFO L87 Difference]: Start difference. First operand 95035 states and 100731 transitions. Second operand 5 states. [2018-11-06 21:48:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:05,011 INFO L93 Difference]: Finished difference Result 192636 states and 204028 transitions. [2018-11-06 21:48:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:48:05,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1020 [2018-11-06 21:48:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:05,127 INFO L225 Difference]: With dead ends: 192636 [2018-11-06 21:48:05,127 INFO L226 Difference]: Without dead ends: 105704 [2018-11-06 21:48:05,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:48:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105704 states. [2018-11-06 21:48:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105704 to 96190. [2018-11-06 21:48:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96190 states. [2018-11-06 21:48:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96190 states to 96190 states and 101768 transitions. [2018-11-06 21:48:06,104 INFO L78 Accepts]: Start accepts. Automaton has 96190 states and 101768 transitions. Word has length 1020 [2018-11-06 21:48:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:06,104 INFO L480 AbstractCegarLoop]: Abstraction has 96190 states and 101768 transitions. [2018-11-06 21:48:06,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:48:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 96190 states and 101768 transitions. [2018-11-06 21:48:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-11-06 21:48:06,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:06,152 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,152 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:06,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2060841842, now seen corresponding path program 1 times [2018-11-06 21:48:06,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:06,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:06,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:06,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:06,902 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-11-06 21:48:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 1001 proven. 0 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2018-11-06 21:48:08,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:08,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:48:08,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:48:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:48:08,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:48:08,616 INFO L87 Difference]: Start difference. First operand 96190 states and 101768 transitions. Second operand 4 states. [2018-11-06 21:48:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:13,059 INFO L93 Difference]: Finished difference Result 194098 states and 205698 transitions. [2018-11-06 21:48:13,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:48:13,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1035 [2018-11-06 21:48:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:13,170 INFO L225 Difference]: With dead ends: 194098 [2018-11-06 21:48:13,170 INFO L226 Difference]: Without dead ends: 104732 [2018-11-06 21:48:13,224 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:48:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104732 states. [2018-11-06 21:48:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104732 to 102158. [2018-11-06 21:48:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102158 states. [2018-11-06 21:48:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102158 states to 102158 states and 108261 transitions. [2018-11-06 21:48:14,879 INFO L78 Accepts]: Start accepts. Automaton has 102158 states and 108261 transitions. Word has length 1035 [2018-11-06 21:48:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:14,880 INFO L480 AbstractCegarLoop]: Abstraction has 102158 states and 108261 transitions. [2018-11-06 21:48:14,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:48:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 102158 states and 108261 transitions. [2018-11-06 21:48:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2018-11-06 21:48:14,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:14,944 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:14,944 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:14,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1403521198, now seen corresponding path program 1 times [2018-11-06 21:48:14,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:14,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:14,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 949 proven. 0 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2018-11-06 21:48:16,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:16,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:48:16,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:48:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:48:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:48:16,903 INFO L87 Difference]: Start difference. First operand 102158 states and 108261 transitions. Second operand 5 states. Received shutdown request... [2018-11-06 21:48:20,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:48:20,117 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:48:20,124 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:48:20,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:48:20 BoogieIcfgContainer [2018-11-06 21:48:20,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:48:20,125 INFO L168 Benchmark]: Toolchain (without parser) took 234303.84 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:48:20,127 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:48:20,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1596.49 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: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:48:20,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 498.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -884.5 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:48:20,129 INFO L168 Benchmark]: Boogie Preprocessor took 231.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:48:20,130 INFO L168 Benchmark]: RCFGBuilder took 7816.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 486.8 MB). Peak memory consumption was 486.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:48:20,130 INFO L168 Benchmark]: TraceAbstraction took 224156.32 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 1.6 GB in the beginning and 2.2 GB in the end (delta: -575.7 MB). Peak memory consumption was 951.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:48:20,135 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1596.49 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: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 498.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -884.5 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 231.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7816.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 486.8 MB). Peak memory consumption was 486.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224156.32 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 1.6 GB in the beginning and 2.2 GB in the end (delta: -575.7 MB). Peak memory consumption was 951.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 197]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 197). Cancelled while BasicCegarLoop was constructing difference of abstraction (102158states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (17495 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 224.0s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 183.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4384 SDtfs, 26738 SDslu, 2593 SDs, 0 SdLazy, 57359 SolverSat, 7968 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 160.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2086 GetRequests, 1915 SyntacticMatches, 95 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102158occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 63128 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 9107 NumberOfCodeBlocks, 9107 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 9090 ConstructedInterpolants, 866 QuantifiedInterpolants, 76810638 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2433 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 11982/13072 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown