java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:52:47,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:52:47,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:52:47,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:52:47,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:52:47,659 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:52:47,660 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:52:47,662 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:52:47,664 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:52:47,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:52:47,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:52:47,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:52:47,667 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:52:47,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:52:47,670 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:52:47,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:52:47,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:52:47,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:52:47,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:52:47,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:52:47,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:52:47,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:52:47,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:52:47,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:52:47,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:52:47,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:52:47,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:52:47,686 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:52:47,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:52:47,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:52:47,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:52:47,687 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:52:47,695 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:52:47,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:52:47,696 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:52:47,696 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:52:47,697 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:52:47,697 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:52:47,697 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:52:47,697 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:52:47,697 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:52:47,697 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:52:47,698 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:52:47,698 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:52:47,698 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:52:47,698 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:52:47,698 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:52:47,698 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:52:47,698 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:52:47,698 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:52:47,699 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:52:47,699 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:52:47,699 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:52:47,699 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:52:47,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:52:47,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:52:47,700 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:52:47,700 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:52:47,700 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:52:47,700 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:52:47,700 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:52:47,700 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:52:47,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:52:47,701 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:52:47,701 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:52:47,701 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:52:47,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:52:47,747 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:52:47,750 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:52:47,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:52:47,752 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:52:47,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:52:47,905 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:52:47,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:52:47,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:52:47,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:52:47,916 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:52:47,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:52:47" (1/1) ... [2018-01-29 22:52:47,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fea89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:47, skipping insertion in model container [2018-01-29 22:52:47,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:52:47" (1/1) ... [2018-01-29 22:52:47,935 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:52:47,972 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:52:48,093 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:52:48,114 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:52:48,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48 WrapperNode [2018-01-29 22:52:48,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:52:48,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:52:48,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:52:48,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:52:48,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (1/1) ... [2018-01-29 22:52:48,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (1/1) ... [2018-01-29 22:52:48,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (1/1) ... [2018-01-29 22:52:48,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (1/1) ... [2018-01-29 22:52:48,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (1/1) ... [2018-01-29 22:52:48,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (1/1) ... [2018-01-29 22:52:48,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (1/1) ... [2018-01-29 22:52:48,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:52:48,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:52:48,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:52:48,155 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:52:48,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (1/1) ... No working directory specified, using /storage/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-01-29 22:52:48,207 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:52:48,207 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:52:48,207 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-29 22:52:48,207 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:52:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:52:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:52:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:52:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:52:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:52:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:52:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-29 22:52:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:52:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:52:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:52:48,485 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:52:48,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:52:48 BoogieIcfgContainer [2018-01-29 22:52:48,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:52:48,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:52:48,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:52:48,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:52:48,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:52:47" (1/3) ... [2018-01-29 22:52:48,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6881af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:52:48, skipping insertion in model container [2018-01-29 22:52:48,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:52:48" (2/3) ... [2018-01-29 22:52:48,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6881af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:52:48, skipping insertion in model container [2018-01-29 22:52:48,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:52:48" (3/3) ... [2018-01-29 22:52:48,492 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:52:48,498 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:52:48,504 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-29 22:52:48,547 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:52:48,547 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:52:48,547 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:52:48,547 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:52:48,547 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:52:48,547 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:52:48,547 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:52:48,548 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:52:48,548 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:52:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-29 22:52:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:52:48,570 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:48,571 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:48,571 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash -997453167, now seen corresponding path program 1 times [2018-01-29 22:52:48,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:48,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:48,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:48,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:48,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:48,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:49,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:49,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:52:49,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:52:49,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:52:49,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:52:49,026 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 6 states. [2018-01-29 22:52:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:49,157 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-01-29 22:52:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:52:49,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-29 22:52:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:49,169 INFO L225 Difference]: With dead ends: 154 [2018-01-29 22:52:49,169 INFO L226 Difference]: Without dead ends: 87 [2018-01-29 22:52:49,172 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:52:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-29 22:52:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-29 22:52:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 22:52:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-01-29 22:52:49,210 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-01-29 22:52:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:49,211 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-01-29 22:52:49,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:52:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-01-29 22:52:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:52:49,212 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:49,212 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:49,212 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash -856277133, now seen corresponding path program 1 times [2018-01-29 22:52:49,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:49,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:49,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:49,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:49,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:49,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:49,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:49,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:52:49,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:52:49,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:52:49,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:52:49,283 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 4 states. [2018-01-29 22:52:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:49,354 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-29 22:52:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:52:49,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-29 22:52:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:49,356 INFO L225 Difference]: With dead ends: 87 [2018-01-29 22:52:49,356 INFO L226 Difference]: Without dead ends: 86 [2018-01-29 22:52:49,357 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:52:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-29 22:52:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-29 22:52:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-29 22:52:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-29 22:52:49,367 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 20 [2018-01-29 22:52:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:49,368 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-29 22:52:49,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:52:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-29 22:52:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:52:49,369 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:49,369 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:49,369 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:49,369 INFO L82 PathProgramCache]: Analyzing trace with hash -856277132, now seen corresponding path program 1 times [2018-01-29 22:52:49,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:49,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:49,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:49,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:49,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:49,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:49,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:49,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:52:49,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:52:49,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:52:49,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:52:49,468 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 5 states. [2018-01-29 22:52:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:49,517 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-29 22:52:49,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:52:49,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-29 22:52:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:49,518 INFO L225 Difference]: With dead ends: 86 [2018-01-29 22:52:49,518 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 22:52:49,519 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:52:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 22:52:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-29 22:52:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:52:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-29 22:52:49,525 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-01-29 22:52:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:49,525 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-29 22:52:49,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:52:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-29 22:52:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 22:52:49,526 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:49,526 INFO L350 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] [2018-01-29 22:52:49,526 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash -680565440, now seen corresponding path program 1 times [2018-01-29 22:52:49,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:49,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:49,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:49,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:49,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:49,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:49,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:49,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:52:49,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:52:49,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:52:49,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:52:49,610 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-01-29 22:52:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:49,716 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-29 22:52:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:52:49,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-29 22:52:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:49,717 INFO L225 Difference]: With dead ends: 89 [2018-01-29 22:52:49,717 INFO L226 Difference]: Without dead ends: 88 [2018-01-29 22:52:49,718 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:52:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-29 22:52:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-01-29 22:52:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 22:52:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-29 22:52:49,726 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 26 [2018-01-29 22:52:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:49,726 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-29 22:52:49,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:52:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-29 22:52:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 22:52:49,728 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:49,728 INFO L350 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] [2018-01-29 22:52:49,728 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:49,728 INFO L82 PathProgramCache]: Analyzing trace with hash -680565439, now seen corresponding path program 1 times [2018-01-29 22:52:49,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:49,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:49,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:49,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:49,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:49,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:49,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:49,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:52:49,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:52:49,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:52:49,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:52:49,861 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-01-29 22:52:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:50,047 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-01-29 22:52:50,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:52:50,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-29 22:52:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:50,051 INFO L225 Difference]: With dead ends: 133 [2018-01-29 22:52:50,052 INFO L226 Difference]: Without dead ends: 132 [2018-01-29 22:52:50,052 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:52:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-29 22:52:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2018-01-29 22:52:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 22:52:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-01-29 22:52:50,061 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 26 [2018-01-29 22:52:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:50,062 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-01-29 22:52:50,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:52:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-01-29 22:52:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:52:50,063 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:50,063 INFO L350 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] [2018-01-29 22:52:50,064 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1885696604, now seen corresponding path program 1 times [2018-01-29 22:52:50,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:50,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:50,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:50,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:50,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:50,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:50,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:50,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:52:50,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:52:50,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:52:50,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:52:50,165 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-01-29 22:52:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:50,293 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-01-29 22:52:50,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:52:50,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-29 22:52:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:50,295 INFO L225 Difference]: With dead ends: 99 [2018-01-29 22:52:50,295 INFO L226 Difference]: Without dead ends: 96 [2018-01-29 22:52:50,296 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:52:50,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-29 22:52:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-01-29 22:52:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 22:52:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-29 22:52:50,304 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 32 [2018-01-29 22:52:50,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:50,304 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-29 22:52:50,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:52:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-29 22:52:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:52:50,306 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:50,306 INFO L350 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] [2018-01-29 22:52:50,307 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1885696603, now seen corresponding path program 1 times [2018-01-29 22:52:50,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:50,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:50,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:50,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:50,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:50,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:50,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:50,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:52:50,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:52:50,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:52:50,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:52:50,449 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-01-29 22:52:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:50,573 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-29 22:52:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:52:50,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-29 22:52:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:50,574 INFO L225 Difference]: With dead ends: 128 [2018-01-29 22:52:50,575 INFO L226 Difference]: Without dead ends: 125 [2018-01-29 22:52:50,575 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-29 22:52:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-29 22:52:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2018-01-29 22:52:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:52:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-29 22:52:50,585 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 32 [2018-01-29 22:52:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:50,585 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-29 22:52:50,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:52:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-29 22:52:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 22:52:50,587 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:50,587 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:50,587 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash -22556054, now seen corresponding path program 1 times [2018-01-29 22:52:50,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:50,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:50,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:50,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:50,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:50,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:50,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:50,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:52:50,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:52:50,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:52:50,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:52:50,635 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 4 states. [2018-01-29 22:52:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:50,683 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-01-29 22:52:50,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:52:50,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-29 22:52:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:50,684 INFO L225 Difference]: With dead ends: 134 [2018-01-29 22:52:50,684 INFO L226 Difference]: Without dead ends: 133 [2018-01-29 22:52:50,685 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:52:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-29 22:52:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2018-01-29 22:52:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:52:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-01-29 22:52:50,694 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 36 [2018-01-29 22:52:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:50,695 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-01-29 22:52:50,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:52:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-01-29 22:52:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 22:52:50,696 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:50,696 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:50,696 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash -22556053, now seen corresponding path program 1 times [2018-01-29 22:52:50,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:50,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:50,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:50,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:50,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:50,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:50,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:50,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:52:50,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:52:50,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:52:50,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:52:50,925 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 9 states. [2018-01-29 22:52:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:51,126 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2018-01-29 22:52:51,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:52:51,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-29 22:52:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:51,128 INFO L225 Difference]: With dead ends: 184 [2018-01-29 22:52:51,128 INFO L226 Difference]: Without dead ends: 183 [2018-01-29 22:52:51,129 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:52:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-29 22:52:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 108. [2018-01-29 22:52:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-29 22:52:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-01-29 22:52:51,140 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 36 [2018-01-29 22:52:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:51,140 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-01-29 22:52:51,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:52:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-01-29 22:52:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:52:51,142 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:51,142 INFO L350 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] [2018-01-29 22:52:51,142 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1946131081, now seen corresponding path program 1 times [2018-01-29 22:52:51,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:51,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:51,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:51,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:51,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:51,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:51,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:52:51,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:52:51,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:52:51,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:52:51,267 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 6 states. [2018-01-29 22:52:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:51,408 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-01-29 22:52:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:52:51,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-29 22:52:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:51,409 INFO L225 Difference]: With dead ends: 108 [2018-01-29 22:52:51,409 INFO L226 Difference]: Without dead ends: 93 [2018-01-29 22:52:51,410 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:52:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-29 22:52:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-29 22:52:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-29 22:52:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-29 22:52:51,417 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 39 [2018-01-29 22:52:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:51,418 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-29 22:52:51,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:52:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-29 22:52:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 22:52:51,419 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:51,419 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 22:52:51,419 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:51,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1569292953, now seen corresponding path program 1 times [2018-01-29 22:52:51,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:51,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:51,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:51,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:51,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:51,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:51,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:52:51,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:52:51,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:52:51,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:52:51,452 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 3 states. [2018-01-29 22:52:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:51,503 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2018-01-29 22:52:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:52:51,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-29 22:52:51,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:51,504 INFO L225 Difference]: With dead ends: 150 [2018-01-29 22:52:51,504 INFO L226 Difference]: Without dead ends: 95 [2018-01-29 22:52:51,505 INFO L553 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-01-29 22:52:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-29 22:52:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-29 22:52:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-29 22:52:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-01-29 22:52:51,513 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 47 [2018-01-29 22:52:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:51,513 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-01-29 22:52:51,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:52:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-01-29 22:52:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 22:52:51,515 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:51,515 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 22:52:51,515 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash -115158054, now seen corresponding path program 1 times [2018-01-29 22:52:51,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:51,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:51,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:51,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:51,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:51,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:51,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:52:51,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:52:51,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:52:51,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:52:51,580 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 6 states. [2018-01-29 22:52:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:51,654 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2018-01-29 22:52:51,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:52:51,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-29 22:52:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:51,656 INFO L225 Difference]: With dead ends: 164 [2018-01-29 22:52:51,656 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 22:52:51,657 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:52:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 22:52:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-01-29 22:52:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 22:52:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-29 22:52:51,666 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 47 [2018-01-29 22:52:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:51,667 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-29 22:52:51,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:52:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-29 22:52:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:52:51,667 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:51,668 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 22:52:51,668 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1186334525, now seen corresponding path program 1 times [2018-01-29 22:52:51,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:51,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:51,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:51,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:51,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:52:51,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:51,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:52:51,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:52:51,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:52:51,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:52:51,747 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 7 states. [2018-01-29 22:52:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:51,869 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-01-29 22:52:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:52:51,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-29 22:52:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:51,871 INFO L225 Difference]: With dead ends: 99 [2018-01-29 22:52:51,871 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 22:52:51,872 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:52:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 22:52:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-29 22:52:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:52:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-29 22:52:51,910 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 50 [2018-01-29 22:52:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:51,910 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-29 22:52:51,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:52:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-29 22:52:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:52:51,911 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:51,911 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 22:52:51,912 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:51,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1186334526, now seen corresponding path program 1 times [2018-01-29 22:52:51,912 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:51,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:51,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:51,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:51,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:52,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:52,190 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:52:52,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:52,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:52,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:52:52,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:52:52,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:52,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:52,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:52:52,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:52:52,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-29 22:52:52,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:52:52,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:52,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:52,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:52,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-29 22:52:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:52,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:52,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-29 22:52:52,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 22:52:52,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 22:52:52,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-29 22:52:52,762 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 22 states. [2018-01-29 22:52:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:54,566 INFO L93 Difference]: Finished difference Result 165 states and 172 transitions. [2018-01-29 22:52:54,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 22:52:54,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-01-29 22:52:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:54,567 INFO L225 Difference]: With dead ends: 165 [2018-01-29 22:52:54,568 INFO L226 Difference]: Without dead ends: 156 [2018-01-29 22:52:54,568 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=188, Invalid=933, Unknown=1, NotChecked=0, Total=1122 [2018-01-29 22:52:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-29 22:52:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 116. [2018-01-29 22:52:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 22:52:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-01-29 22:52:54,578 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 50 [2018-01-29 22:52:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:54,578 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-01-29 22:52:54,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 22:52:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-01-29 22:52:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:52:54,579 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:54,579 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 22:52:54,580 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash -498116482, now seen corresponding path program 1 times [2018-01-29 22:52:54,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:54,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:54,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:54,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:54,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:54,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:54,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:54,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:52:54,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:52:54,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:52:54,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:52:54,628 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 4 states. [2018-01-29 22:52:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:54,762 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-01-29 22:52:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:52:54,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-29 22:52:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:54,764 INFO L225 Difference]: With dead ends: 116 [2018-01-29 22:52:54,764 INFO L226 Difference]: Without dead ends: 115 [2018-01-29 22:52:54,764 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:52:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-29 22:52:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-29 22:52:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-29 22:52:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-29 22:52:54,775 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 50 [2018-01-29 22:52:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:54,776 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-29 22:52:54,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:52:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-29 22:52:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:52:54,777 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:54,777 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 22:52:54,777 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash -498116481, now seen corresponding path program 1 times [2018-01-29 22:52:54,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:54,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:54,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:54,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:54,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:54,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:55,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:55,106 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:52:55,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:55,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:55,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:55,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-29 22:52:55,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:55,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:55,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:52:55,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-29 22:52:55,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:52:55,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:52:55,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:52:55,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-29 22:52:55,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-29 22:52:55,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:52:55,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 22:52:55,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-01-29 22:52:55,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-29 22:52:55,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-29 22:52:55,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:55,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:52:55,452 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:55,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:55,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:55,477 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:39 [2018-01-29 22:52:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:55,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:55,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-01-29 22:52:55,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 22:52:55,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 22:52:55,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-01-29 22:52:55,605 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 27 states. [2018-01-29 22:52:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:57,422 INFO L93 Difference]: Finished difference Result 264 states and 286 transitions. [2018-01-29 22:52:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 22:52:57,443 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-01-29 22:52:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:57,444 INFO L225 Difference]: With dead ends: 264 [2018-01-29 22:52:57,444 INFO L226 Difference]: Without dead ends: 263 [2018-01-29 22:52:57,444 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=258, Invalid=1464, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 22:52:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-29 22:52:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 170. [2018-01-29 22:52:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-29 22:52:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2018-01-29 22:52:57,458 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 50 [2018-01-29 22:52:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:57,458 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2018-01-29 22:52:57,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 22:52:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2018-01-29 22:52:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:52:57,459 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:57,459 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:57,459 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1640683395, now seen corresponding path program 1 times [2018-01-29 22:52:57,459 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:57,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:57,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:57,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:57,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:57,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 22:52:57,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:52:57,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:52:57,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:52:57,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:52:57,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:52:57,508 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand 5 states. [2018-01-29 22:52:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:57,571 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2018-01-29 22:52:57,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:52:57,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-01-29 22:52:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:57,574 INFO L225 Difference]: With dead ends: 170 [2018-01-29 22:52:57,574 INFO L226 Difference]: Without dead ends: 169 [2018-01-29 22:52:57,574 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:52:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-29 22:52:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-01-29 22:52:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-29 22:52:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2018-01-29 22:52:57,593 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 54 [2018-01-29 22:52:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:57,593 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2018-01-29 22:52:57,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:52:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2018-01-29 22:52:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:52:57,594 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:57,594 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:57,594 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:52:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1640683396, now seen corresponding path program 1 times [2018-01-29 22:52:57,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:57,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:57,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:57,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:57,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:57,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:57,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:57,975 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:52:57,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:58,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:58,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:58,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:58,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:58,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:52:58,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:58,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:58,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:52:58,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:58,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:58,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 22:52:58,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:52:58,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:52:58,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:58,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:58,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:52:58,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-29 22:52:58,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-29 22:52:58,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:52:58,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:58,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:58,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 22:52:58,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-29 22:52:59,130 WARN L143 SmtUtils]: Spent 618ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-29 22:52:59,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-01-29 22:52:59,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-01-29 22:52:59,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:59,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-01-29 22:52:59,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-29 22:52:59,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-01-29 22:52:59,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:59,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-01-29 22:52:59,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:59,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-01-29 22:52:59,496 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:59,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2018-01-29 22:52:59,563 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-29 22:52:59,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-01-29 22:52:59,625 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:59,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-01-29 22:52:59,678 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:59,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-29 22:52:59,680 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:59,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-29 22:52:59,731 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:59,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-01-29 22:52:59,733 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:59,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-29 22:52:59,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 22:52:59,826 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-01-29 22:53:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:53:00,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:53:00,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-01-29 22:53:00,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 22:53:00,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 22:53:00,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1379, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:53:00,025 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand 39 states. [2018-01-29 22:53:02,607 WARN L146 SmtUtils]: Spent 1669ms on a formula simplification. DAG size of input: 112 DAG size of output 79 [2018-01-29 22:53:04,846 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 133 DAG size of output 85 [2018-01-29 22:53:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:53:12,120 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2018-01-29 22:53:12,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 22:53:12,120 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 54 [2018-01-29 22:53:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:53:12,121 INFO L225 Difference]: With dead ends: 214 [2018-01-29 22:53:12,121 INFO L226 Difference]: Without dead ends: 213 [2018-01-29 22:53:12,123 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=660, Invalid=3895, Unknown=1, NotChecked=0, Total=4556 [2018-01-29 22:53:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-29 22:53:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 169. [2018-01-29 22:53:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-29 22:53:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2018-01-29 22:53:12,139 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 54 [2018-01-29 22:53:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:53:12,139 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2018-01-29 22:53:12,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 22:53:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2018-01-29 22:53:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 22:53:12,140 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:53:12,140 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 22:53:12,141 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:53:12,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1675055145, now seen corresponding path program 1 times [2018-01-29 22:53:12,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:53:12,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:53:12,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:53:12,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:53:12,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:53:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:53:12,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:53:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:53:12,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:53:12,260 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:53:12,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:53:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:53:12,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:53:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:53:12,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:53:12,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2018-01-29 22:53:12,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 22:53:12,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 22:53:12,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:53:12,381 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand 13 states. [2018-01-29 22:53:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:53:12,652 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2018-01-29 22:53:12,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 22:53:12,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-01-29 22:53:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:53:12,653 INFO L225 Difference]: With dead ends: 196 [2018-01-29 22:53:12,653 INFO L226 Difference]: Without dead ends: 195 [2018-01-29 22:53:12,653 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:53:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-29 22:53:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 169. [2018-01-29 22:53:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-29 22:53:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2018-01-29 22:53:12,665 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 60 [2018-01-29 22:53:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:53:12,665 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2018-01-29 22:53:12,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 22:53:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2018-01-29 22:53:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-29 22:53:12,666 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:53:12,666 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 22:53:12,666 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:53:12,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1682583, now seen corresponding path program 2 times [2018-01-29 22:53:12,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:53:12,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:53:12,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:53:12,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:53:12,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:53:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:53:12,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:53:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:53:13,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:53:13,052 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:53:13,057 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:53:13,072 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:53:13,079 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:53:13,082 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:53:13,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:53:13,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:53:13,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:53:13,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:53:13,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:53:13,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:53:13,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:53:13,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-29 22:53:13,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:53:13,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-29 22:53:13,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:53:13,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:53:13,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:53:13,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:43 [2018-01-29 22:53:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:53:13,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:53:13,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 28 [2018-01-29 22:53:13,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 22:53:13,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 22:53:13,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:53:13,625 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand 29 states. [2018-01-29 22:53:14,400 WARN L146 SmtUtils]: Spent 509ms on a formula simplification. DAG size of input: 63 DAG size of output 60 [2018-01-29 22:53:14,839 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 73 DAG size of output 70 [2018-01-29 22:53:15,699 WARN L146 SmtUtils]: Spent 817ms on a formula simplification. DAG size of input: 73 DAG size of output 62 [2018-01-29 22:53:16,151 WARN L146 SmtUtils]: Spent 404ms on a formula simplification. DAG size of input: 68 DAG size of output 60 [2018-01-29 22:53:17,002 WARN L146 SmtUtils]: Spent 818ms on a formula simplification. DAG size of input: 71 DAG size of output 60 [2018-01-29 22:53:17,606 WARN L146 SmtUtils]: Spent 482ms on a formula simplification. DAG size of input: 87 DAG size of output 73 [2018-01-29 22:53:17,901 WARN L146 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 93 DAG size of output 81 [2018-01-29 22:53:18,857 WARN L146 SmtUtils]: Spent 925ms on a formula simplification. DAG size of input: 72 DAG size of output 66 [2018-01-29 22:53:21,259 WARN L146 SmtUtils]: Spent 2360ms on a formula simplification. DAG size of input: 86 DAG size of output 75 [2018-01-29 22:53:23,528 WARN L146 SmtUtils]: Spent 2222ms on a formula simplification. DAG size of input: 96 DAG size of output 82 [2018-01-29 22:53:27,103 WARN L146 SmtUtils]: Spent 3536ms on a formula simplification. DAG size of input: 83 DAG size of output 74 [2018-01-29 22:53:28,923 WARN L146 SmtUtils]: Spent 1763ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-01-29 22:53:31,686 WARN L146 SmtUtils]: Spent 2727ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-01-29 22:53:33,580 WARN L146 SmtUtils]: Spent 1861ms on a formula simplification. DAG size of input: 76 DAG size of output 70 [2018-01-29 22:53:35,351 WARN L146 SmtUtils]: Spent 1703ms on a formula simplification. DAG size of input: 94 DAG size of output 85 [2018-01-29 22:53:37,630 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 85 DAG size of output 77 [2018-01-29 22:53:37,772 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 67 DAG size of output 62 [2018-01-29 22:53:41,366 WARN L146 SmtUtils]: Spent 3521ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-29 22:53:43,499 WARN L146 SmtUtils]: Spent 2080ms on a formula simplification. DAG size of input: 92 DAG size of output 78 [2018-01-29 22:53:47,322 WARN L146 SmtUtils]: Spent 3774ms on a formula simplification. DAG size of input: 86 DAG size of output 75 [2018-01-29 22:53:49,306 WARN L146 SmtUtils]: Spent 1931ms on a formula simplification. DAG size of input: 87 DAG size of output 76 [2018-01-29 22:53:51,836 WARN L146 SmtUtils]: Spent 2462ms on a formula simplification. DAG size of input: 81 DAG size of output 73 [2018-01-29 22:53:54,874 WARN L146 SmtUtils]: Spent 2954ms on a formula simplification. DAG size of input: 84 DAG size of output 73 [2018-01-29 22:53:56,963 WARN L146 SmtUtils]: Spent 2054ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-01-29 22:53:58,837 WARN L146 SmtUtils]: Spent 1826ms on a formula simplification. DAG size of input: 97 DAG size of output 86 [2018-01-29 22:54:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:54:00,899 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2018-01-29 22:54:00,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-29 22:54:00,900 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2018-01-29 22:54:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:54:00,901 INFO L225 Difference]: With dead ends: 230 [2018-01-29 22:54:00,901 INFO L226 Difference]: Without dead ends: 221 [2018-01-29 22:54:00,902 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=580, Invalid=3080, Unknown=0, NotChecked=0, Total=3660 [2018-01-29 22:54:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-29 22:54:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 128. [2018-01-29 22:54:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-29 22:54:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-01-29 22:54:00,918 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 68 [2018-01-29 22:54:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:54:00,918 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-01-29 22:54:00,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 22:54:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-01-29 22:54:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-29 22:54:00,919 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:54:00,919 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-01-29 22:54:00,920 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:54:00,920 INFO L82 PathProgramCache]: Analyzing trace with hash -876992419, now seen corresponding path program 2 times [2018-01-29 22:54:00,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:54:00,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:54:00,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:54:00,921 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:54:00,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:54:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:54:00,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:54:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:54:01,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:54:01,649 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:54:01,654 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:54:01,666 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:54:01,674 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:54:01,676 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:54:01,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:54:01,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:54:01,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:01,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:01,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-29 22:54:01,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:01,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:01,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:54:01,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:01,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:01,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-29 22:54:01,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:54:01,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:54:01,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:01,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:01,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:54:01,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-29 22:54:01,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-29 22:54:01,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:54:01,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:01,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:01,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 22:54:01,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-01-29 22:54:03,680 WARN L143 SmtUtils]: Spent 689ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-29 22:54:03,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 61 [2018-01-29 22:54:03,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-01-29 22:54:03,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:03,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:03,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 72 [2018-01-29 22:54:03,914 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-01-29 22:54:04,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-01-29 22:54:04,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:04,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-01-29 22:54:04,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:04,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-01-29 22:54:04,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:04,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-01-29 22:54:04,080 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:04,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:04,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 46 [2018-01-29 22:54:04,149 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-29 22:54:04,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:04,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 51 [2018-01-29 22:54:04,218 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-29 22:54:04,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-29 22:54:04,338 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:04,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-01-29 22:54:04,340 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:04,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-29 22:54:04,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 22:54:04,448 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:72, output treesize:81 [2018-01-29 22:54:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:54:04,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:54:04,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 44 [2018-01-29 22:54:04,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-29 22:54:04,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-29 22:54:04,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1867, Unknown=1, NotChecked=0, Total=1980 [2018-01-29 22:54:04,685 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 45 states. [2018-01-29 22:54:05,923 WARN L146 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 87 DAG size of output 71 [2018-01-29 22:54:06,325 WARN L146 SmtUtils]: Spent 313ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-01-29 22:54:08,474 WARN L146 SmtUtils]: Spent 2083ms on a formula simplification. DAG size of input: 110 DAG size of output 84 [2018-01-29 22:54:08,855 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 135 DAG size of output 99 [2018-01-29 22:54:13,523 WARN L146 SmtUtils]: Spent 1474ms on a formula simplification. DAG size of input: 123 DAG size of output 97 [2018-01-29 22:54:13,967 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 113 DAG size of output 87 [2018-01-29 22:54:14,177 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 120 DAG size of output 93 [2018-01-29 22:54:17,015 WARN L146 SmtUtils]: Spent 2728ms on a formula simplification. DAG size of input: 130 DAG size of output 100 [2018-01-29 22:54:19,587 WARN L146 SmtUtils]: Spent 2482ms on a formula simplification. DAG size of input: 130 DAG size of output 96 [2018-01-29 22:54:20,015 WARN L146 SmtUtils]: Spent 340ms on a formula simplification. DAG size of input: 137 DAG size of output 100 [2018-01-29 22:54:20,326 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 151 DAG size of output 106 [2018-01-29 22:54:24,667 WARN L146 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 130 DAG size of output 104 [2018-01-29 22:54:26,829 WARN L146 SmtUtils]: Spent 2093ms on a formula simplification. DAG size of input: 104 DAG size of output 77 [2018-01-29 22:54:29,408 WARN L146 SmtUtils]: Spent 2134ms on a formula simplification. DAG size of input: 127 DAG size of output 101 [2018-01-29 22:54:29,832 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 114 DAG size of output 90 [2018-01-29 22:54:32,113 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 102 DAG size of output 86 [2018-01-29 22:54:36,918 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-29 22:54:37,684 WARN L146 SmtUtils]: Spent 380ms on a formula simplification. DAG size of input: 100 DAG size of output 82 [2018-01-29 22:54:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:54:38,071 INFO L93 Difference]: Finished difference Result 204 states and 211 transitions. [2018-01-29 22:54:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 22:54:38,072 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 72 [2018-01-29 22:54:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:54:38,073 INFO L225 Difference]: With dead ends: 204 [2018-01-29 22:54:38,073 INFO L226 Difference]: Without dead ends: 203 [2018-01-29 22:54:38,074 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=691, Invalid=5470, Unknown=1, NotChecked=0, Total=6162 [2018-01-29 22:54:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-29 22:54:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 146. [2018-01-29 22:54:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-29 22:54:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2018-01-29 22:54:38,089 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 72 [2018-01-29 22:54:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:54:38,089 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2018-01-29 22:54:38,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-29 22:54:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2018-01-29 22:54:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-29 22:54:38,090 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:54:38,090 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:54:38,090 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:54:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash -587664963, now seen corresponding path program 2 times [2018-01-29 22:54:38,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:54:38,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:54:38,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:54:38,091 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:54:38,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:54:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:54:38,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:54:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:54:38,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:54:38,670 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:54:38,676 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:54:38,688 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:54:38,699 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:54:38,703 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:54:38,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:54:38,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:54:38,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:54:38,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:54:38,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:38,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:54:38,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:38,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:38,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:54:38,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-29 22:54:38,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:54:38,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:54:38,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-29 22:54:38,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-29 22:54:38,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:54:38,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:38,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:54:38,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-29 22:54:39,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-29 22:54:39,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:54:39,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:54:39,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-29 22:54:39,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:39,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:54:39,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:54:39,352 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-29 22:54:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:54:39,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:54:39,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-01-29 22:54:39,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 22:54:39,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 22:54:39,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2018-01-29 22:54:39,652 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand 32 states. [2018-01-29 22:54:40,232 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 77 DAG size of output 52 [2018-01-29 22:54:40,909 WARN L146 SmtUtils]: Spent 508ms on a formula simplification. DAG size of input: 97 DAG size of output 63 [2018-01-29 22:54:42,336 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 98 DAG size of output 65 [2018-01-29 22:54:44,673 WARN L146 SmtUtils]: Spent 2144ms on a formula simplification. DAG size of input: 90 DAG size of output 63 [2018-01-29 22:54:45,243 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 92 DAG size of output 70 [2018-01-29 22:54:46,042 WARN L146 SmtUtils]: Spent 717ms on a formula simplification. DAG size of input: 92 DAG size of output 70 [2018-01-29 22:54:46,346 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 84 DAG size of output 63 [2018-01-29 22:54:46,500 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 79 DAG size of output 57 [2018-01-29 22:54:46,738 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 90 DAG size of output 68 [2018-01-29 22:54:47,067 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 96 DAG size of output 70 [2018-01-29 22:54:47,500 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 93 DAG size of output 70 [2018-01-29 22:54:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:54:47,514 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2018-01-29 22:54:47,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 22:54:47,514 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-01-29 22:54:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:54:47,516 INFO L225 Difference]: With dead ends: 206 [2018-01-29 22:54:47,516 INFO L226 Difference]: Without dead ends: 205 [2018-01-29 22:54:47,517 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=394, Invalid=2468, Unknown=0, NotChecked=0, Total=2862 [2018-01-29 22:54:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-29 22:54:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 109. [2018-01-29 22:54:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 22:54:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-29 22:54:47,530 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 74 [2018-01-29 22:54:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:54:47,530 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-29 22:54:47,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 22:54:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-29 22:54:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-29 22:54:47,530 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:54:47,531 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-01-29 22:54:47,531 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-29 22:54:47,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1332322754, now seen corresponding path program 1 times [2018-01-29 22:54:47,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:54:47,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:54:47,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:54:47,532 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:54:47,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:54:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:54:47,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:54:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:54:48,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:54:48,182 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:54:48,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:54:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:54:48,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:54:48,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:54:48,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:54:48,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:54:48,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:48,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:54:48,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:48,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:54:48,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:54:48,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-29 22:54:48,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:54:48,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:54:48,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:54:48,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-29 22:54:48,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-29 22:54:48,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:54:48,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:54:48,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 22:54:48,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-29 22:54:51,199 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-29 22:54:51,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-01-29 22:54:51,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 61 [2018-01-29 22:54:51,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-29 22:54:51,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-01-29 22:54:51,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:51,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-01-29 22:54:51,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 22:54:51,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2018-01-29 22:54:51,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 22:54:51,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-29 22:54:51,669 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:51,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-01-29 22:54:51,671 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:51,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-01-29 22:54:51,743 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:51,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-01-29 22:54:51,745 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:51,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-01-29 22:54:51,819 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-01-29 22:54:51,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-01-29 22:54:51,880 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:51,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-29 22:54:51,882 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 22:54:51,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-29 22:54:51,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 22:54:51,999 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:67, output treesize:78 [2018-01-29 22:54:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:54:52,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:54:52,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2018-01-29 22:54:52,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-29 22:54:52,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-29 22:54:52,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2037, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 22:54:52,410 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 47 states. [2018-01-29 22:54:53,913 WARN L146 SmtUtils]: Spent 766ms on a formula simplification. DAG size of input: 75 DAG size of output 49 [2018-01-29 22:54:56,390 WARN L146 SmtUtils]: Spent 2182ms on a formula simplification. DAG size of input: 91 DAG size of output 70 [2018-01-29 22:54:56,750 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 91 DAG size of output 70 [2018-01-29 22:54:58,814 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 87 DAG size of output 67 [2018-01-29 22:54:59,016 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-01-29 22:54:59,273 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 101 DAG size of output 77 [2018-01-29 22:54:59,497 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 80 DAG size of output 61 [2018-01-29 22:54:59,934 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 104 DAG size of output 81 [2018-01-29 22:55:00,154 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 111 DAG size of output 88 [2018-01-29 22:55:00,330 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 84 DAG size of output 60 [2018-01-29 22:55:00,598 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 113 DAG size of output 90 [2018-01-29 22:55:01,674 WARN L146 SmtUtils]: Spent 972ms on a formula simplification. DAG size of input: 120 DAG size of output 97 [2018-01-29 22:55:01,993 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 120 DAG size of output 93 [2018-01-29 22:55:02,317 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 127 DAG size of output 101 [2018-01-29 22:55:02,679 WARN L146 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 139 DAG size of output 104 [2018-01-29 22:55:03,910 WARN L146 SmtUtils]: Spent 1039ms on a formula simplification. DAG size of input: 140 DAG size of output 106 [2018-01-29 22:55:04,322 WARN L146 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 126 DAG size of output 86 [2018-01-29 22:55:06,799 WARN L146 SmtUtils]: Spent 2258ms on a formula simplification. DAG size of input: 124 DAG size of output 84 [2018-01-29 22:55:11,000 WARN L146 SmtUtils]: Spent 582ms on a formula simplification. DAG size of input: 138 DAG size of output 104 [2018-01-29 22:55:13,242 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 89 DAG size of output 59 [2018-01-29 22:55:13,605 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 110 DAG size of output 80 [2018-01-29 22:55:14,066 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 122 DAG size of output 93 [2018-01-29 22:55:14,393 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 83 DAG size of output 60 Received shutdown request... [2018-01-29 22:55:15,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 22:55:15,632 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 22:55:15,636 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 22:55:15,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:55:15 BoogieIcfgContainer [2018-01-29 22:55:15,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:55:15,637 INFO L168 Benchmark]: Toolchain (without parser) took 147731.18 ms. Allocated memory was 299.4 MB in the beginning and 503.3 MB in the end (delta: 203.9 MB). Free memory was 259.4 MB in the beginning and 424.8 MB in the end (delta: -165.4 MB). Peak memory consumption was 38.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:55:15,638 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:55:15,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.66 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 248.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:55:15,638 INFO L168 Benchmark]: Boogie Preprocessor took 32.41 ms. Allocated memory is still 299.4 MB. Free memory was 248.4 MB in the beginning and 246.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-29 22:55:15,638 INFO L168 Benchmark]: RCFGBuilder took 331.46 ms. Allocated memory is still 299.4 MB. Free memory was 246.3 MB in the beginning and 223.7 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:55:15,639 INFO L168 Benchmark]: TraceAbstraction took 147149.44 ms. Allocated memory was 299.4 MB in the beginning and 503.3 MB in the end (delta: 203.9 MB). Free memory was 223.7 MB in the beginning and 424.8 MB in the end (delta: -201.1 MB). Peak memory consumption was 2.8 MB. Max. memory is 5.3 GB. [2018-01-29 22:55:15,640 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.66 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 248.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.41 ms. Allocated memory is still 299.4 MB. Free memory was 248.4 MB in the beginning and 246.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 331.46 ms. Allocated memory is still 299.4 MB. Free memory was 246.3 MB in the beginning and 223.7 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 147149.44 ms. Allocated memory was 299.4 MB in the beginning and 503.3 MB in the end (delta: 203.9 MB). Free memory was 223.7 MB in the beginning and 424.8 MB in the end (delta: -201.1 MB). Peak memory consumption was 2.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 37 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 15 error locations. TIMEOUT Result, 147.0s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 129.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1781 SDtfs, 8085 SDslu, 12395 SDs, 0 SdLazy, 6449 SolverSat, 327 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 948 GetRequests, 414 SyntacticMatches, 12 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4742 ImplicationChecksByTransitivity, 121.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=16, 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: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 642 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1546 NumberOfCodeBlocks, 1546 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1515 ConstructedInterpolants, 172 QuantifiedInterpolants, 1130299 SizeOfPredicates, 163 NumberOfNonLiveVariables, 1538 ConjunctsInSsa, 329 ConjunctsInUnsatCore, 31 InterpolantComputations, 15 PerfectInterpolantSequences, 28/270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-55-15-648.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-55-15-648.csv Completed graceful shutdown