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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:37:00,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:37:00,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:37:00,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:37:00,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:37:00,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:37:00,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:37:00,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:37:00,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:37:00,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:37:00,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:37:00,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:37:00,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:37:00,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:37:00,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:37:00,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:37:00,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:37:00,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:37:00,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:37:00,400 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:37:00,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:37:00,402 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:37:00,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:37:00,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:37:00,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:37:00,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:37:00,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:37:00,405 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:37:00,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:37:00,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:37:00,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:37:00,406 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:37:00,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:37:00,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:37:00,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:37:00,415 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:37:00,415 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:37:00,415 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:37:00,415 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:37:00,415 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:37:00,415 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:37:00,415 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:37:00,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:37:00,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:37:00,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:37:00,417 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:37:00,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:37:00,417 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:37:00,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:37:00,449 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:37:00,451 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:37:00,452 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:37:00,452 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:37:00,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:37:00,567 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:37:00,568 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:37:00,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:37:00,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:37:00,572 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:37:00,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5663edf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00, skipping insertion in model container [2018-02-04 17:37:00,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,583 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:37:00,610 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:37:00,696 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:37:00,712 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:37:00,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00 WrapperNode [2018-02-04 17:37:00,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:37:00,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:37:00,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:37:00,720 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:37:00,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00" (1/1) ... [2018-02-04 17:37:00,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:37:00,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:37:00,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:37:00,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:37:00,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37: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 17:37:00,784 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:37:00,784 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:37:00,785 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 17:37:00,785 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-04 17:37:00,785 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-02-04 17:37:00,785 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-04 17:37:00,785 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-02-04 17:37:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:37:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:37:00,786 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:37:01,005 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:37:01,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:37:01 BoogieIcfgContainer [2018-02-04 17:37:01,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:37:01,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:37:01,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:37:01,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:37:01,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:37:00" (1/3) ... [2018-02-04 17:37:01,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3c7b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:37:01, skipping insertion in model container [2018-02-04 17:37:01,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:00" (2/3) ... [2018-02-04 17:37:01,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3c7b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:37:01, skipping insertion in model container [2018-02-04 17:37:01,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:37:01" (3/3) ... [2018-02-04 17:37:01,011 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:37:01,016 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:37:01,021 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 17:37:01,042 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:37:01,042 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:37:01,042 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:37:01,042 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:37:01,042 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:37:01,042 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:37:01,043 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:37:01,043 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:37:01,043 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:37:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-02-04 17:37:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:37:01,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:01,059 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:01,060 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:01,062 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-02-04 17:37:01,063 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:01,063 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:01,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,094 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:01,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:01,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:01,145 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:01,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:01,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:01,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:01,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:01,267 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 17:37:01,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:37:01,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-02-04 17:37:01,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:37:01,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:37:01,311 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 17:37:01,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:01,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:37:01,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:37:01,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:37:01,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:37:01,323 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-02-04 17:37:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:01,436 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-04 17:37:01,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:37:01,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 17:37:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:01,445 INFO L225 Difference]: With dead ends: 89 [2018-02-04 17:37:01,445 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 17:37:01,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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 17:37:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 17:37:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 17:37:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 17:37:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-04 17:37:01,472 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-02-04 17:37:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:01,472 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-04 17:37:01,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:37:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-04 17:37:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:37:01,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:01,473 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:01,473 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:01,474 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-02-04 17:37:01,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:01,474 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:01,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:01,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37: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 17:37:01,496 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:01,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:01,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:01,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:01,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:01,528 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 17:37:01,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,534 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 17:37:01,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:37:01,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:01,559 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 17:37:01,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:01,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:01,594 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 17:37:01,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:01,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-02-04 17:37:01,614 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 17:37:01,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:01,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:37:01,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:37:01,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:37:01,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:37:01,616 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-02-04 17:37:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:01,697 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-02-04 17:37:01,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:37:01,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:37:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:01,699 INFO L225 Difference]: With dead ends: 85 [2018-02-04 17:37:01,699 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 17:37:01,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 17:37:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 17:37:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 17:37:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 17:37:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-02-04 17:37:01,705 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-02-04 17:37:01,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:01,706 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-02-04 17:37:01,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:37:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-02-04 17:37:01,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:37:01,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:01,706 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:01,706 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:01,707 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-02-04 17:37:01,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:01,707 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:01,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:01,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:01,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:01,750 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 17:37:01,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:01,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:37:01,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:37:01,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:37:01,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:37:01,751 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-02-04 17:37:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:01,808 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-04 17:37:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:37:01,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:37:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:01,809 INFO L225 Difference]: With dead ends: 84 [2018-02-04 17:37:01,809 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 17:37:01,809 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 17:37:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 17:37:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 17:37:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 17:37:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-04 17:37:01,812 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-02-04 17:37:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:01,812 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-04 17:37:01,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:37:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-04 17:37:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:37:01,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:01,813 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:01,813 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:01,813 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-02-04 17:37:01,813 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:01,813 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:01,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:01,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:01,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:01,863 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 17:37:01,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:01,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:37:01,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:37:01,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:37:01,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:37:01,864 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-02-04 17:37:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:01,895 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-04 17:37:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:37:01,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:37:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:01,897 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:37:01,898 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:37:01,898 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 17:37:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:37:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 17:37:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 17:37:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-04 17:37:01,902 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-02-04 17:37:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:01,903 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-04 17:37:01,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:37:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-04 17:37:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:37:01,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:01,904 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:01,904 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:01,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-02-04 17:37:01,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:01,904 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:01,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,905 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:01,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:01,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:01,939 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 17:37:01,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:01,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:37:01,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:37:01,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:37:01,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:37:01,940 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-02-04 17:37:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:02,016 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-02-04 17:37:02,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:37:02,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 17:37:02,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:02,017 INFO L225 Difference]: With dead ends: 82 [2018-02-04 17:37:02,017 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 17:37:02,018 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 17:37:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 17:37:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 17:37:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 17:37:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 17:37:02,022 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-02-04 17:37:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:02,023 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 17:37:02,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:37:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 17:37:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:37:02,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:02,024 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:02,024 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:02,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-02-04 17:37:02,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:02,024 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:02,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:02,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:02,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:02,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:02,098 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 17:37:02,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:02,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:37:02,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:37:02,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:37:02,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:37:02,099 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-02-04 17:37:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:02,233 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-04 17:37:02,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:37:02,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 17:37:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:02,234 INFO L225 Difference]: With dead ends: 81 [2018-02-04 17:37:02,234 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 17:37:02,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:37:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 17:37:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 17:37:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 17:37:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-04 17:37:02,237 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-02-04 17:37:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:02,238 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-04 17:37:02,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:37:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-04 17:37:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:37:02,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:02,239 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] [2018-02-04 17:37:02,239 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-02-04 17:37:02,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:02,239 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:02,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:02,240 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:02,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:02,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:02,286 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 17:37:02,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:02,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:37:02,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:37:02,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:37:02,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:37:02,287 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-02-04 17:37:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:02,389 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-04 17:37:02,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:37:02,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 17:37:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:02,390 INFO L225 Difference]: With dead ends: 80 [2018-02-04 17:37:02,390 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 17:37:02,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:37:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 17:37:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 17:37:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 17:37:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-04 17:37:02,394 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-02-04 17:37:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:02,394 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-04 17:37:02,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:37:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-04 17:37:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:37:02,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:02,395 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] [2018-02-04 17:37:02,395 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-02-04 17:37:02,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:02,395 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:02,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:02,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:02,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:02,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:02,482 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 17:37:02,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:02,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:37:02,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:37:02,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:37:02,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:37:02,483 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-02-04 17:37:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:02,593 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-04 17:37:02,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:37:02,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 17:37:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:02,599 INFO L225 Difference]: With dead ends: 104 [2018-02-04 17:37:02,599 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 17:37:02,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:37:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 17:37:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-02-04 17:37:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 17:37:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-04 17:37:02,604 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-02-04 17:37:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:02,604 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-04 17:37:02,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:37:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-04 17:37:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:37:02,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:02,604 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] [2018-02-04 17:37:02,604 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-02-04 17:37:02,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:02,605 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:02,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:02,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:02,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:02,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:02,843 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 17:37:02,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:02,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:37:02,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:37:02,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:37:02,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:37:02,845 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-02-04 17:37:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:03,108 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-04 17:37:03,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:37:03,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-04 17:37:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:03,109 INFO L225 Difference]: With dead ends: 104 [2018-02-04 17:37:03,109 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 17:37:03,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:37:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 17:37:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-02-04 17:37:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 17:37:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-04 17:37:03,112 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-02-04 17:37:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:03,113 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-04 17:37:03,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:37:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-04 17:37:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:37:03,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:03,113 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] [2018-02-04 17:37:03,113 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-02-04 17:37:03,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:03,113 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:03,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:03,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:03,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:03,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:03,362 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 17:37:03,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:03,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:03,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:03,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:03,400 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 17:37:03,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:03,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:03,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:37:03,416 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 16 treesize of output 13 [2018-02-04 17:37:03,417 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 17:37:03,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:03,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:03,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:03,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:37:03,504 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 17:37:03,508 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 17:37:03,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:03,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:03,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:03,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:40 [2018-02-04 17:37:03,599 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 17:37:03,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:03,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 17:37:03,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:37:03,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:37:03,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:37:03,600 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 22 states. [2018-02-04 17:37:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:04,246 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-02-04 17:37:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:37:04,246 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-02-04 17:37:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:04,247 INFO L225 Difference]: With dead ends: 115 [2018-02-04 17:37:04,247 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 17:37:04,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:37:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 17:37:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2018-02-04 17:37:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 17:37:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-02-04 17:37:04,251 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 27 [2018-02-04 17:37:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:04,252 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-02-04 17:37:04,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:37:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-02-04 17:37:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:37:04,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:04,253 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 17:37:04,253 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-02-04 17:37:04,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:04,253 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:04,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:04,254 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:04,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:04,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:04,264 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:04,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:04,265 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:04,265 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:04,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:04,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:04,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-04 17:37:04,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 15 [2018-02-04 17:37:04,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:04,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:04,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:37:04,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:37:04,357 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc20.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc20.base| 1))) (and (= (store (store .cse0 |c_main_#t~malloc21.base| 1) |main_#t~malloc20.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_#t~malloc20.base|) 0) (= (select .cse0 |c_main_#t~malloc21.base|) 0)))) is different from true [2018-02-04 17:37:04,364 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc20.base| Int) (|main_#t~malloc21.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc20.base| 1))) (and (= (store (store (store .cse0 |main_#t~malloc21.base| 1) |main_#t~malloc20.base| 0) |main_#t~malloc21.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_#t~malloc20.base|) 0) (= (select .cse0 |main_#t~malloc21.base|) 0)))) is different from true [2018-02-04 17:37:04,370 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 17:37:04,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:04,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:37:04,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:37:04,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:37:04,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-02-04 17:37:04,371 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 8 states. [2018-02-04 17:37:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:04,543 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-02-04 17:37:04,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:37:04,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 17:37:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:04,543 INFO L225 Difference]: With dead ends: 103 [2018-02-04 17:37:04,543 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 17:37:04,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-02-04 17:37:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 17:37:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-04 17:37:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 17:37:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-02-04 17:37:04,547 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 28 [2018-02-04 17:37:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:04,547 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-02-04 17:37:04,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:37:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-02-04 17:37:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:37:04,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:04,548 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, 1, 1, 1] [2018-02-04 17:37:04,548 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:04,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-02-04 17:37:04,548 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:04,548 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:04,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:04,549 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:04,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:04,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:04,580 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 17:37:04,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:04,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:37:04,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:37:04,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:37:04,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:37:04,581 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 6 states. [2018-02-04 17:37:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:04,640 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-02-04 17:37:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:37:04,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 17:37:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:04,641 INFO L225 Difference]: With dead ends: 78 [2018-02-04 17:37:04,641 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 17:37:04,641 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 17:37:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 17:37:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 17:37:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 17:37:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-02-04 17:37:04,643 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 31 [2018-02-04 17:37:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:04,643 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-02-04 17:37:04,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:37:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-02-04 17:37:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:37:04,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:04,644 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, 1, 1, 1] [2018-02-04 17:37:04,644 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-02-04 17:37:04,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:04,644 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:04,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:04,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:04,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:04,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:04,707 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 17:37:04,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:04,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:37:04,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:37:04,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:37:04,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:37:04,708 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 9 states. [2018-02-04 17:37:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:04,803 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-04 17:37:04,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:37:04,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 17:37:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:04,804 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:37:04,804 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:37:04,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:37:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:37:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 17:37:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 17:37:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-02-04 17:37:04,806 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 31 [2018-02-04 17:37:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:04,806 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-02-04 17:37:04,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:37:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-02-04 17:37:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 17:37:04,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:04,806 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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 17:37:04,806 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash 856985286, now seen corresponding path program 2 times [2018-02-04 17:37:04,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:04,807 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:04,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:04,807 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:04,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:04,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:37:04,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:04,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:04,932 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:37:04,958 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:37:04,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:04,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:04,972 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 17:37:04,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:04,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:04,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:37:04,982 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 17:37:04,984 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 17:37:04,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:04,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:04,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:04,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:37:05,016 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 17:37:05,026 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 17:37:05,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:05,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:05,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:05,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:37:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 17:37:05,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:05,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2018-02-04 17:37:05,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:37:05,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:37:05,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:37:05,068 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 15 states. [2018-02-04 17:37:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:05,288 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-04 17:37:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:37:05,288 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-02-04 17:37:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:05,288 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:37:05,288 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:37:05,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:37:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:37:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-02-04 17:37:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:37:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 17:37:05,291 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 35 [2018-02-04 17:37:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:05,291 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 17:37:05,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:37:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 17:37:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:37:05,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:05,292 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, 1, 1, 1, 1, 1] [2018-02-04 17:37:05,292 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-02-04 17:37:05,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:05,293 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:05,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:05,293 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:05,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:05,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:05,306 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:05,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:05,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:05,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:05,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:05,338 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 17:37:05,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:05,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:05,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:37:05,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:05,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:05,359 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 17:37:05,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:05,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:05,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 17:37:05,381 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 17:37:05,382 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 17:37:05,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:05,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:05,389 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 17:37:05,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 17:37:05,403 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 17:37:05,408 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 17:37:05,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:05,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:05,418 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 17:37:05,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-02-04 17:37:11,712 WARN L146 SmtUtils]: Spent 2185ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-02-04 17:37:11,778 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 38 treesize of output 50 [2018-02-04 17:37:11,783 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 42 treesize of output 34 [2018-02-04 17:37:11,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:11,816 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:37:11,816 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 0 case distinctions, treesize of input 30 treesize of output 26 [2018-02-04 17:37:11,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:11,843 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 20 treesize of output 12 [2018-02-04 17:37:11,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:11,865 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:37:11,865 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 0 case distinctions, treesize of input 26 treesize of output 22 [2018-02-04 17:37:11,865 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:11,885 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:37:11,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2018-02-04 17:37:11,887 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:11,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:11,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:11,906 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:70, output treesize:3 [2018-02-04 17:37:11,931 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 17:37:11,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:11,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 17:37:11,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:37:11,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:37:11,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=200, Unknown=2, NotChecked=0, Total=240 [2018-02-04 17:37:11,932 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 16 states. [2018-02-04 17:37:14,055 WARN L143 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 56 [2018-02-04 17:37:14,214 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 67 DAG size of output 45 [2018-02-04 17:37:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:14,370 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-02-04 17:37:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:37:14,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-02-04 17:37:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:14,371 INFO L225 Difference]: With dead ends: 97 [2018-02-04 17:37:14,371 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 17:37:14,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=111, Invalid=487, Unknown=2, NotChecked=0, Total=600 [2018-02-04 17:37:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 17:37:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 17:37:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:37:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 17:37:14,373 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-04 17:37:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:14,373 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 17:37:14,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:37:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 17:37:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:37:14,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:14,374 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, 1, 1, 1, 1, 1] [2018-02-04 17:37:14,374 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-02-04 17:37:14,374 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:14,374 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:14,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:14,375 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:14,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:14,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:14,397 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:14,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:14,397 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:14,398 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:14,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:14,425 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 17:37:14,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,430 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 17:37:14,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:14,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:14,455 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 17:37:14,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:14,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:14,465 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 17:37:14,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:37:14,497 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 17:37:14,498 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 17:37:14,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 17:37:14,516 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 17:37:14,517 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 17:37:14,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:14,525 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 17:37:14,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-02-04 17:37:18,405 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 34 treesize of output 32 [2018-02-04 17:37:18,407 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 17:37:18,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:18,414 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 18 treesize of output 15 [2018-02-04 17:37:18,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:18,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:18,424 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 17:37:18,424 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:54 [2018-02-04 17:37:18,498 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 17:37:18,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:18,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:37:18,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:37:18,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:37:18,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=233, Unknown=2, NotChecked=0, Total=272 [2018-02-04 17:37:18,499 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 17 states. [2018-02-04 17:37:20,027 WARN L146 SmtUtils]: Spent 1091ms on a formula simplification. DAG size of input: 69 DAG size of output 56 [2018-02-04 17:37:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:20,436 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-02-04 17:37:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:37:20,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-02-04 17:37:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:20,438 INFO L225 Difference]: With dead ends: 81 [2018-02-04 17:37:20,438 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 17:37:20,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=117, Invalid=637, Unknown=2, NotChecked=0, Total=756 [2018-02-04 17:37:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 17:37:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 17:37:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 17:37:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-04 17:37:20,441 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-02-04 17:37:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:20,442 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-04 17:37:20,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:37:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-04 17:37:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 17:37:20,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:20,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:20,443 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-02-04 17:37:20,443 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:20,443 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:20,444 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:20,444 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:20,444 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:20,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:20,477 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 17:37:20,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:20,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:37:20,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:37:20,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:37:20,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:37:20,478 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-02-04 17:37:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:20,568 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-02-04 17:37:20,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:37:20,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 17:37:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:20,569 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:37:20,569 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 17:37:20,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:37:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 17:37:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 17:37:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 17:37:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 17:37:20,572 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-02-04 17:37:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:20,572 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 17:37:20,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:37:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 17:37:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 17:37:20,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:20,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:20,573 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-02-04 17:37:20,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:20,573 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:20,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:20,574 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:20,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:20,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:20,672 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 17:37:20,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:20,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:37:20,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:37:20,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:37:20,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:37:20,674 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-02-04 17:37:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:20,718 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-04 17:37:20,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:37:20,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 17:37:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:20,719 INFO L225 Difference]: With dead ends: 111 [2018-02-04 17:37:20,719 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 17:37:20,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:37:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 17:37:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 17:37:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 17:37:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-04 17:37:20,724 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-02-04 17:37:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:20,725 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-04 17:37:20,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:37:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-04 17:37:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 17:37:20,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:20,725 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:20,725 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-02-04 17:37:20,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:20,726 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:20,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:20,727 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:20,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:20,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:20,748 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:20,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:20,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:20,749 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:37:20,784 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:37:20,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:20,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:20,799 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 17:37:20,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,824 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 17:37:20,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:20,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:20,845 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 17:37:20,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:20,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:20,857 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 17:37:20,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:37:20,914 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 17:37:20,918 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 17:37:20,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-02-04 17:37:20,946 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 17:37:20,949 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 17:37:20,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:20,961 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 17:37:20,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-04 17:37:23,119 WARN L146 SmtUtils]: Spent 2016ms on a formula simplification. DAG size of input: 41 DAG size of output 30 [2018-02-04 17:37:23,229 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 44 treesize of output 56 [2018-02-04 17:37:23,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2018-02-04 17:37:23,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:23,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-02-04 17:37:23,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:23,309 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 34 treesize of output 32 [2018-02-04 17:37:23,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:23,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-02-04 17:37:23,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:23,350 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 36 treesize of output 27 [2018-02-04 17:37:23,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:23,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-02-04 17:37:23,368 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:23,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 30 [2018-02-04 17:37:23,392 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:23,408 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 21 treesize of output 19 [2018-02-04 17:37:23,409 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:23,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:37:23,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 17:37:23,428 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:38 [2018-02-04 17:37:23,499 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 17:37:23,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:23,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:37:23,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:37:23,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:37:23,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:37:23,500 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 19 states. [2018-02-04 17:37:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:26,500 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2018-02-04 17:37:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:37:26,500 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-02-04 17:37:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:26,501 INFO L225 Difference]: With dead ends: 161 [2018-02-04 17:37:26,501 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 17:37:26,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:37:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 17:37:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2018-02-04 17:37:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 17:37:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2018-02-04 17:37:26,504 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 41 [2018-02-04 17:37:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:26,504 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2018-02-04 17:37:26,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:37:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2018-02-04 17:37:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 17:37:26,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:26,505 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:26,505 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-02-04 17:37:26,505 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:26,505 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:26,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:26,506 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:26,506 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:26,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:26,520 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:26,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:26,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:26,521 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:26,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:26,552 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 17:37:26,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:26,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:26,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 17:37:26,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 17:37:26,573 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 17:37:26,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:26,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:26,581 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 17:37:26,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2018-02-04 17:37:26,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-02-04 17:37:26,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 28 treesize of output 27 [2018-02-04 17:37:26,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:26,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:26,627 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 17:37:26,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-02-04 17:37:26,907 WARN L143 SmtUtils]: Spent 178ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-04 17:37:27,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2018-02-04 17:37:27,063 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 29 treesize of output 19 [2018-02-04 17:37:27,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:27,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:27,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 17:37:27,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:27,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:27,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:37:27,105 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-02-04 17:37:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 17:37:27,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:27,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:37:27,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:37:27,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:37:27,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:37:27,248 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand 21 states. [2018-02-04 17:37:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:28,205 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2018-02-04 17:37:28,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:37:28,206 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-02-04 17:37:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:28,207 INFO L225 Difference]: With dead ends: 172 [2018-02-04 17:37:28,207 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 17:37:28,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:37:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 17:37:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-02-04 17:37:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 17:37:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2018-02-04 17:37:28,212 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 43 [2018-02-04 17:37:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:28,212 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2018-02-04 17:37:28,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:37:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-02-04 17:37:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 17:37:28,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:28,213 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:28,213 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-02-04 17:37:28,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:28,213 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:28,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:28,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:28,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:28,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:28,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:28,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:28,266 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:28,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:28,292 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 17:37:28,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:28,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:28,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:37:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:37:28,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:28,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2018-02-04 17:37:28,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:37:28,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:37:28,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:37:28,346 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 13 states. [2018-02-04 17:37:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:28,483 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2018-02-04 17:37:28,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:37:28,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-04 17:37:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:28,483 INFO L225 Difference]: With dead ends: 154 [2018-02-04 17:37:28,483 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 17:37:28,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:37:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 17:37:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-04 17:37:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 17:37:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-02-04 17:37:28,486 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 45 [2018-02-04 17:37:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:28,486 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-02-04 17:37:28,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:37:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-02-04 17:37:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 17:37:28,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:28,487 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:28,487 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:28,487 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-02-04 17:37:28,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:28,487 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:28,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:28,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:28,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:28,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:28,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:28,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:28,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:28,601 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:28,616 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 17:37:28,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:28,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:28,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:37:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:28,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:28,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2018-02-04 17:37:28,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:37:28,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:37:28,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:37:28,860 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 29 states. [2018-02-04 17:37:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:31,367 INFO L93 Difference]: Finished difference Result 199 states and 237 transitions. [2018-02-04 17:37:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:37:31,368 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2018-02-04 17:37:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:31,369 INFO L225 Difference]: With dead ends: 199 [2018-02-04 17:37:31,369 INFO L226 Difference]: Without dead ends: 199 [2018-02-04 17:37:31,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=1768, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:37:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-04 17:37:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 175. [2018-02-04 17:37:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 17:37:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 214 transitions. [2018-02-04 17:37:31,374 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 214 transitions. Word has length 45 [2018-02-04 17:37:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:31,374 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 214 transitions. [2018-02-04 17:37:31,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:37:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 214 transitions. [2018-02-04 17:37:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 17:37:31,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:31,374 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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 17:37:31,374 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:31,374 INFO L82 PathProgramCache]: Analyzing trace with hash -156113105, now seen corresponding path program 3 times [2018-02-04 17:37:31,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:31,375 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:31,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:31,375 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:31,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:31,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:31,389 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:31,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:31,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:31,390 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:37:31,417 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:37:31,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:31,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:31,429 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 17:37:31,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,433 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 17:37:31,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:31,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:31,464 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 17:37:31,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:31,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:31,472 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 17:37:31,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:37:31,491 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 15 treesize of output 12 [2018-02-04 17:37:31,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 12 treesize of output 11 [2018-02-04 17:37:31,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:37:31,510 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 28 treesize of output 29 [2018-02-04 17:37:31,511 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 17:37:31,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,518 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 17:37:31,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 17:37:31,702 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 33 treesize of output 31 [2018-02-04 17:37:31,704 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 17:37:31,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:31,713 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 17 treesize of output 14 [2018-02-04 17:37:31,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:31,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:31,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:31,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-04 17:37:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:37:31,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:31,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:37:31,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:37:31,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:37:31,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:37:31,808 INFO L87 Difference]: Start difference. First operand 175 states and 214 transitions. Second operand 17 states. [2018-02-04 17:37:32,746 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 73 DAG size of output 56 [2018-02-04 17:37:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:32,830 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-02-04 17:37:32,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:37:32,830 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-02-04 17:37:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:32,831 INFO L225 Difference]: With dead ends: 174 [2018-02-04 17:37:32,832 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:37:32,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:37:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:37:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2018-02-04 17:37:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 17:37:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2018-02-04 17:37:32,834 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 46 [2018-02-04 17:37:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:32,834 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2018-02-04 17:37:32,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:37:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-02-04 17:37:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 17:37:32,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:32,835 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:32,835 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-02-04 17:37:32,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:32,835 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:32,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:32,836 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:32,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:32,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:37:32,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:32,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:37:32,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:37:32,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:37:32,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:37:32,869 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 8 states. [2018-02-04 17:37:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:32,979 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2018-02-04 17:37:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:37:32,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-04 17:37:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:32,980 INFO L225 Difference]: With dead ends: 117 [2018-02-04 17:37:32,980 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 17:37:32,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:37:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 17:37:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-04 17:37:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 17:37:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2018-02-04 17:37:32,983 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 47 [2018-02-04 17:37:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:32,983 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2018-02-04 17:37:32,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:37:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-02-04 17:37:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 17:37:32,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:32,984 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:32,984 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:32,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-02-04 17:37:32,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:32,985 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:32,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:32,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:32,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:32,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:37:33,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:33,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:37:33,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:37:33,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:37:33,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:37:33,024 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand 5 states. [2018-02-04 17:37:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:33,062 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2018-02-04 17:37:33,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:37:33,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-04 17:37:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:33,063 INFO L225 Difference]: With dead ends: 119 [2018-02-04 17:37:33,063 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 17:37:33,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:37:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 17:37:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-02-04 17:37:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 17:37:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2018-02-04 17:37:33,068 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 47 [2018-02-04 17:37:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:33,068 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2018-02-04 17:37:33,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:37:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2018-02-04 17:37:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:37:33,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:33,069 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:33,069 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-02-04 17:37:33,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:33,069 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:33,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:33,070 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:33,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:33,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:33,098 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:33,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:33,098 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:33,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:33,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:33,133 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 17:37:33,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,138 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 17:37:33,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:33,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:33,160 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 17:37:33,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:33,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:33,170 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 17:37:33,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:37:33,196 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 17:37:33,198 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 17:37:33,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 17:37:33,226 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 17:37:33,229 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 17:37:33,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,243 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 17:37:33,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-02-04 17:37:33,867 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 44 treesize of output 40 [2018-02-04 17:37:33,869 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 17:37:33,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:33,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:33,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 39 [2018-02-04 17:37:33,878 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:33,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:33,903 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 17:37:33,903 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:70, output treesize:99 [2018-02-04 17:37:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:34,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:34,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 17:37:34,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:37:34,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:37:34,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:37:34,037 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 24 states. [2018-02-04 17:37:35,747 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 80 DAG size of output 56 [2018-02-04 17:37:36,442 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-02-04 17:37:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:37,015 INFO L93 Difference]: Finished difference Result 170 states and 203 transitions. [2018-02-04 17:37:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:37:37,016 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-02-04 17:37:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:37,016 INFO L225 Difference]: With dead ends: 170 [2018-02-04 17:37:37,017 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 17:37:37,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=177, Invalid=1463, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:37:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 17:37:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2018-02-04 17:37:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 17:37:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2018-02-04 17:37:37,021 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 48 [2018-02-04 17:37:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:37,021 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2018-02-04 17:37:37,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:37:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2018-02-04 17:37:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 17:37:37,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:37,022 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:37,022 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-02-04 17:37:37,022 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:37,022 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:37,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:37,023 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:37,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:37,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 17:37:37,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:37,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:37,074 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:37,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:37,108 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 17:37:37,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:37,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:37,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:37:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:37:37,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:37,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2018-02-04 17:37:37,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:37:37,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:37:37,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:37:37,162 INFO L87 Difference]: Start difference. First operand 154 states and 191 transitions. Second operand 12 states. [2018-02-04 17:37:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:37,303 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2018-02-04 17:37:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:37:37,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-02-04 17:37:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:37,304 INFO L225 Difference]: With dead ends: 153 [2018-02-04 17:37:37,304 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 17:37:37,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:37:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 17:37:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-04 17:37:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-04 17:37:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2018-02-04 17:37:37,307 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 49 [2018-02-04 17:37:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:37,308 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2018-02-04 17:37:37,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:37:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2018-02-04 17:37:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 17:37:37,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:37,308 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:37,308 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-02-04 17:37:37,309 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:37,309 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:37,309 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:37,309 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:37,309 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:37,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:37,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:37,480 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:37,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:37,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:37,516 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 17:37:37,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:37,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:37,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-02-04 17:37:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:37:37,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:37,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 19 [2018-02-04 17:37:37,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:37:37,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:37:37,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:37:37,579 INFO L87 Difference]: Start difference. First operand 153 states and 188 transitions. Second operand 20 states. [2018-02-04 17:37:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:37,831 INFO L93 Difference]: Finished difference Result 160 states and 192 transitions. [2018-02-04 17:37:37,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:37:37,832 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-04 17:37:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:37,832 INFO L225 Difference]: With dead ends: 160 [2018-02-04 17:37:37,832 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 17:37:37,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:37:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 17:37:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2018-02-04 17:37:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 17:37:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2018-02-04 17:37:37,835 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 185 transitions. Word has length 49 [2018-02-04 17:37:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:37,836 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 185 transitions. [2018-02-04 17:37:37,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:37:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2018-02-04 17:37:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 17:37:37,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:37,836 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:37,836 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-02-04 17:37:37,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:37,837 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:37,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:37,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:37,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:37,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:37,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:37,949 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:37,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:37,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:37,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:37,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-02-04 17:37:37,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:37:37,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:37:37,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:37:37,995 INFO L87 Difference]: Start difference. First operand 152 states and 185 transitions. Second operand 11 states. [2018-02-04 17:37:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:38,106 INFO L93 Difference]: Finished difference Result 250 states and 293 transitions. [2018-02-04 17:37:38,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:37:38,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-02-04 17:37:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:38,107 INFO L225 Difference]: With dead ends: 250 [2018-02-04 17:37:38,108 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 17:37:38,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:37:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 17:37:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2018-02-04 17:37:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 17:37:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2018-02-04 17:37:38,112 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 52 [2018-02-04 17:37:38,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:38,112 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2018-02-04 17:37:38,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:37:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2018-02-04 17:37:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 17:37:38,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:38,113 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:38,113 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash 515999267, now seen corresponding path program 2 times [2018-02-04 17:37:38,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:38,114 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:38,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:38,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:38,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:38,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:38,136 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:38,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:38,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:38,137 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:37:38,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:37:38,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:38,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:38,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 6 treesize of output 5 [2018-02-04 17:37:38,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,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 6 treesize of output 5 [2018-02-04 17:37:38,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:38,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:38,191 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 17:37:38,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:38,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:38,202 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 17:37:38,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:37:38,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:37:38,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:37:38,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 17:37:38,260 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 17:37:38,264 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 17:37:38,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:37:38,646 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 37 treesize of output 33 [2018-02-04 17:37:38,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:38,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:38,656 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 15 treesize of output 13 [2018-02-04 17:37:38,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:38,665 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 17:37:38,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:38,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:38,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:37:38,693 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:62 [2018-02-04 17:37:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:38,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:38,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 17:37:38,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:37:38,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:37:38,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:37:38,918 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand 25 states. [2018-02-04 17:37:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:40,131 INFO L93 Difference]: Finished difference Result 324 states and 380 transitions. [2018-02-04 17:37:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:37:40,132 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2018-02-04 17:37:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:40,133 INFO L225 Difference]: With dead ends: 324 [2018-02-04 17:37:40,133 INFO L226 Difference]: Without dead ends: 324 [2018-02-04 17:37:40,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=1703, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:37:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-04 17:37:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 306. [2018-02-04 17:37:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-04 17:37:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2018-02-04 17:37:40,139 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 53 [2018-02-04 17:37:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:40,139 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2018-02-04 17:37:40,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:37:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2018-02-04 17:37:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 17:37:40,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:40,140 INFO L351 BasicCegarLoop]: trace histogram [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, 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 17:37:40,140 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:40,140 INFO L82 PathProgramCache]: Analyzing trace with hash 931438653, now seen corresponding path program 2 times [2018-02-04 17:37:40,140 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:40,141 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:40,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:40,141 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:40,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:40,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:40,166 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:40,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:40,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:40,167 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:37:40,197 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:37:40,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:40,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:40,212 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 17:37:40,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:37:40,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:40,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:40,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:40,242 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 17:37:40,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,252 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 17:37:40,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:37:40,282 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 17:37:40,284 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 17:37:40,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:37:40,310 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 17:37:40,311 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 17:37:40,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:40,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-02-04 17:37:41,092 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 69 treesize of output 57 [2018-02-04 17:37:41,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:41,100 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 1 case distinctions, treesize of input 33 treesize of output 37 [2018-02-04 17:37:41,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:41,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-02-04 17:37:41,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:41,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-02-04 17:37:41,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:41,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:41,188 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 2 xjuncts. [2018-02-04 17:37:41,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:143 [2018-02-04 17:37:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:37:41,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:41,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 17:37:41,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:37:41,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:37:41,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:37:41,414 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand 29 states. [2018-02-04 17:37:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:43,606 INFO L93 Difference]: Finished difference Result 322 states and 378 transitions. [2018-02-04 17:37:43,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:37:43,606 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-02-04 17:37:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:43,607 INFO L225 Difference]: With dead ends: 322 [2018-02-04 17:37:43,608 INFO L226 Difference]: Without dead ends: 322 [2018-02-04 17:37:43,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=232, Invalid=2420, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:37:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-04 17:37:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 306. [2018-02-04 17:37:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-04 17:37:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 363 transitions. [2018-02-04 17:37:43,612 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 363 transitions. Word has length 56 [2018-02-04 17:37:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:43,612 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 363 transitions. [2018-02-04 17:37:43,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:37:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 363 transitions. [2018-02-04 17:37:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 17:37:43,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:43,613 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:43,613 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1857153715, now seen corresponding path program 3 times [2018-02-04 17:37:43,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:43,613 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:43,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:43,614 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:43,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:43,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:43,630 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:43,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:43,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:43,630 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:37:43,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:37:43,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:43,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:43,654 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 17:37:43,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,658 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 17:37:43,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:43,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:43,672 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 17:37:43,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:43,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:43,680 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 17:37:43,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:37:43,699 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 15 treesize of output 12 [2018-02-04 17:37:43,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:37:43,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:37:43,716 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 28 treesize of output 29 [2018-02-04 17:37:43,717 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 17:37:43,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,724 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 17:37:43,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-02-04 17:37:43,979 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 33 treesize of output 31 [2018-02-04 17:37:43,980 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 17:37:43,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:43,999 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 17 treesize of output 14 [2018-02-04 17:37:44,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:44,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:44,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:44,009 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-04 17:37:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 17:37:44,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:44,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:37:44,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:37:44,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:37:44,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:37:44,097 INFO L87 Difference]: Start difference. First operand 306 states and 363 transitions. Second operand 17 states. [2018-02-04 17:37:44,462 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 49 DAG size of output 45 [2018-02-04 17:37:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:44,751 INFO L93 Difference]: Finished difference Result 338 states and 393 transitions. [2018-02-04 17:37:44,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:37:44,751 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-04 17:37:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:44,752 INFO L225 Difference]: With dead ends: 338 [2018-02-04 17:37:44,752 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 17:37:44,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:37:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 17:37:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 116. [2018-02-04 17:37:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 17:37:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2018-02-04 17:37:44,755 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 58 [2018-02-04 17:37:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:44,755 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2018-02-04 17:37:44,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:37:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2018-02-04 17:37:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 17:37:44,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:44,755 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:44,755 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:44,755 INFO L82 PathProgramCache]: Analyzing trace with hash 189332755, now seen corresponding path program 1 times [2018-02-04 17:37:44,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:44,756 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:44,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:44,756 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:44,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:44,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:44,775 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:44,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:44,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:44,776 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:44,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:44,819 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 17:37:44,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,824 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 17:37:44,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:44,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:44,842 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 17:37:44,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:44,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:44,853 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 17:37:44,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:37:44,888 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 17:37:44,889 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 17:37:44,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 17:37:44,911 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 17:37:44,912 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 17:37:44,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:44,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:37:45,252 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 30 treesize of output 28 [2018-02-04 17:37:45,253 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 9 treesize of output 1 [2018-02-04 17:37:45,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:45,260 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 17:37:45,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:45,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:45,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:45,268 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2018-02-04 17:37:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:37:45,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:45,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 17:37:45,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:37:45,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:37:45,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:37:45,312 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand 22 states. [2018-02-04 17:37:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:45,988 INFO L93 Difference]: Finished difference Result 176 states and 205 transitions. [2018-02-04 17:37:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:37:45,988 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-02-04 17:37:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:45,988 INFO L225 Difference]: With dead ends: 176 [2018-02-04 17:37:45,989 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 17:37:45,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:37:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 17:37:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 156. [2018-02-04 17:37:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 17:37:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2018-02-04 17:37:45,991 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 61 [2018-02-04 17:37:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:45,991 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2018-02-04 17:37:45,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:37:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2018-02-04 17:37:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 17:37:45,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:45,992 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:37:45,992 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1302686214, now seen corresponding path program 3 times [2018-02-04 17:37:45,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:45,992 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:45,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:45,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:45,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:45,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:46,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:46,151 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:46,151 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:37:46,175 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 17:37:46,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:46,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:46,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:46,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-02-04 17:37:46,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:37:46,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:37:46,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:37:46,208 INFO L87 Difference]: Start difference. First operand 156 states and 186 transitions. Second operand 13 states. [2018-02-04 17:37:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:46,327 INFO L93 Difference]: Finished difference Result 302 states and 351 transitions. [2018-02-04 17:37:46,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:37:46,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-02-04 17:37:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:46,329 INFO L225 Difference]: With dead ends: 302 [2018-02-04 17:37:46,329 INFO L226 Difference]: Without dead ends: 302 [2018-02-04 17:37:46,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:37:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-02-04 17:37:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-02-04 17:37:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 17:37:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 320 transitions. [2018-02-04 17:37:46,333 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 320 transitions. Word has length 65 [2018-02-04 17:37:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:46,334 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 320 transitions. [2018-02-04 17:37:46,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:37:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 320 transitions. [2018-02-04 17:37:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 17:37:46,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:46,335 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:46,335 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1561015805, now seen corresponding path program 2 times [2018-02-04 17:37:46,335 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:46,335 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:46,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:46,336 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:46,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:46,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:46,366 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:46,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:46,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:46,367 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:37:46,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:37:46,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:46,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:46,411 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 17:37:46,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,416 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 17:37:46,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:46,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:46,433 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 17:37:46,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:46,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:46,445 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 17:37:46,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:37:46,475 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 17:37:46,476 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 17:37:46,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2018-02-04 17:37:46,504 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 17:37:46,506 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 17:37:46,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:37:46,861 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 41 treesize of output 53 [2018-02-04 17:37:46,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 42 [2018-02-04 17:37:46,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:46,902 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 32 [2018-02-04 17:37:46,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:46,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 17:37:46,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:46,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2018-02-04 17:37:46,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:47,013 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 23 [2018-02-04 17:37:47,014 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:47,031 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 17 [2018-02-04 17:37:47,031 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:47,045 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 17 [2018-02-04 17:37:47,045 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:47,058 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 17:37:47,058 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:47,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:47,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:47,067 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:53, output treesize:30 [2018-02-04 17:37:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:47,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:47,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 17:37:47,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:37:47,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:37:47,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:37:47,117 INFO L87 Difference]: Start difference. First operand 270 states and 320 transitions. Second operand 23 states. [2018-02-04 17:37:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:48,035 INFO L93 Difference]: Finished difference Result 379 states and 444 transitions. [2018-02-04 17:37:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:37:48,036 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-02-04 17:37:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:48,037 INFO L225 Difference]: With dead ends: 379 [2018-02-04 17:37:48,037 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 17:37:48,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:37:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 17:37:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 346. [2018-02-04 17:37:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-04 17:37:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 412 transitions. [2018-02-04 17:37:48,043 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 412 transitions. Word has length 66 [2018-02-04 17:37:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:48,043 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 412 transitions. [2018-02-04 17:37:48,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:37:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 412 transitions. [2018-02-04 17:37:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 17:37:48,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:48,044 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:48,044 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:48,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1189951031, now seen corresponding path program 4 times [2018-02-04 17:37:48,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:48,045 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:48,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,045 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:48,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:48,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:48,068 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:48,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:48,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:48,069 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:37:48,103 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:37:48,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:48,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:48,112 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 17:37:48,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,118 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 17:37:48,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:48,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:48,139 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 17:37:48,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:48,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:48,151 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 17:37:48,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:37:48,202 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 15 treesize of output 12 [2018-02-04 17:37:48,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 12 treesize of output 11 [2018-02-04 17:37:48,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:37:48,238 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 28 treesize of output 29 [2018-02-04 17:37:48,240 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 17:37:48,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,255 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 17:37:48,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 17:37:48,907 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 33 treesize of output 31 [2018-02-04 17:37:48,908 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 17:37:48,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:48,914 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 17 treesize of output 14 [2018-02-04 17:37:48,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:48,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:48,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:48,923 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-04 17:37:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 17:37:48,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:48,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:37:48,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:37:48,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:37:48,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:37:48,970 INFO L87 Difference]: Start difference. First operand 346 states and 412 transitions. Second operand 18 states. [2018-02-04 17:37:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:51,779 INFO L93 Difference]: Finished difference Result 647 states and 756 transitions. [2018-02-04 17:37:51,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:37:51,779 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-02-04 17:37:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:51,781 INFO L225 Difference]: With dead ends: 647 [2018-02-04 17:37:51,781 INFO L226 Difference]: Without dead ends: 647 [2018-02-04 17:37:51,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:37:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-02-04 17:37:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 540. [2018-02-04 17:37:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-02-04 17:37:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 635 transitions. [2018-02-04 17:37:51,789 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 635 transitions. Word has length 69 [2018-02-04 17:37:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:51,789 INFO L432 AbstractCegarLoop]: Abstraction has 540 states and 635 transitions. [2018-02-04 17:37:51,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:37:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 635 transitions. [2018-02-04 17:37:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 17:37:51,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:51,790 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:51,790 INFO L371 AbstractCegarLoop]: === Iteration 37 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1081639798, now seen corresponding path program 1 times [2018-02-04 17:37:51,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:51,791 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:51,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:51,791 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:51,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:51,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:52,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:52,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:52,103 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:52,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:52,126 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 17:37:52,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:52,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:52,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-02-04 17:37:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:52,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:52,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 20 [2018-02-04 17:37:52,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:37:52,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:37:52,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:37:52,168 INFO L87 Difference]: Start difference. First operand 540 states and 635 transitions. Second operand 21 states. [2018-02-04 17:37:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:52,578 INFO L93 Difference]: Finished difference Result 708 states and 827 transitions. [2018-02-04 17:37:52,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:37:52,579 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2018-02-04 17:37:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:52,580 INFO L225 Difference]: With dead ends: 708 [2018-02-04 17:37:52,580 INFO L226 Difference]: Without dead ends: 708 [2018-02-04 17:37:52,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:37:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-02-04 17:37:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 594. [2018-02-04 17:37:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-02-04 17:37:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 710 transitions. [2018-02-04 17:37:52,598 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 710 transitions. Word has length 71 [2018-02-04 17:37:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:52,598 INFO L432 AbstractCegarLoop]: Abstraction has 594 states and 710 transitions. [2018-02-04 17:37:52,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:37:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 710 transitions. [2018-02-04 17:37:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 17:37:52,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:52,600 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:37:52,600 INFO L371 AbstractCegarLoop]: === Iteration 38 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1136154501, now seen corresponding path program 2 times [2018-02-04 17:37:52,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:52,600 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:52,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:52,601 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:52,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:52,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:52,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:52,846 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:52,847 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:37:52,887 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:37:52,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:52,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:53,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:53,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2018-02-04 17:37:53,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:37:53,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:37:53,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:37:53,149 INFO L87 Difference]: Start difference. First operand 594 states and 710 transitions. Second operand 29 states. [2018-02-04 17:37:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:54,479 INFO L93 Difference]: Finished difference Result 1288 states and 1484 transitions. [2018-02-04 17:37:54,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:37:54,479 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 80 [2018-02-04 17:37:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:54,482 INFO L225 Difference]: With dead ends: 1288 [2018-02-04 17:37:54,482 INFO L226 Difference]: Without dead ends: 1288 [2018-02-04 17:37:54,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=383, Invalid=3777, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:37:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2018-02-04 17:37:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 945. [2018-02-04 17:37:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-02-04 17:37:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1141 transitions. [2018-02-04 17:37:54,494 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1141 transitions. Word has length 80 [2018-02-04 17:37:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:54,494 INFO L432 AbstractCegarLoop]: Abstraction has 945 states and 1141 transitions. [2018-02-04 17:37:54,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:37:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1141 transitions. [2018-02-04 17:37:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 17:37:54,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:54,496 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:54,496 INFO L371 AbstractCegarLoop]: === Iteration 39 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1534089899, now seen corresponding path program 1 times [2018-02-04 17:37:54,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:54,496 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:54,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,497 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:54,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 17:37:54,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:54,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:37:54,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:37:54,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:37:54,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:37:54,519 INFO L87 Difference]: Start difference. First operand 945 states and 1141 transitions. Second operand 4 states. [2018-02-04 17:37:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:54,524 INFO L93 Difference]: Finished difference Result 1029 states and 1210 transitions. [2018-02-04 17:37:54,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:37:54,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-02-04 17:37:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:54,527 INFO L225 Difference]: With dead ends: 1029 [2018-02-04 17:37:54,527 INFO L226 Difference]: Without dead ends: 870 [2018-02-04 17:37:54,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:37:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-02-04 17:37:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2018-02-04 17:37:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-02-04 17:37:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 952 transitions. [2018-02-04 17:37:54,536 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 952 transitions. Word has length 86 [2018-02-04 17:37:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:54,537 INFO L432 AbstractCegarLoop]: Abstraction has 870 states and 952 transitions. [2018-02-04 17:37:54,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:37:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 952 transitions. [2018-02-04 17:37:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 17:37:54,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:54,538 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:54,538 INFO L371 AbstractCegarLoop]: === Iteration 40 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1399373007, now seen corresponding path program 1 times [2018-02-04 17:37:54,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:54,538 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:54,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,539 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:54,571 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:54,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:54,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:54,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:54,640 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 17:37:54,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,649 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 17:37:54,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:54,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:54,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:54,668 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 17:37:54,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,677 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 17:37:54,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:37:54,714 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 15 treesize of output 12 [2018-02-04 17:37:54,716 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 17:37:54,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-02-04 17:37:54,746 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 28 treesize of output 29 [2018-02-04 17:37:54,748 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 17:37:54,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 17:37:55,509 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 46 treesize of output 40 [2018-02-04 17:37:55,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:37:55,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:55,523 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 22 treesize of output 14 [2018-02-04 17:37:55,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:55,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:55,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 17:37:55,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:78 [2018-02-04 17:37:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 17:37:55,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:55,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 17:37:55,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:37:55,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:37:55,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:37:55,727 INFO L87 Difference]: Start difference. First operand 870 states and 952 transitions. Second operand 26 states. [2018-02-04 17:37:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:57,358 INFO L93 Difference]: Finished difference Result 996 states and 1075 transitions. [2018-02-04 17:37:57,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:37:57,358 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 88 [2018-02-04 17:37:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:57,360 INFO L225 Difference]: With dead ends: 996 [2018-02-04 17:37:57,360 INFO L226 Difference]: Without dead ends: 772 [2018-02-04 17:37:57,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=228, Invalid=1934, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:37:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-02-04 17:37:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 256. [2018-02-04 17:37:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 17:37:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 278 transitions. [2018-02-04 17:37:57,365 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 278 transitions. Word has length 88 [2018-02-04 17:37:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:57,365 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 278 transitions. [2018-02-04 17:37:57,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:37:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 278 transitions. [2018-02-04 17:37:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 17:37:57,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:57,377 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:37:57,377 INFO L371 AbstractCegarLoop]: === Iteration 41 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -237190699, now seen corresponding path program 1 times [2018-02-04 17:37:57,378 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:57,378 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:57,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:57,378 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:57,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:57,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:57,395 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:57,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:57,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:57,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:57,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:57,445 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 17:37:57,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,449 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 17:37:57,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:37:57,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:57,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:57,463 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 17:37:57,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,496 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 17:37:57,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:37:57,527 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 17:37:57,529 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 17:37:57,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 17:37:57,557 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 17:37:57,559 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 17:37:57,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:37:57,974 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 41 treesize of output 35 [2018-02-04 17:37:57,979 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 22 treesize of output 20 [2018-02-04 17:37:57,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:57,991 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 23 treesize of output 21 [2018-02-04 17:37:57,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:57,993 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 0 case distinctions, treesize of input 20 treesize of output 3 [2018-02-04 17:37:57,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:57,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:58,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:58,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:30 [2018-02-04 17:37:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:37:58,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:37:58,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 17:37:58,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:37:58,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:37:58,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:37:58,065 INFO L87 Difference]: Start difference. First operand 256 states and 278 transitions. Second operand 26 states. [2018-02-04 17:37:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:59,107 INFO L93 Difference]: Finished difference Result 542 states and 588 transitions. [2018-02-04 17:37:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:37:59,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 91 [2018-02-04 17:37:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:59,109 INFO L225 Difference]: With dead ends: 542 [2018-02-04 17:37:59,109 INFO L226 Difference]: Without dead ends: 542 [2018-02-04 17:37:59,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=1618, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:37:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-02-04 17:37:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 476. [2018-02-04 17:37:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-02-04 17:37:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 524 transitions. [2018-02-04 17:37:59,114 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 524 transitions. Word has length 91 [2018-02-04 17:37:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:59,115 INFO L432 AbstractCegarLoop]: Abstraction has 476 states and 524 transitions. [2018-02-04 17:37:59,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:37:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 524 transitions. [2018-02-04 17:37:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 17:37:59,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:59,117 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:37:59,117 INFO L371 AbstractCegarLoop]: === Iteration 42 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:37:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash 947282541, now seen corresponding path program 3 times [2018-02-04 17:37:59,117 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:59,117 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:59,118 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:59,118 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:59,118 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:59,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:59,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:59,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:59,319 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:37:59,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 17:37:59,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:59,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:59,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:59,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-02-04 17:37:59,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 17:37:59,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 17:37:59,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=984, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:37:59,621 INFO L87 Difference]: Start difference. First operand 476 states and 524 transitions. Second operand 33 states. [2018-02-04 17:38:01,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:01,068 INFO L93 Difference]: Finished difference Result 906 states and 986 transitions. [2018-02-04 17:38:01,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:38:01,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2018-02-04 17:38:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:01,070 INFO L225 Difference]: With dead ends: 906 [2018-02-04 17:38:01,070 INFO L226 Difference]: Without dead ends: 890 [2018-02-04 17:38:01,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=4967, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:38:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-02-04 17:38:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 735. [2018-02-04 17:38:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-02-04 17:38:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 812 transitions. [2018-02-04 17:38:01,079 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 812 transitions. Word has length 93 [2018-02-04 17:38:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:01,079 INFO L432 AbstractCegarLoop]: Abstraction has 735 states and 812 transitions. [2018-02-04 17:38:01,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 17:38:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 812 transitions. [2018-02-04 17:38:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 17:38:01,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:01,081 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:01,081 INFO L371 AbstractCegarLoop]: === Iteration 43 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1299140481, now seen corresponding path program 2 times [2018-02-04 17:38:01,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:01,082 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:01,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:01,082 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:01,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:01,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:01,108 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:01,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:01,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:01,109 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:38:01,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:38:01,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:01,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:01,181 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 17:38:01,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,198 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 17:38:01,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:01,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:01,216 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 17:38:01,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:01,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:01,229 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 17:38:01,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:38:01,256 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 17:38:01,258 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 17:38:01,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2018-02-04 17:38:01,282 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 17:38:01,284 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 17:38:01,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:38:02,234 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 45 treesize of output 39 [2018-02-04 17:38:02,238 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 17:38:02,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:02,247 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 21 treesize of output 13 [2018-02-04 17:38:02,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:02,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:02,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:38:02,262 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:66 [2018-02-04 17:38:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:02,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:02,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 17:38:02,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 17:38:02,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 17:38:02,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:38:02,384 INFO L87 Difference]: Start difference. First operand 735 states and 812 transitions. Second operand 31 states. [2018-02-04 17:38:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:04,139 INFO L93 Difference]: Finished difference Result 1143 states and 1250 transitions. [2018-02-04 17:38:04,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:38:04,139 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 96 [2018-02-04 17:38:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:04,142 INFO L225 Difference]: With dead ends: 1143 [2018-02-04 17:38:04,142 INFO L226 Difference]: Without dead ends: 1143 [2018-02-04 17:38:04,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=240, Invalid=2412, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:38:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-02-04 17:38:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1063. [2018-02-04 17:38:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2018-02-04 17:38:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1172 transitions. [2018-02-04 17:38:04,156 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1172 transitions. Word has length 96 [2018-02-04 17:38:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:04,156 INFO L432 AbstractCegarLoop]: Abstraction has 1063 states and 1172 transitions. [2018-02-04 17:38:04,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 17:38:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1172 transitions. [2018-02-04 17:38:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 17:38:04,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:04,159 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:04,159 INFO L371 AbstractCegarLoop]: === Iteration 44 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash 502164821, now seen corresponding path program 3 times [2018-02-04 17:38:04,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:04,159 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:04,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:04,160 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:04,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:04,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:04,188 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:04,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:04,188 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:04,188 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:38:04,256 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 17:38:04,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:04,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:04,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:04,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,273 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 17:38:04,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:04,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:04,292 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 17:38:04,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:04,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:04,304 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 17:38:04,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:38:04,334 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 17:38:04,336 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 17:38:04,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 17:38:04,372 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 17:38:04,373 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 17:38:04,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:04,384 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 17:38:04,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-04 17:38:05,000 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 31 treesize of output 29 [2018-02-04 17:38:05,005 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 17:38:05,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:05,010 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 17:38:05,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:05,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:05,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:05,019 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-02-04 17:38:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 47 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 17:38:05,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:05,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 17:38:05,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:38:05,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:38:05,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:38:05,093 INFO L87 Difference]: Start difference. First operand 1063 states and 1172 transitions. Second operand 22 states. [2018-02-04 17:38:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:06,646 INFO L93 Difference]: Finished difference Result 1495 states and 1634 transitions. [2018-02-04 17:38:06,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:38:06,646 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 101 [2018-02-04 17:38:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:06,649 INFO L225 Difference]: With dead ends: 1495 [2018-02-04 17:38:06,649 INFO L226 Difference]: Without dead ends: 1495 [2018-02-04 17:38:06,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:38:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2018-02-04 17:38:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1391. [2018-02-04 17:38:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2018-02-04 17:38:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1532 transitions. [2018-02-04 17:38:06,658 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1532 transitions. Word has length 101 [2018-02-04 17:38:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:06,658 INFO L432 AbstractCegarLoop]: Abstraction has 1391 states and 1532 transitions. [2018-02-04 17:38:06,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:38:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1532 transitions. [2018-02-04 17:38:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 17:38:06,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:06,660 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:06,660 INFO L371 AbstractCegarLoop]: === Iteration 45 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash -251411253, now seen corresponding path program 2 times [2018-02-04 17:38:06,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:06,660 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:06,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:06,661 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:06,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:06,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:06,689 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:06,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:06,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:06,690 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:38:06,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:38:06,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:06,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:06,742 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 17:38:06,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,746 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 17:38:06,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:06,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:06,761 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 17:38:06,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:06,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:06,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 17:38:06,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-02-04 17:38:06,812 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 17:38:06,813 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 17:38:06,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2018-02-04 17:38:06,833 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 17:38:06,835 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 17:38:06,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:06,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-02-04 17:38:07,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-02-04 17:38:07,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:07,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:07,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2018-02-04 17:38:07,234 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 30 treesize of output 28 [2018-02-04 17:38:07,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, 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 17:38:07,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:07,254 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 9 treesize of output 1 [2018-02-04 17:38:07,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:07,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:07,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:07,262 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2018-02-04 17:38:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:38:07,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:07,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 17:38:07,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:38:07,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:38:07,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:38:07,342 INFO L87 Difference]: Start difference. First operand 1391 states and 1532 transitions. Second operand 26 states. [2018-02-04 17:38:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:08,509 INFO L93 Difference]: Finished difference Result 1483 states and 1620 transitions. [2018-02-04 17:38:08,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:38:08,509 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2018-02-04 17:38:08,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:08,511 INFO L225 Difference]: With dead ends: 1483 [2018-02-04 17:38:08,511 INFO L226 Difference]: Without dead ends: 1483 [2018-02-04 17:38:08,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=1550, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:38:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-02-04 17:38:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1391. [2018-02-04 17:38:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2018-02-04 17:38:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1530 transitions. [2018-02-04 17:38:08,523 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1530 transitions. Word has length 104 [2018-02-04 17:38:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:08,523 INFO L432 AbstractCegarLoop]: Abstraction has 1391 states and 1530 transitions. [2018-02-04 17:38:08,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:38:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1530 transitions. [2018-02-04 17:38:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 17:38:08,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:08,525 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:08,525 INFO L371 AbstractCegarLoop]: === Iteration 46 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1424174079, now seen corresponding path program 4 times [2018-02-04 17:38:08,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:08,525 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:08,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:08,525 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:08,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:08,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:08,550 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:08,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:08,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:08,550 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:38:08,582 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:38:08,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:08,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:08,600 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 17:38:08,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,614 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 17:38:08,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:08,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:08,628 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 17:38:08,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:08,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:08,636 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 17:38:08,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:38:08,686 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 15 treesize of output 12 [2018-02-04 17:38:08,687 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 17:38:08,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:38:08,707 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 28 treesize of output 29 [2018-02-04 17:38:08,709 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 17:38:08,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:08,718 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 17:38:08,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 17:38:09,112 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 33 treesize of output 31 [2018-02-04 17:38:09,117 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 17 treesize of output 14 [2018-02-04 17:38:09,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:09,124 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 17:38:09,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:09,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:09,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:09,132 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-04 17:38:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-02-04 17:38:09,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:09,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:38:09,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:38:09,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:38:09,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:38:09,214 INFO L87 Difference]: Start difference. First operand 1391 states and 1530 transitions. Second operand 17 states. [2018-02-04 17:38:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:11,877 INFO L93 Difference]: Finished difference Result 1462 states and 1585 transitions. [2018-02-04 17:38:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:38:11,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2018-02-04 17:38:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:11,878 INFO L225 Difference]: With dead ends: 1462 [2018-02-04 17:38:11,878 INFO L226 Difference]: Without dead ends: 632 [2018-02-04 17:38:11,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:38:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-02-04 17:38:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 115. [2018-02-04 17:38:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 17:38:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-02-04 17:38:11,881 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 106 [2018-02-04 17:38:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:11,881 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-02-04 17:38:11,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:38:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-02-04 17:38:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 17:38:11,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:11,881 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:11,882 INFO L371 AbstractCegarLoop]: === Iteration 47 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1389821931, now seen corresponding path program 4 times [2018-02-04 17:38:11,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:11,882 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:11,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:11,882 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:11,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:11,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 32 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:12,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:12,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:12,293 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:38:12,316 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:38:12,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:12,322 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:12,324 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 17:38:12,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:12,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:12,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-02-04 17:38:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 50 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:12,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:12,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2018-02-04 17:38:12,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:38:12,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:38:12,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:38:12,404 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 23 states. [2018-02-04 17:38:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:13,029 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2018-02-04 17:38:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:38:13,030 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2018-02-04 17:38:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:13,030 INFO L225 Difference]: With dead ends: 158 [2018-02-04 17:38:13,031 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 17:38:13,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=1452, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:38:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 17:38:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 124. [2018-02-04 17:38:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 17:38:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-04 17:38:13,033 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 106 [2018-02-04 17:38:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:13,033 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-04 17:38:13,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:38:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-04 17:38:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-04 17:38:13,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:13,034 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:13,034 INFO L371 AbstractCegarLoop]: === Iteration 48 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash -863375024, now seen corresponding path program 5 times [2018-02-04 17:38:13,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:13,034 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:13,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:13,035 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:13,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:13,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 65 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:38:13,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:13,312 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:13,313 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:38:13,417 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 17:38:13,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:13,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 65 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:38:13,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:13,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-04 17:38:13,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:38:13,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:38:13,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:38:13,513 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 19 states. [2018-02-04 17:38:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:13,780 INFO L93 Difference]: Finished difference Result 219 states and 233 transitions. [2018-02-04 17:38:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:38:13,780 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2018-02-04 17:38:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:13,781 INFO L225 Difference]: With dead ends: 219 [2018-02-04 17:38:13,781 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 17:38:13,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:38:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 17:38:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-02-04 17:38:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 17:38:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-02-04 17:38:13,783 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 115 [2018-02-04 17:38:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:13,783 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-02-04 17:38:13,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:38:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-02-04 17:38:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 17:38:13,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:13,784 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:13,784 INFO L371 AbstractCegarLoop]: === Iteration 49 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash 901331539, now seen corresponding path program 6 times [2018-02-04 17:38:13,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:13,785 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:13,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:13,785 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:13,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:13,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 50 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:14,330 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:14,330 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:38:14,414 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 17:38:14,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:14,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 24 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:14,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 44 [2018-02-04 17:38:14,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:38:14,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:38:14,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1789, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:38:14,935 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 44 states. [2018-02-04 17:38:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:16,654 INFO L93 Difference]: Finished difference Result 284 states and 301 transitions. [2018-02-04 17:38:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:38:16,655 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 119 [2018-02-04 17:38:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:16,655 INFO L225 Difference]: With dead ends: 284 [2018-02-04 17:38:16,655 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 17:38:16,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=358, Invalid=6284, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 17:38:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 17:38:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 141. [2018-02-04 17:38:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 17:38:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-02-04 17:38:16,657 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 119 [2018-02-04 17:38:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:16,657 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-02-04 17:38:16,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:38:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-02-04 17:38:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 17:38:16,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:16,658 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:16,658 INFO L371 AbstractCegarLoop]: === Iteration 50 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash -760409937, now seen corresponding path program 7 times [2018-02-04 17:38:16,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:16,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:16,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:16,659 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:16,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:16,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 72 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:17,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:17,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:17,088 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:17,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 28 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:17,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:17,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2018-02-04 17:38:17,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:38:17,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:38:17,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:38:17,700 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 45 states. [2018-02-04 17:38:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:20,281 INFO L93 Difference]: Finished difference Result 318 states and 337 transitions. [2018-02-04 17:38:20,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 17:38:20,281 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 132 [2018-02-04 17:38:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:20,282 INFO L225 Difference]: With dead ends: 318 [2018-02-04 17:38:20,282 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 17:38:20,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2884 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1087, Invalid=11345, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 17:38:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 17:38:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2018-02-04 17:38:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 17:38:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-02-04 17:38:20,284 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 132 [2018-02-04 17:38:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:20,284 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-02-04 17:38:20,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:38:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-02-04 17:38:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 17:38:20,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:20,284 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:20,285 INFO L371 AbstractCegarLoop]: === Iteration 51 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash 753871161, now seen corresponding path program 8 times [2018-02-04 17:38:20,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:20,285 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:20,285 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:20,285 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:20,285 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:20,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 98 proven. 322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:20,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:20,825 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:20,826 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:38:20,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:38:20,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:20,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 32 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:21,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:21,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 49 [2018-02-04 17:38:21,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:38:21,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:38:21,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2208, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:38:21,391 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 49 states. [2018-02-04 17:38:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:24,194 INFO L93 Difference]: Finished difference Result 352 states and 373 transitions. [2018-02-04 17:38:24,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 17:38:24,194 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 145 [2018-02-04 17:38:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:24,195 INFO L225 Difference]: With dead ends: 352 [2018-02-04 17:38:24,195 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 17:38:24,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3456 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1187, Invalid=13575, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 17:38:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 17:38:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 167. [2018-02-04 17:38:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 17:38:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2018-02-04 17:38:24,197 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 145 [2018-02-04 17:38:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:24,197 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2018-02-04 17:38:24,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:38:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2018-02-04 17:38:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 17:38:24,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:24,198 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:24,198 INFO L371 AbstractCegarLoop]: === Iteration 52 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash 133184073, now seen corresponding path program 9 times [2018-02-04 17:38:24,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:24,198 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:24,198 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:24,198 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:24,198 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:24,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 128 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:24,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:24,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:24,765 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:38:24,911 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:38:24,911 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:24,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 36 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:25,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:25,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 53 [2018-02-04 17:38:25,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:38:25,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:38:25,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2581, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:38:25,443 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand 53 states. [2018-02-04 17:38:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:29,096 INFO L93 Difference]: Finished difference Result 386 states and 409 transitions. [2018-02-04 17:38:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-02-04 17:38:29,097 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 158 [2018-02-04 17:38:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:29,097 INFO L225 Difference]: With dead ends: 386 [2018-02-04 17:38:29,097 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 17:38:29,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4503 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1591, Invalid=16769, Unknown=0, NotChecked=0, Total=18360 [2018-02-04 17:38:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 17:38:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 180. [2018-02-04 17:38:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 17:38:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2018-02-04 17:38:29,100 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 158 [2018-02-04 17:38:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:29,100 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-02-04 17:38:29,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:38:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2018-02-04 17:38:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-04 17:38:29,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:29,101 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:29,101 INFO L371 AbstractCegarLoop]: === Iteration 53 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:29,101 INFO L82 PathProgramCache]: Analyzing trace with hash -936653025, now seen corresponding path program 10 times [2018-02-04 17:38:29,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:29,101 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:29,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:29,101 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:29,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:29,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 162 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:29,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:29,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:29,834 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:38:29,968 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:38:29,968 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:29,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:29,982 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 17:38:29,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:29,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:29,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-02-04 17:38:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 200 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:30,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:30,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 51 [2018-02-04 17:38:30,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 17:38:30,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 17:38:30,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2416, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:38:30,580 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 52 states. [2018-02-04 17:38:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:32,060 INFO L93 Difference]: Finished difference Result 253 states and 267 transitions. [2018-02-04 17:38:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 17:38:32,060 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 171 [2018-02-04 17:38:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:32,061 INFO L225 Difference]: With dead ends: 253 [2018-02-04 17:38:32,061 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 17:38:32,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=836, Invalid=6820, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 17:38:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 17:38:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 189. [2018-02-04 17:38:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-04 17:38:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2018-02-04 17:38:32,063 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 171 [2018-02-04 17:38:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:32,063 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2018-02-04 17:38:32,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 17:38:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2018-02-04 17:38:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-04 17:38:32,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:32,064 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:32,064 INFO L371 AbstractCegarLoop]: === Iteration 54 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash -518099578, now seen corresponding path program 11 times [2018-02-04 17:38:32,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:32,064 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:32,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:32,064 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:32,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:32,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 130 proven. 615 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:38:32,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:32,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:32,643 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:38:32,784 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:38:32,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:32,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 130 proven. 615 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:38:32,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:32,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 30 [2018-02-04 17:38:32,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 17:38:32,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 17:38:32,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:38:32,937 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 30 states. [2018-02-04 17:38:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:33,508 INFO L93 Difference]: Finished difference Result 359 states and 383 transitions. [2018-02-04 17:38:33,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:38:33,508 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 180 [2018-02-04 17:38:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:33,509 INFO L225 Difference]: With dead ends: 359 [2018-02-04 17:38:33,509 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 17:38:33,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 175 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=1692, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:38:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 17:38:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-02-04 17:38:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 17:38:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 206 transitions. [2018-02-04 17:38:33,510 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 206 transitions. Word has length 180 [2018-02-04 17:38:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:33,510 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 206 transitions. [2018-02-04 17:38:33,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 17:38:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 206 transitions. [2018-02-04 17:38:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 17:38:33,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:33,511 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:33,511 INFO L371 AbstractCegarLoop]: === Iteration 55 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1647238371, now seen corresponding path program 12 times [2018-02-04 17:38:33,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:33,511 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:33,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:33,512 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:33,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:33,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 200 proven. 592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:34,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:34,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:34,018 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:38:34,235 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-02-04 17:38:34,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:34,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 44 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:34,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:34,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 61 [2018-02-04 17:38:34,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:38:34,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:38:34,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3431, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:38:34,935 INFO L87 Difference]: Start difference. First operand 193 states and 206 transitions. Second operand 61 states. [2018-02-04 17:38:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:39,580 INFO L93 Difference]: Finished difference Result 454 states and 481 transitions. [2018-02-04 17:38:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-02-04 17:38:39,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2018-02-04 17:38:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:39,581 INFO L225 Difference]: With dead ends: 454 [2018-02-04 17:38:39,581 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 17:38:39,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6478 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2191, Invalid=23249, Unknown=0, NotChecked=0, Total=25440 [2018-02-04 17:38:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 17:38:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 206. [2018-02-04 17:38:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 17:38:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 220 transitions. [2018-02-04 17:38:39,583 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 220 transitions. Word has length 184 [2018-02-04 17:38:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:39,583 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 220 transitions. [2018-02-04 17:38:39,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:38:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 220 transitions. [2018-02-04 17:38:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 17:38:39,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:39,584 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:39,584 INFO L371 AbstractCegarLoop]: === Iteration 56 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1906127867, now seen corresponding path program 13 times [2018-02-04 17:38:39,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:39,585 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:39,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:39,585 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:39,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:39,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 242 proven. 700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:40,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:40,223 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:40,224 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:40,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 48 proven. 894 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:41,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:41,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 65 [2018-02-04 17:38:41,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 17:38:41,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 17:38:41,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3912, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:38:41,097 INFO L87 Difference]: Start difference. First operand 206 states and 220 transitions. Second operand 65 states. [2018-02-04 17:38:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:47,122 INFO L93 Difference]: Finished difference Result 488 states and 517 transitions. [2018-02-04 17:38:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-02-04 17:38:47,122 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 197 [2018-02-04 17:38:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:47,123 INFO L225 Difference]: With dead ends: 488 [2018-02-04 17:38:47,123 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 17:38:47,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7322 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2323, Invalid=26407, Unknown=0, NotChecked=0, Total=28730 [2018-02-04 17:38:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 17:38:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 219. [2018-02-04 17:38:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 17:38:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-04 17:38:47,125 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 197 [2018-02-04 17:38:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:47,126 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-04 17:38:47,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 17:38:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-04 17:38:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-02-04 17:38:47,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:47,126 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:47,126 INFO L371 AbstractCegarLoop]: === Iteration 57 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1027254147, now seen corresponding path program 14 times [2018-02-04 17:38:47,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:47,127 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:47,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:47,127 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:47,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:47,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 288 proven. 817 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:47,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:47,883 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:47,883 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:38:47,903 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:38:47,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:47,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 52 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:48,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:48,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 69 [2018-02-04 17:38:48,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 17:38:48,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 17:38:48,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4401, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 17:38:48,712 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 69 states. [2018-02-04 17:38:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:54,461 INFO L93 Difference]: Finished difference Result 522 states and 553 transitions. [2018-02-04 17:38:54,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-02-04 17:38:54,461 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 210 [2018-02-04 17:38:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:54,462 INFO L225 Difference]: With dead ends: 522 [2018-02-04 17:38:54,462 INFO L226 Difference]: Without dead ends: 312 [2018-02-04 17:38:54,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8809 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2887, Invalid=30785, Unknown=0, NotChecked=0, Total=33672 [2018-02-04 17:38:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-02-04 17:38:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 232. [2018-02-04 17:38:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 17:38:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 248 transitions. [2018-02-04 17:38:54,465 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 248 transitions. Word has length 210 [2018-02-04 17:38:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:54,465 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 248 transitions. [2018-02-04 17:38:54,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 17:38:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 248 transitions. [2018-02-04 17:38:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-04 17:38:54,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:54,465 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:38:54,466 INFO L371 AbstractCegarLoop]: === Iteration 58 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:38:54,466 INFO L82 PathProgramCache]: Analyzing trace with hash -781729813, now seen corresponding path program 15 times [2018-02-04 17:38:54,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:54,466 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:54,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:54,466 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:54,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:54,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 338 proven. 943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:55,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:55,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:55,448 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:38:55,732 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-02-04 17:38:55,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:55,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 56 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:56,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:56,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 36] total 76 [2018-02-04 17:38:56,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 17:38:56,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 17:38:56,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=5457, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 17:38:56,821 INFO L87 Difference]: Start difference. First operand 232 states and 248 transitions. Second operand 76 states. [2018-02-04 17:39:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:02,544 INFO L93 Difference]: Finished difference Result 556 states and 589 transitions. [2018-02-04 17:39:02,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 17:39:02,544 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 223 [2018-02-04 17:39:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:02,545 INFO L225 Difference]: With dead ends: 556 [2018-02-04 17:39:02,545 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 17:39:02,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4078 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=790, Invalid=20380, Unknown=0, NotChecked=0, Total=21170 [2018-02-04 17:39:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 17:39:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 245. [2018-02-04 17:39:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 17:39:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 262 transitions. [2018-02-04 17:39:02,550 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 262 transitions. Word has length 223 [2018-02-04 17:39:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:02,550 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 262 transitions. [2018-02-04 17:39:02,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 17:39:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 262 transitions. [2018-02-04 17:39:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-02-04 17:39:02,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:02,551 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:39:02,551 INFO L371 AbstractCegarLoop]: === Iteration 59 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:39:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1764756759, now seen corresponding path program 16 times [2018-02-04 17:39:02,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:02,551 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:02,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:02,552 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:02,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:02,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 392 proven. 1078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:03,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:03,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:03,554 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:39:03,714 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:39:03,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:03,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:03,734 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 17:39:03,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:39:03,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:39:03,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-02-04 17:39:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 450 proven. 1020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:03,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:03,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 42 [2018-02-04 17:39:03,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 17:39:03,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 17:39:03,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1496, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:39:03,847 INFO L87 Difference]: Start difference. First operand 245 states and 262 transitions. Second operand 43 states. [2018-02-04 17:39:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:05,102 INFO L93 Difference]: Finished difference Result 348 states and 367 transitions. [2018-02-04 17:39:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 17:39:05,102 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 236 [2018-02-04 17:39:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:05,103 INFO L225 Difference]: With dead ends: 348 [2018-02-04 17:39:05,103 INFO L226 Difference]: Without dead ends: 348 [2018-02-04 17:39:05,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1555, Invalid=6817, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 17:39:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-04 17:39:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 254. [2018-02-04 17:39:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 17:39:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 272 transitions. [2018-02-04 17:39:05,105 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 272 transitions. Word has length 236 [2018-02-04 17:39:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:05,105 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 272 transitions. [2018-02-04 17:39:05,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 17:39:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 272 transitions. [2018-02-04 17:39:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-02-04 17:39:05,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:05,106 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:39:05,106 INFO L371 AbstractCegarLoop]: === Iteration 60 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:39:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1270113934, now seen corresponding path program 17 times [2018-02-04 17:39:05,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:05,106 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:05,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:05,107 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:05,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:05,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1609 backedges. 195 proven. 1410 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:39:05,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:05,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:05,799 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:39:06,036 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-02-04 17:39:06,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:06,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1609 backedges. 195 proven. 1410 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:39:06,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:06,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-02-04 17:39:06,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:39:06,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:39:06,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:39:06,206 INFO L87 Difference]: Start difference. First operand 254 states and 272 transitions. Second operand 39 states. [2018-02-04 17:39:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:07,254 INFO L93 Difference]: Finished difference Result 499 states and 533 transitions. [2018-02-04 17:39:07,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:39:07,255 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 245 [2018-02-04 17:39:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:07,256 INFO L225 Difference]: With dead ends: 499 [2018-02-04 17:39:07,256 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 17:39:07,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 242 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=2935, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:39:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 17:39:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2018-02-04 17:39:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-04 17:39:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 276 transitions. [2018-02-04 17:39:07,257 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 276 transitions. Word has length 245 [2018-02-04 17:39:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:07,258 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 276 transitions. [2018-02-04 17:39:07,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:39:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 276 transitions. [2018-02-04 17:39:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 17:39:07,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:07,258 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:39:07,258 INFO L371 AbstractCegarLoop]: === Iteration 61 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:39:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1678882095, now seen corresponding path program 18 times [2018-02-04 17:39:07,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:07,259 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:07,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:07,259 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:07,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:07,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 450 proven. 1222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:08,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:08,268 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:08,268 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:39:08,676 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-02-04 17:39:08,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:08,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 64 proven. 1608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:10,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:10,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 82 [2018-02-04 17:39:10,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 17:39:10,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 17:39:10,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=6255, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 17:39:10,177 INFO L87 Difference]: Start difference. First operand 258 states and 276 transitions. Second operand 82 states. [2018-02-04 17:39:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:18,907 INFO L93 Difference]: Finished difference Result 624 states and 661 transitions. [2018-02-04 17:39:18,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-02-04 17:39:18,907 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 249 [2018-02-04 17:39:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:18,908 INFO L225 Difference]: With dead ends: 624 [2018-02-04 17:39:18,908 INFO L226 Difference]: Without dead ends: 369 [2018-02-04 17:39:18,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12793 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3861, Invalid=44319, Unknown=0, NotChecked=0, Total=48180 [2018-02-04 17:39:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-04 17:39:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 271. [2018-02-04 17:39:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 17:39:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 290 transitions. [2018-02-04 17:39:18,912 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 290 transitions. Word has length 249 [2018-02-04 17:39:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:18,912 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 290 transitions. [2018-02-04 17:39:18,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 17:39:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 290 transitions. [2018-02-04 17:39:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 17:39:18,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:18,912 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:39:18,912 INFO L371 AbstractCegarLoop]: === Iteration 62 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:39:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2062853455, now seen corresponding path program 19 times [2018-02-04 17:39:18,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:18,913 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:18,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:18,913 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:18,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:18,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 512 proven. 1375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:19,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:19,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:19,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:19,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 68 proven. 1819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:21,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:21,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 42] total 85 [2018-02-04 17:39:21,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-04 17:39:21,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-04 17:39:21,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=6701, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 17:39:21,128 INFO L87 Difference]: Start difference. First operand 271 states and 290 transitions. Second operand 85 states. [2018-02-04 17:39:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:29,835 INFO L93 Difference]: Finished difference Result 658 states and 697 transitions. [2018-02-04 17:39:29,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-02-04 17:39:29,835 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 262 [2018-02-04 17:39:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:29,836 INFO L225 Difference]: With dead ends: 658 [2018-02-04 17:39:29,836 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 17:39:29,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14539 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4567, Invalid=49025, Unknown=0, NotChecked=0, Total=53592 [2018-02-04 17:39:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 17:39:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 284. [2018-02-04 17:39:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 17:39:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2018-02-04 17:39:29,839 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 262 [2018-02-04 17:39:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:29,839 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2018-02-04 17:39:29,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-02-04 17:39:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2018-02-04 17:39:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-02-04 17:39:29,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:29,840 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:39:29,840 INFO L371 AbstractCegarLoop]: === Iteration 63 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:39:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1618342729, now seen corresponding path program 20 times [2018-02-04 17:39:29,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:29,840 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:29,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:29,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:29,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:29,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2115 backedges. 578 proven. 1537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:30,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:30,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:30,848 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:39:30,869 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:39:30,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:30,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2115 backedges. 72 proven. 2043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:32,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:32,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 89 [2018-02-04 17:39:32,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-02-04 17:39:32,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-02-04 17:39:32,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=7399, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 17:39:32,200 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand 89 states. [2018-02-04 17:39:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:42,356 INFO L93 Difference]: Finished difference Result 692 states and 733 transitions. [2018-02-04 17:39:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-02-04 17:39:42,357 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 275 [2018-02-04 17:39:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:42,358 INFO L225 Difference]: With dead ends: 692 [2018-02-04 17:39:42,358 INFO L226 Difference]: Without dead ends: 407 [2018-02-04 17:39:42,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15059 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=4149, Invalid=52257, Unknown=0, NotChecked=0, Total=56406 [2018-02-04 17:39:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-04 17:39:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 297. [2018-02-04 17:39:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-04 17:39:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 318 transitions. [2018-02-04 17:39:42,362 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 318 transitions. Word has length 275 [2018-02-04 17:39:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:42,362 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 318 transitions. [2018-02-04 17:39:42,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-02-04 17:39:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 318 transitions. [2018-02-04 17:39:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-02-04 17:39:42,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:42,363 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:39:42,363 INFO L371 AbstractCegarLoop]: === Iteration 64 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 17:39:42,363 INFO L82 PathProgramCache]: Analyzing trace with hash -938237621, now seen corresponding path program 21 times [2018-02-04 17:39:42,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:42,363 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:42,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:42,364 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:42,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:42,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 648 proven. 1708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:43,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:43,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:43,692 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:39:44,126 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-02-04 17:39:44,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:44,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-02-04 17:39:45,000 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 17:39:45,000 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:39:45,005 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:39:45,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:39:45 BoogieIcfgContainer [2018-02-04 17:39:45,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:39:45,006 INFO L168 Benchmark]: Toolchain (without parser) took 164438.62 ms. Allocated memory was 400.6 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 357.2 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 190.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:39:45,007 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:39:45,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.99 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 346.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:39:45,007 INFO L168 Benchmark]: Boogie Preprocessor took 29.35 ms. Allocated memory is still 400.6 MB. Free memory was 346.5 MB in the beginning and 345.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:39:45,008 INFO L168 Benchmark]: RCFGBuilder took 257.02 ms. Allocated memory is still 400.6 MB. Free memory was 345.2 MB in the beginning and 317.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-04 17:39:45,008 INFO L168 Benchmark]: TraceAbstraction took 163998.50 ms. Allocated memory was 400.6 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 316.1 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 149.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:39:45,009 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.11 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.99 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 346.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.35 ms. Allocated memory is still 400.6 MB. Free memory was 346.5 MB in the beginning and 345.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 257.02 ms. Allocated memory is still 400.6 MB. Free memory was 345.2 MB in the beginning and 317.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 163998.50 ms. Allocated memory was 400.6 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 316.1 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 149.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 289 with TraceHistMax 20, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 163.9s OverallTime, 64 OverallIterations, 20 TraceHistogramMax, 105.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5453 SDtfs, 16434 SDslu, 124140 SDs, 0 SdLazy, 113779 SolverSat, 3670 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 47.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7538 GetRequests, 4277 SyntacticMatches, 50 SemanticMatches, 3211 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92447 ImplicationChecksByTransitivity, 91.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1391occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 63 MinimizatonAttempts, 3475 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 50.8s InterpolantComputationTime, 10593 NumberOfCodeBlocks, 10542 NumberOfCodeBlocksAsserted, 226 NumberOfCheckSat, 9249 ConstructedInterpolants, 755 QuantifiedInterpolants, 10843199 SizeOfPredicates, 683 NumberOfNonLiveVariables, 21824 ConjunctsInSsa, 3103 ConjunctsInUnsatCore, 91 InterpolantComputations, 21 PerfectInterpolantSequences, 6004/33558 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-39-45-018.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-39-45-018.csv Completed graceful shutdown