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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:11:59,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:11:59,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:11:59,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:11:59,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:11:59,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:11:59,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:11:59,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:11:59,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:11:59,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:11:59,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:11:59,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:11:59,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:11:59,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:11:59,827 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:11:59,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:11:59,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:11:59,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:11:59,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:11:59,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:11:59,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:11:59,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:11:59,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:11:59,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:11:59,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:11:59,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:11:59,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:11:59,839 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:11:59,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:11:59,839 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:11:59,839 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:11:59,839 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:11:59,849 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:11:59,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:11:59,850 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:11:59,850 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:11:59,850 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:11:59,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:11:59,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:11:59,850 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:11:59,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:11:59,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:11:59,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:11:59,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:11:59,852 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:11:59,852 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:11:59,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:11:59,852 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:11:59,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:11:59,886 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:11:59,889 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:11:59,890 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:11:59,891 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:11:59,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:12:00,013 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:12:00,014 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:12:00,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:12:00,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:12:00,019 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:12:00,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4762d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00, skipping insertion in model container [2018-02-04 12:12:00,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,031 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:12:00,058 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:12:00,148 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:12:00,163 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:12:00,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00 WrapperNode [2018-02-04 12:12:00,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:12:00,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:12:00,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:12:00,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:12:00,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (1/1) ... [2018-02-04 12:12:00,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:12:00,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:12:00,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:12:00,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:12:00,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 12:12:00,233 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:12:00,233 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:12:00,233 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-02-04 12:12:00,234 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:12:00,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:12:00,389 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:12:00,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:12:00 BoogieIcfgContainer [2018-02-04 12:12:00,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:12:00,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:12:00,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:12:00,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:12:00,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:12:00" (1/3) ... [2018-02-04 12:12:00,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6edc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:12:00, skipping insertion in model container [2018-02-04 12:12:00,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:12:00" (2/3) ... [2018-02-04 12:12:00,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6edc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:12:00, skipping insertion in model container [2018-02-04 12:12:00,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:12:00" (3/3) ... [2018-02-04 12:12:00,393 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:12:00,398 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:12:00,402 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 12:12:00,423 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:12:00,423 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:12:00,423 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:12:00,423 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:12:00,423 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:12:00,423 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:12:00,423 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:12:00,423 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:12:00,424 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:12:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-02-04 12:12:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:12:00,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:00,441 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:00,441 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 680757637, now seen corresponding path program 1 times [2018-02-04 12:12:00,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:00,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:00,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:00,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:00,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:00,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:00,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:00,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:12:00,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:12:00,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:12:00,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:12:00,634 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-02-04 12:12:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:00,773 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-02-04 12:12:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:12:00,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:12:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:00,779 INFO L225 Difference]: With dead ends: 55 [2018-02-04 12:12:00,779 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 12:12:00,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:12:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 12:12:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 12:12:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:12:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 12:12:00,803 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-02-04 12:12:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:00,804 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 12:12:00,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:12:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 12:12:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:12:00,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:00,804 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:00,805 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:00,805 INFO L82 PathProgramCache]: Analyzing trace with hash 680757638, now seen corresponding path program 1 times [2018-02-04 12:12:00,805 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:00,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:00,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:00,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:00,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:00,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:00,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:00,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:12:00,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:12:00,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:12:00,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:12:00,903 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-02-04 12:12:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:01,012 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 12:12:01,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:12:01,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:12:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:01,013 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:12:01,013 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:12:01,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:12:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:12:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:12:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:12:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 12:12:01,018 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-02-04 12:12:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:01,018 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 12:12:01,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:12:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 12:12:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:12:01,019 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:01,019 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:01,019 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash -371349738, now seen corresponding path program 1 times [2018-02-04 12:12:01,019 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:01,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:01,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:01,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:01,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:01,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:01,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:12:01,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:12:01,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:12:01,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:12:01,063 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-02-04 12:12:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:01,110 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 12:12:01,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:12:01,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:12:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:01,111 INFO L225 Difference]: With dead ends: 50 [2018-02-04 12:12:01,111 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 12:12:01,111 INFO L554 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-02-04 12:12:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 12:12:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 12:12:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:12:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 12:12:01,115 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-02-04 12:12:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:01,115 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 12:12:01,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:12:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 12:12:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:12:01,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:01,116 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:01,116 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash -371349737, now seen corresponding path program 1 times [2018-02-04 12:12:01,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:01,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:01,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:01,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:01,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:01,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:01,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:12:01,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:12:01,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:12:01,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:12:01,178 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-02-04 12:12:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:01,205 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 12:12:01,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:12:01,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:12:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:01,206 INFO L225 Difference]: With dead ends: 49 [2018-02-04 12:12:01,206 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:12:01,206 INFO L554 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-02-04 12:12:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:12:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:12:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:12:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 12:12:01,210 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-02-04 12:12:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:01,210 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 12:12:01,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:12:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 12:12:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:12:01,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:01,211 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:01,211 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash -435796900, now seen corresponding path program 1 times [2018-02-04 12:12:01,211 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:01,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:01,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:01,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:01,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:01,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:01,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:12:01,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:12:01,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:12:01,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:12:01,252 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-02-04 12:12:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:01,297 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 12:12:01,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:12:01,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 12:12:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:01,298 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:12:01,298 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:12:01,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:12:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:12:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 12:12:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:12:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 12:12:01,301 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-02-04 12:12:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:01,302 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 12:12:01,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:12:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 12:12:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:12:01,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:01,302 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:01,303 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash -435796899, now seen corresponding path program 1 times [2018-02-04 12:12:01,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:01,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:01,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:01,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:01,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:01,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:01,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:12:01,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:12:01,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:12:01,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:12:01,387 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-02-04 12:12:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:01,471 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-02-04 12:12:01,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:12:01,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 12:12:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:01,474 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:12:01,474 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 12:12:01,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:12:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 12:12:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-02-04 12:12:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:12:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 12:12:01,476 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-02-04 12:12:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:01,477 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 12:12:01,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:12:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 12:12:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:12:01,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:01,477 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:01,478 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash 860706905, now seen corresponding path program 1 times [2018-02-04 12:12:01,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:01,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:01,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:01,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:01,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:01,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:01,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:12:01,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:12:01,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:12:01,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:12:01,511 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-02-04 12:12:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:01,605 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-02-04 12:12:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:12:01,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 12:12:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:01,606 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:12:01,606 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:12:01,606 INFO L554 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-02-04 12:12:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:12:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-02-04 12:12:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:12:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-04 12:12:01,608 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-02-04 12:12:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:01,608 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-04 12:12:01,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:12:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-04 12:12:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:12:01,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:01,609 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:01,609 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 860706906, now seen corresponding path program 1 times [2018-02-04 12:12:01,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:01,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:01,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:01,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:01,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:01,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:01,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:12:01,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:12:01,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:12:01,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:12:01,723 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-02-04 12:12:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:02,009 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-02-04 12:12:02,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:12:02,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 12:12:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:02,010 INFO L225 Difference]: With dead ends: 66 [2018-02-04 12:12:02,010 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 12:12:02,011 INFO L554 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-02-04 12:12:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 12:12:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-02-04 12:12:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:12:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-02-04 12:12:02,014 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-02-04 12:12:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:02,014 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-02-04 12:12:02,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:12:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-02-04 12:12:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:12:02,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:02,015 INFO L351 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] [2018-02-04 12:12:02,015 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895137, now seen corresponding path program 1 times [2018-02-04 12:12:02,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:02,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:02,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,016 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:02,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:02,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:02,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:02,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:12:02,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:12:02,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:12:02,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:12:02,061 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-02-04 12:12:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:02,121 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-02-04 12:12:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:12:02,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 12:12:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:02,122 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:12:02,122 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:12:02,123 INFO L554 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-02-04 12:12:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:12:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-04 12:12:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:12:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-02-04 12:12:02,126 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-02-04 12:12:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:02,126 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-02-04 12:12:02,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:12:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-02-04 12:12:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:12:02,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:02,127 INFO L351 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] [2018-02-04 12:12:02,127 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895136, now seen corresponding path program 1 times [2018-02-04 12:12:02,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:02,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:02,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,128 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:02,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:02,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:02,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:02,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:12:02,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:12:02,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:12:02,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:12:02,238 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-02-04 12:12:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:02,415 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-02-04 12:12:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:12:02,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 12:12:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:02,416 INFO L225 Difference]: With dead ends: 92 [2018-02-04 12:12:02,416 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 12:12:02,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:12:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 12:12:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-02-04 12:12:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:12:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-02-04 12:12:02,420 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-02-04 12:12:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:02,421 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-02-04 12:12:02,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:12:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-02-04 12:12:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:12:02,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:02,421 INFO L351 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] [2018-02-04 12:12:02,422 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:02,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1731827764, now seen corresponding path program 1 times [2018-02-04 12:12:02,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:02,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:02,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:02,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:02,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:02,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:02,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:12:02,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:12:02,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:12:02,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:12:02,468 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-02-04 12:12:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:02,473 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-02-04 12:12:02,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:12:02,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-02-04 12:12:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:02,477 INFO L225 Difference]: With dead ends: 64 [2018-02-04 12:12:02,477 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 12:12:02,478 INFO L554 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-02-04 12:12:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 12:12:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 12:12:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 12:12:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-02-04 12:12:02,481 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-02-04 12:12:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:02,481 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-02-04 12:12:02,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:12:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-02-04 12:12:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:12:02,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:02,482 INFO L351 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] [2018-02-04 12:12:02,482 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:02,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151184, now seen corresponding path program 1 times [2018-02-04 12:12:02,482 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:02,482 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:02,483 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:02,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:02,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:02,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:02,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:12:02,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:12:02,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:12:02,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:12:02,527 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-02-04 12:12:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:02,601 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-04 12:12:02,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:12:02,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 12:12:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:02,602 INFO L225 Difference]: With dead ends: 70 [2018-02-04 12:12:02,602 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 12:12:02,602 INFO L554 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-02-04 12:12:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 12:12:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-02-04 12:12:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 12:12:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-02-04 12:12:02,605 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-02-04 12:12:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:02,605 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-02-04 12:12:02,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:12:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-02-04 12:12:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:12:02,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:02,606 INFO L351 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] [2018-02-04 12:12:02,606 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1750130544, now seen corresponding path program 1 times [2018-02-04 12:12:02,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:02,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:02,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,608 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:02,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:02,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:02,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:12:02,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:12:02,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:12:02,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:12:02,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:12:02,719 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-02-04 12:12:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:02,850 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-02-04 12:12:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:12:02,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 12:12:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:02,851 INFO L225 Difference]: With dead ends: 66 [2018-02-04 12:12:02,851 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:12:02,852 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:12:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:12:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 12:12:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:12:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-02-04 12:12:02,854 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-02-04 12:12:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:02,854 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-02-04 12:12:02,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:12:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-02-04 12:12:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:12:02,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:02,855 INFO L351 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] [2018-02-04 12:12:02,856 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:12:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1520679734, now seen corresponding path program 1 times [2018-02-04 12:12:02,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:02,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:02,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,857 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:02,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:02,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:03,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:12:03,043 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:12:03,076 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:03,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:12:03,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-02-04 12:12:03,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:12:03,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:12:03,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:12:03,249 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-02-04 12:12:03,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:12:03,306 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 11 treesize of output 8 [2018-02-04 12:12:03,308 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 8 treesize of output 7 [2018-02-04 12:12:03,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-02-04 12:12:03,337 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 22 treesize of output 23 [2018-02-04 12:12:03,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 11 treesize of output 10 [2018-02-04 12:12:03,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:03,349 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-02-04 12:12:03,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-02-04 12:12:05,488 WARN L143 SmtUtils]: Spent 1972ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-04 12:12:05,553 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 40 treesize of output 50 [2018-02-04 12:12:05,556 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 38 treesize of output 31 [2018-02-04 12:12:05,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,586 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 38 treesize of output 30 [2018-02-04 12:12:05,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,610 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 30 treesize of output 23 [2018-02-04 12:12:05,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,641 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 34 treesize of output 26 [2018-02-04 12:12:05,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,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, 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-02-04 12:12:05,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,775 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-02-04 12:12:05,776 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,805 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-04 12:12:05,805 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,824 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 26 treesize of output 16 [2018-02-04 12:12:05,824 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:12:05,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:05,855 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:44, output treesize:8 [2018-02-04 12:12:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:05,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:12:05,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [12] total 29 [2018-02-04 12:12:05,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 12:12:05,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 12:12:05,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:12:05,916 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 29 states. [2018-02-04 12:12:07,539 WARN L143 SmtUtils]: Spent 1444ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-04 12:12:10,273 WARN L143 SmtUtils]: Spent 2718ms on a formula simplification that was a NOOP. DAG size: 49 [2018-02-04 12:12:15,422 WARN L143 SmtUtils]: Spent 5096ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 12:12:26,232 WARN L146 SmtUtils]: Spent 10744ms on a formula simplification. DAG size of input: 71 DAG size of output 69 [2018-02-04 12:12:37,641 WARN L146 SmtUtils]: Spent 11331ms on a formula simplification. DAG size of input: 79 DAG size of output 76 [2018-02-04 12:12:49,752 WARN L146 SmtUtils]: Spent 12061ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-02-04 12:13:01,890 WARN L146 SmtUtils]: Spent 12086ms on a formula simplification. DAG size of input: 78 DAG size of output 75 [2018-02-04 12:13:14,009 WARN L146 SmtUtils]: Spent 12087ms on a formula simplification. DAG size of input: 82 DAG size of output 77 [2018-02-04 12:13:26,129 WARN L146 SmtUtils]: Spent 12081ms on a formula simplification. DAG size of input: 79 DAG size of output 77 [2018-02-04 12:13:32,184 WARN L143 SmtUtils]: Spent 6025ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 12:13:36,272 WARN L143 SmtUtils]: Spent 4018ms on a formula simplification that was a NOOP. DAG size: 58 [2018-02-04 12:13:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:37,051 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-02-04 12:13:37,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 12:13:37,051 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-02-04 12:13:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:37,052 INFO L225 Difference]: With dead ends: 155 [2018-02-04 12:13:37,052 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 12:13:37,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 93.0s TimeCoverageRelationStatistics Valid=575, Invalid=3585, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 12:13:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 12:13:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 82. [2018-02-04 12:13:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 12:13:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 12:13:37,058 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 29 [2018-02-04 12:13:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:37,058 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 12:13:37,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 12:13:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 12:13:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:13:37,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:37,059 INFO L351 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] [2018-02-04 12:13:37,059 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:13:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1085357266, now seen corresponding path program 1 times [2018-02-04 12:13:37,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:37,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:37,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:37,061 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:37,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:37,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:37,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:13:37,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:13:37,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:13:37,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:13:37,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:13:37,213 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 11 states. [2018-02-04 12:13:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:37,326 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-02-04 12:13:37,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:13:37,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-02-04 12:13:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:37,326 INFO L225 Difference]: With dead ends: 74 [2018-02-04 12:13:37,327 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 12:13:37,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:13:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 12:13:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 12:13:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:13:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-02-04 12:13:37,329 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 31 [2018-02-04 12:13:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:37,329 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-02-04 12:13:37,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:13:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-02-04 12:13:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:13:37,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:37,329 INFO L351 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] [2018-02-04 12:13:37,329 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:13:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash -944808656, now seen corresponding path program 1 times [2018-02-04 12:13:37,330 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:37,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:37,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:37,331 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:37,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:37,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:37,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:37,510 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:13:37,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:37,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:37,544 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-02-04 12:13:37,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:13:37,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:37,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:37,578 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-02-04 12:13:37,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:13:37,605 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-02-04 12:13:37,607 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-02-04 12:13:37,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,612 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-02-04 12:13:37,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:13:37,662 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-02-04 12:13:37,663 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-02-04 12:13:37,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,673 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-02-04 12:13:37,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:13:37,808 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-02-04 12:13:37,814 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-02-04 12:13:37,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:37,821 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-02-04 12:13:37,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:37,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:37,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:37,834 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-02-04 12:13:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:37,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:37,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-02-04 12:13:37,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 12:13:37,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 12:13:37,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:13:37,893 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 23 states. [2018-02-04 12:13:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:38,573 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-04 12:13:38,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:13:38,573 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-02-04 12:13:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:38,573 INFO L225 Difference]: With dead ends: 125 [2018-02-04 12:13:38,573 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 12:13:38,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:13:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 12:13:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-02-04 12:13:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 12:13:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2018-02-04 12:13:38,575 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 31 [2018-02-04 12:13:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:38,576 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2018-02-04 12:13:38,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 12:13:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2018-02-04 12:13:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:13:38,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:38,576 INFO L351 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] [2018-02-04 12:13:38,576 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:13:38,576 INFO L82 PathProgramCache]: Analyzing trace with hash -749073262, now seen corresponding path program 1 times [2018-02-04 12:13:38,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:38,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:38,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:38,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:38,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:38,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:38,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:38,820 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:13:38,825 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:38,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:38,842 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-02-04 12:13:38,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:38,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:38,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:13:38,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:38,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:38,868 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-02-04 12:13:38,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:38,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:38,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:13:38,901 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-02-04 12:13:38,902 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-02-04 12:13:38,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:38,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:38,908 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-02-04 12:13:38,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:13:38,931 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-02-04 12:13:38,932 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-02-04 12:13:38,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:38,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:38,940 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-02-04 12:13:38,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:13:41,165 WARN L143 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 42 [2018-02-04 12:13:41,303 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-02-04 12:13:41,307 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 33 [2018-02-04 12:13:41,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:41,354 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-02-04 12:13:41,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 12:13:41,410 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 37 treesize of output 35 [2018-02-04 12:13:41,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:41,465 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 33 [2018-02-04 12:13:41,465 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:41,525 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-02-04 12:13:41,526 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 12:13:41,590 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-02-04 12:13:41,590 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:41,592 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-02-04 12:13:41,592 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:41,650 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 33 treesize of output 31 [2018-02-04 12:13:41,650 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:41,692 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-02-04 12:13:41,693 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:41,694 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 27 treesize of output 20 [2018-02-04 12:13:41,694 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:41,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 12:13:41,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:13:41,769 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-02-04 12:13:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:41,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:41,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2018-02-04 12:13:41,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:13:41,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:13:41,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:13:41,862 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 33 states. [2018-02-04 12:13:44,262 WARN L146 SmtUtils]: Spent 1849ms on a formula simplification. DAG size of input: 94 DAG size of output 68 [2018-02-04 12:13:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:47,392 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-02-04 12:13:47,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:13:47,392 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-02-04 12:13:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:47,392 INFO L225 Difference]: With dead ends: 100 [2018-02-04 12:13:47,392 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 12:13:47,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=330, Invalid=2220, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 12:13:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 12:13:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-02-04 12:13:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 12:13:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-02-04 12:13:47,395 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 33 [2018-02-04 12:13:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:47,395 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-02-04 12:13:47,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:13:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-02-04 12:13:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 12:13:47,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:47,395 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:47,396 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:13:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1199657404, now seen corresponding path program 1 times [2018-02-04 12:13:47,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:47,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:47,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:47,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:47,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:47,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:47,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:47,622 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:13:47,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:47,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:47,646 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-02-04 12:13:47,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:47,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:47,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:13:47,670 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 15 treesize of output 12 [2018-02-04 12:13:47,672 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 12 treesize of output 11 [2018-02-04 12:13:47,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:47,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:47,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:47,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 12:13:47,772 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 19 treesize of output 15 [2018-02-04 12:13:47,776 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 15 treesize of output 12 [2018-02-04 12:13:47,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:47,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:47,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:47,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 12:13:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:47,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:47,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2018-02-04 12:13:47,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:13:47,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:13:47,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:13:47,868 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 21 states. [2018-02-04 12:13:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:48,362 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-04 12:13:48,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:13:48,363 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-02-04 12:13:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:48,363 INFO L225 Difference]: With dead ends: 102 [2018-02-04 12:13:48,363 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 12:13:48,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:13:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 12:13:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2018-02-04 12:13:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 12:13:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 12:13:48,365 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 37 [2018-02-04 12:13:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:48,366 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 12:13:48,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:13:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 12:13:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:13:48,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:48,367 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:48,367 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:13:48,367 INFO L82 PathProgramCache]: Analyzing trace with hash -86467987, now seen corresponding path program 1 times [2018-02-04 12:13:48,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:48,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:48,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:48,368 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:48,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:48,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:48,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:48,423 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:13:48,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:48,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:48,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:48,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-02-04 12:13:48,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:13:48,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:13:48,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:13:48,482 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2018-02-04 12:13:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:48,585 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-02-04 12:13:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:13:48,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 12:13:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:48,585 INFO L225 Difference]: With dead ends: 75 [2018-02-04 12:13:48,586 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 12:13:48,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:13:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 12:13:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 12:13:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 12:13:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-02-04 12:13:48,588 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 38 [2018-02-04 12:13:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:48,588 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-02-04 12:13:48,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:13:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-02-04 12:13:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:13:48,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:48,589 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:48,589 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:13:48,590 INFO L82 PathProgramCache]: Analyzing trace with hash 516501250, now seen corresponding path program 2 times [2018-02-04 12:13:48,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:48,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:48,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:48,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:48,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:48,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:49,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:49,063 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:13:49,068 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:13:49,084 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:13:49,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:13:49,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:49,089 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-02-04 12:13:49,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,092 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-02-04 12:13:49,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:13:49,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:49,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:49,125 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-02-04 12:13:49,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,130 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-02-04 12:13:49,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:13:49,167 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-02-04 12:13:49,168 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-02-04 12:13:49,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 12:13:49,213 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-02-04 12:13:49,214 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-02-04 12:13:49,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:49,224 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-02-04 12:13:49,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-02-04 12:13:51,603 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 41 [2018-02-04 12:13:51,721 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-02-04 12:13:51,724 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 49 treesize of output 39 [2018-02-04 12:13:51,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:51,751 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-02-04 12:13:51,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:51,783 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-02-04 12:13:51,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-04 12:13:51,828 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-02-04 12:13:51,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:51,873 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-02-04 12:13:51,873 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:51,874 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-02-04 12:13:51,875 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:51,952 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 35 treesize of output 33 [2018-02-04 12:13:51,953 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:51,990 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-02-04 12:13:51,991 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:51,992 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-02-04 12:13:51,992 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:52,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 12:13:52,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-04 12:13:52,069 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:69, output treesize:154 [2018-02-04 12:13:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:52,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:52,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-02-04 12:13:52,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 12:13:52,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 12:13:52,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:13:52,192 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 34 states. [2018-02-04 12:13:52,782 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 77 DAG size of output 52 [2018-02-04 12:13:53,187 WARN L146 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 84 DAG size of output 60 [2018-02-04 12:13:56,508 WARN L146 SmtUtils]: Spent 1970ms on a formula simplification. DAG size of input: 61 DAG size of output 52 [2018-02-04 12:13:56,680 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 91 DAG size of output 66 [2018-02-04 12:14:02,934 WARN L146 SmtUtils]: Spent 6183ms on a formula simplification. DAG size of input: 103 DAG size of output 73 [2018-02-04 12:14:05,351 WARN L146 SmtUtils]: Spent 2337ms on a formula simplification. DAG size of input: 102 DAG size of output 70 [2018-02-04 12:14:09,050 WARN L146 SmtUtils]: Spent 2171ms on a formula simplification. DAG size of input: 110 DAG size of output 74 [2018-02-04 12:14:09,624 WARN L146 SmtUtils]: Spent 531ms on a formula simplification. DAG size of input: 121 DAG size of output 78 [2018-02-04 12:14:13,989 WARN L146 SmtUtils]: Spent 1927ms on a formula simplification. DAG size of input: 121 DAG size of output 81 [2018-02-04 12:14:14,358 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 94 DAG size of output 66 [2018-02-04 12:14:14,798 WARN L146 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-02-04 12:14:16,660 WARN L146 SmtUtils]: Spent 1554ms on a formula simplification. DAG size of input: 88 DAG size of output 65 [2018-02-04 12:14:22,956 WARN L146 SmtUtils]: Spent 6122ms on a formula simplification. DAG size of input: 89 DAG size of output 70 [2018-02-04 12:14:23,556 WARN L146 SmtUtils]: Spent 544ms on a formula simplification. DAG size of input: 89 DAG size of output 67 [2018-02-04 12:14:24,083 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 66 DAG size of output 52 [2018-02-04 12:14:24,327 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 93 DAG size of output 71 [2018-02-04 12:14:24,696 WARN L146 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 103 DAG size of output 76 [2018-02-04 12:14:25,228 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 103 DAG size of output 78 [2018-02-04 12:14:29,566 WARN L146 SmtUtils]: Spent 4180ms on a formula simplification. DAG size of input: 79 DAG size of output 65 [2018-02-04 12:14:29,856 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 82 DAG size of output 63 [2018-02-04 12:14:30,291 WARN L146 SmtUtils]: Spent 333ms on a formula simplification. DAG size of input: 79 DAG size of output 62 [2018-02-04 12:14:30,553 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 83 DAG size of output 66 [2018-02-04 12:14:32,861 WARN L146 SmtUtils]: Spent 1560ms on a formula simplification. DAG size of input: 76 DAG size of output 62 [2018-02-04 12:14:33,113 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 96 DAG size of output 75 [2018-02-04 12:14:33,361 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 104 DAG size of output 73 [2018-02-04 12:14:33,531 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 96 DAG size of output 76 [2018-02-04 12:14:41,499 WARN L146 SmtUtils]: Spent 4143ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-02-04 12:14:42,085 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 83 DAG size of output 66 [2018-02-04 12:14:43,424 WARN L146 SmtUtils]: Spent 1279ms on a formula simplification. DAG size of input: 87 DAG size of output 69 [2018-02-04 12:14:43,608 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 97 DAG size of output 75 [2018-02-04 12:14:43,815 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 97 DAG size of output 77 [2018-02-04 12:14:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:14:43,866 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-04 12:14:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 12:14:43,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-02-04 12:14:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:14:43,866 INFO L225 Difference]: With dead ends: 94 [2018-02-04 12:14:43,867 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 12:14:43,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=888, Invalid=5117, Unknown=1, NotChecked=0, Total=6006 [2018-02-04 12:14:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 12:14:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2018-02-04 12:14:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 12:14:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 12:14:43,869 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 41 [2018-02-04 12:14:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:14:43,869 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 12:14:43,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 12:14:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 12:14:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:14:43,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:14:43,870 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:14:43,870 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:14:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1929782981, now seen corresponding path program 2 times [2018-02-04 12:14:43,871 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:14:43,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:14:43,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:14:43,871 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:14:43,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:14:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:14:43,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:14:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:14:44,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:14:44,081 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:14:44,086 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:14:44,100 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:14:44,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:14:44,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:14:44,105 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-02-04 12:14:44,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,109 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-02-04 12:14:44,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:14:44,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:14:44,133 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-02-04 12:14:44,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:14:44,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:14:44,140 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-02-04 12:14:44,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:14:44,173 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-02-04 12:14:44,174 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-02-04 12:14:44,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 12:14:44,200 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-02-04 12:14:44,202 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-02-04 12:14:44,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,213 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-02-04 12:14:44,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-02-04 12:14:44,397 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-02-04 12:14:44,405 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-02-04 12:14:44,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:14:44,416 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-02-04 12:14:44,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:44,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:14:44,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:14:44,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-02-04 12:14:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:14:44,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:14:44,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-02-04 12:14:44,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:14:44,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:14:44,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:14:44,496 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 24 states. [2018-02-04 12:14:46,188 WARN L146 SmtUtils]: Spent 1250ms on a formula simplification. DAG size of input: 63 DAG size of output 48 [2018-02-04 12:14:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:14:46,954 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-02-04 12:14:46,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:14:46,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-02-04 12:14:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:14:46,955 INFO L225 Difference]: With dead ends: 89 [2018-02-04 12:14:46,955 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 12:14:46,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 12:14:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 12:14:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 47. [2018-02-04 12:14:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:14:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-04 12:14:46,956 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2018-02-04 12:14:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:14:46,956 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-04 12:14:46,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:14:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-04 12:14:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 12:14:46,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:14:46,957 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:14:46,957 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 12:14:46,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1878372829, now seen corresponding path program 1 times [2018-02-04 12:14:46,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:14:46,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:14:46,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:14:46,958 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:14:46,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:14:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:14:46,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:14:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:14:47,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:14:47,446 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:14:47,455 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:14:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:14:47,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:14:47,486 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-02-04 12:14:47,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,492 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-02-04 12:14:47,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:14:47,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:14:47,549 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-02-04 12:14:47,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:14:47,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:14:47,557 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-02-04 12:14:47,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:14:47,600 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-02-04 12:14:47,602 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-02-04 12:14:47,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,621 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-02-04 12:14:47,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:14:47,650 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-02-04 12:14:47,652 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-02-04 12:14:47,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:47,661 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-02-04 12:14:47,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-04 12:14:50,233 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 42 [2018-02-04 12:14:50,374 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-02-04 12:14:50,376 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 45 treesize of output 35 [2018-02-04 12:14:50,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:50,413 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-02-04 12:14:50,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:14:50,453 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 33 treesize of output 26 [2018-02-04 12:14:50,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:50,455 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 39 treesize of output 32 [2018-02-04 12:14:50,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:50,491 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 26 treesize of output 16 [2018-02-04 12:14:50,491 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:50,492 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 32 treesize of output 22 [2018-02-04 12:14:50,493 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:50,534 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-02-04 12:14:50,534 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-04 12:14:50,601 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 37 treesize of output 57 [2018-02-04 12:14:50,601 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-02-04 12:14:50,672 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 41 treesize of output 33 [2018-02-04 12:14:50,672 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:50,735 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 33 treesize of output 31 [2018-02-04 12:14:50,735 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-04 12:14:50,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 12:14:50,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 12:14:50,820 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:67, output treesize:106 [2018-02-04 12:14:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:14:50,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:14:50,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2018-02-04 12:14:50,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 12:14:50,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 12:14:50,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1297, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 12:14:50,974 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 38 states. [2018-02-04 12:14:51,896 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 76 DAG size of output 59 [2018-02-04 12:14:52,063 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-02-04 12:14:56,271 WARN L146 SmtUtils]: Spent 4160ms on a formula simplification. DAG size of input: 89 DAG size of output 72 [2018-02-04 12:14:56,613 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 89 DAG size of output 69 [2018-02-04 12:14:56,765 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 93 DAG size of output 73 [2018-02-04 12:14:56,993 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 110 DAG size of output 78 [2018-02-04 12:14:57,523 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 110 DAG size of output 81 [2018-02-04 12:14:57,843 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-02-04 12:14:58,164 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 77 DAG size of output 59 [2018-02-04 12:14:58,551 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 72 DAG size of output 58 [2018-02-04 12:14:58,725 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-02-04 12:15:02,957 WARN L146 SmtUtils]: Spent 4174ms on a formula simplification. DAG size of input: 90 DAG size of output 72 [2018-02-04 12:15:03,317 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 74 DAG size of output 60 [2018-02-04 12:15:03,501 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 90 DAG size of output 69 [2018-02-04 12:15:04,426 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 68 DAG size of output 54 [2018-02-04 12:15:04,636 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 94 DAG size of output 73 [2018-02-04 12:15:04,882 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 111 DAG size of output 78 [2018-02-04 12:15:08,632 WARN L146 SmtUtils]: Spent 3553ms on a formula simplification. DAG size of input: 111 DAG size of output 80 [2018-02-04 12:15:12,869 WARN L146 SmtUtils]: Spent 4119ms on a formula simplification. DAG size of input: 81 DAG size of output 67 [2018-02-04 12:15:13,663 WARN L146 SmtUtils]: Spent 425ms on a formula simplification. DAG size of input: 85 DAG size of output 68 [2018-02-04 12:15:14,073 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 103 DAG size of output 74 [2018-02-04 12:15:14,345 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 103 DAG size of output 77 [2018-02-04 12:15:17,198 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 70 DAG size of output 55 [2018-02-04 12:15:17,430 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 76 DAG size of output 61 [2018-02-04 12:15:21,613 WARN L146 SmtUtils]: Spent 4119ms on a formula simplification. DAG size of input: 83 DAG size of output 68 [2018-02-04 12:15:21,796 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-02-04 12:15:23,132 WARN L146 SmtUtils]: Spent 1254ms on a formula simplification. DAG size of input: 87 DAG size of output 69 [2018-02-04 12:15:23,337 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 104 DAG size of output 74 [2018-02-04 12:15:23,671 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 104 DAG size of output 76 [2018-02-04 12:15:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:15:23,678 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-04 12:15:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 12:15:23,678 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2018-02-04 12:15:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:15:23,678 INFO L225 Difference]: With dead ends: 90 [2018-02-04 12:15:23,678 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:15:23,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=1138, Invalid=5341, Unknown=1, NotChecked=0, Total=6480 [2018-02-04 12:15:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:15:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:15:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:15:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:15:23,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-02-04 12:15:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:15:23,680 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:15:23,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 12:15:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:15:23,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:15:23,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:15:23 BoogieIcfgContainer [2018-02-04 12:15:23,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:15:23,683 INFO L168 Benchmark]: Toolchain (without parser) took 203669.44 ms. Allocated memory was 394.8 MB in the beginning and 578.8 MB in the end (delta: 184.0 MB). Free memory was 352.8 MB in the beginning and 486.7 MB in the end (delta: -133.9 MB). Peak memory consumption was 50.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:15:23,684 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 394.8 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:15:23,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.06 ms. Allocated memory is still 394.8 MB. Free memory was 351.5 MB in the beginning and 340.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:15:23,684 INFO L168 Benchmark]: Boogie Preprocessor took 23.68 ms. Allocated memory is still 394.8 MB. Free memory was 340.9 MB in the beginning and 339.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:15:23,684 INFO L168 Benchmark]: RCFGBuilder took 196.27 ms. Allocated memory is still 394.8 MB. Free memory was 339.6 MB in the beginning and 318.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:15:23,684 INFO L168 Benchmark]: TraceAbstraction took 203293.13 ms. Allocated memory was 394.8 MB in the beginning and 578.8 MB in the end (delta: 184.0 MB). Free memory was 318.3 MB in the beginning and 486.7 MB in the end (delta: -168.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:15:23,685 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.16 ms. Allocated memory is still 394.8 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.06 ms. Allocated memory is still 394.8 MB. Free memory was 351.5 MB in the beginning and 340.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.68 ms. Allocated memory is still 394.8 MB. Free memory was 340.9 MB in the beginning and 339.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 196.27 ms. Allocated memory is still 394.8 MB. Free memory was 339.6 MB in the beginning and 318.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 203293.13 ms. Allocated memory was 394.8 MB in the beginning and 578.8 MB in the end (delta: 184.0 MB). Free memory was 318.3 MB in the beginning and 486.7 MB in the end (delta: -168.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. SAFE Result, 203.2s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 186.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 791 SDtfs, 2480 SDslu, 3945 SDs, 0 SdLazy, 5661 SolverSat, 491 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 711 GetRequests, 226 SyntacticMatches, 12 SemanticMatches, 473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4479 ImplicationChecksByTransitivity, 185.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred 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.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 322 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 863 ConstructedInterpolants, 89 QuantifiedInterpolants, 388020 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1365 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 24/188 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-15-23-690.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-15-23-690.csv Received shutdown request...