java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:03:31,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:03:31,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:03:31,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:03:31,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:03:31,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:03:31,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:03:31,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:03:31,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:03:31,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:03:31,152 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:03:31,152 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:03:31,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:03:31,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:03:31,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:03:31,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:03:31,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:03:31,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:03:31,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:03:31,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:03:31,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:03:31,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:03:31,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:03:31,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:03:31,165 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:03:31,166 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:03:31,166 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:03:31,167 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:03:31,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:03:31,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:03:31,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:03:31,168 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:03:31,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:03:31,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:03:31,177 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:03:31,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:03:31,178 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:03:31,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:03:31,179 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:03:31,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:03:31,179 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:03:31,179 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:03:31,179 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:03:31,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:03:31,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:03:31,179 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:03:31,180 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:03:31,180 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:03:31,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:03:31,213 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:03:31,215 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:03:31,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:03:31,217 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:03:31,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:03:31,339 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:03:31,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:03:31,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:03:31,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:03:31,344 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:03:31,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31, skipping insertion in model container [2018-02-04 12:03:31,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,358 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:03:31,386 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:03:31,477 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:03:31,496 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:03:31,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31 WrapperNode [2018-02-04 12:03:31,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:03:31,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:03:31,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:03:31,503 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:03:31,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (1/1) ... [2018-02-04 12:03:31,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:03:31,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:03:31,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:03:31,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:03:31,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:03:31,567 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:03:31,567 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:03:31,568 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-04 12:03:31,568 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:03:31,568 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:03:31,568 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:03:31,568 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:03:31,568 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:03:31,568 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:03:31,569 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:03:31,569 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-04 12:03:31,569 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:03:31,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:03:31,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:03:31,761 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:03:31,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:03:31 BoogieIcfgContainer [2018-02-04 12:03:31,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:03:31,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:03:31,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:03:31,765 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:03:31,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:03:31" (1/3) ... [2018-02-04 12:03:31,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11571e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:03:31, skipping insertion in model container [2018-02-04 12:03:31,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:31" (2/3) ... [2018-02-04 12:03:31,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11571e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:03:31, skipping insertion in model container [2018-02-04 12:03:31,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:03:31" (3/3) ... [2018-02-04 12:03:31,767 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:03:31,772 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:03:31,777 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 12:03:31,809 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:03:31,809 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:03:31,809 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:03:31,810 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:03:31,810 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:03:31,810 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:03:31,810 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:03:31,810 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:03:31,811 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:03:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-02-04 12:03:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:03:31,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:31,833 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:31,833 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:31,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029996, now seen corresponding path program 1 times [2018-02-04 12:03:31,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:31,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:31,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:31,878 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:31,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:31,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:32,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:03:32,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:03:32,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:03:32,043 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-02-04 12:03:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,176 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-04 12:03:32,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:03:32,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:03:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,186 INFO L225 Difference]: With dead ends: 60 [2018-02-04 12:03:32,186 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 12:03:32,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 12:03:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 12:03:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 12:03:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-04 12:03:32,213 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-02-04 12:03:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,213 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-04 12:03:32,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:03:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-04 12:03:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:03:32,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,214 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:32,214 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029997, now seen corresponding path program 1 times [2018-02-04 12:03:32,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,215 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:03:32,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:03:32,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:03:32,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:32,316 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-02-04 12:03:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,398 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-02-04 12:03:32,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:03:32,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:03:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,400 INFO L225 Difference]: With dead ends: 56 [2018-02-04 12:03:32,400 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 12:03:32,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:03:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 12:03:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 12:03:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:03:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-04 12:03:32,405 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-02-04 12:03:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,406 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-04 12:03:32,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:03:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-04 12:03:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:03:32,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,407 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:32,407 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash -684644977, now seen corresponding path program 1 times [2018-02-04 12:03:32,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,409 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:32,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:03:32,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:03:32,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:03:32,444 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-02-04 12:03:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,495 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-02-04 12:03:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:03:32,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:03:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,497 INFO L225 Difference]: With dead ends: 55 [2018-02-04 12:03:32,497 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 12:03:32,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 12:03:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 12:03:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:03:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-02-04 12:03:32,501 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-02-04 12:03:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,502 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-02-04 12:03:32,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:03:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-02-04 12:03:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:03:32,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,502 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:32,502 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash -684644976, now seen corresponding path program 1 times [2018-02-04 12:03:32,503 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,504 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:32,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:32,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:32,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:32,568 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-02-04 12:03:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,596 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-04 12:03:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:03:32,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:03:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,598 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:03:32,598 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:03:32,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:03:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 12:03:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:03:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-02-04 12:03:32,602 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-02-04 12:03:32,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,602 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-02-04 12:03:32,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-02-04 12:03:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:03:32,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,603 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] [2018-02-04 12:03:32,603 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash 518960417, now seen corresponding path program 1 times [2018-02-04 12:03:32,603 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,603 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:32,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:32,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:32,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:32,647 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-02-04 12:03:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,700 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-02-04 12:03:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:03:32,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 12:03:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,701 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:03:32,701 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:03:32,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:03:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:03:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:03:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-04 12:03:32,706 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-02-04 12:03:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,706 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-04 12:03:32,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-04 12:03:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:03:32,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,707 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] [2018-02-04 12:03:32,707 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 518960418, now seen corresponding path program 1 times [2018-02-04 12:03:32,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:03:32,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:03:32,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:03:32,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:03:32,792 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-02-04 12:03:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,904 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 12:03:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:03:32,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-04 12:03:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,906 INFO L225 Difference]: With dead ends: 74 [2018-02-04 12:03:32,906 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 12:03:32,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:03:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 12:03:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-02-04 12:03:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 12:03:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-02-04 12:03:32,909 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-02-04 12:03:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,909 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-02-04 12:03:32,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:03:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-02-04 12:03:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:03:32,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,910 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 12:03:32,910 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096233, now seen corresponding path program 1 times [2018-02-04 12:03:32,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:32,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:32,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:32,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:32,936 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-02-04 12:03:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,975 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-04 12:03:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:03:32,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 12:03:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,976 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:03:32,977 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:03:32,977 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:03:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 12:03:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 12:03:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-02-04 12:03:32,980 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-02-04 12:03:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,980 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-02-04 12:03:32,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-02-04 12:03:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:03:32,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,981 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 12:03:32,981 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096232, now seen corresponding path program 1 times [2018-02-04 12:03:32,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,982 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:33,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:33,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:03:33,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:03:33,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:03:33,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:03:33,055 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-02-04 12:03:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:33,121 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-02-04 12:03:33,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:03:33,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 12:03:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:33,122 INFO L225 Difference]: With dead ends: 68 [2018-02-04 12:03:33,122 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 12:03:33,123 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 12:03:33,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 12:03:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-02-04 12:03:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 12:03:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-02-04 12:03:33,126 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-02-04 12:03:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:33,126 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-02-04 12:03:33,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:03:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-02-04 12:03:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:03:33,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:33,127 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:33,127 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2118091962, now seen corresponding path program 1 times [2018-02-04 12:03:33,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:33,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:33,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,128 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:33,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:33,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:33,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:33,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:03:33,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:03:33,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:03:33,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:33,201 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2018-02-04 12:03:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:33,320 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-04 12:03:33,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:03:33,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 12:03:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:33,321 INFO L225 Difference]: With dead ends: 60 [2018-02-04 12:03:33,321 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 12:03:33,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:03:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 12:03:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 12:03:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 12:03:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-04 12:03:33,324 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-02-04 12:03:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:33,324 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-04 12:03:33,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:03:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-04 12:03:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:03:33,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:33,325 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] [2018-02-04 12:03:33,325 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:33,325 INFO L82 PathProgramCache]: Analyzing trace with hash 487859445, now seen corresponding path program 1 times [2018-02-04 12:03:33,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:33,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:33,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,326 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:33,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:33,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:33,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:33,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:33,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:03:33,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:03:33,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:03:33,351 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-02-04 12:03:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:33,357 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 12:03:33,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:03:33,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 12:03:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:33,357 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:03:33,358 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:03:33,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:03:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:03:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 12:03:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:03:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-04 12:03:33,360 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-02-04 12:03:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:33,361 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-04 12:03:33,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:03:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-04 12:03:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:03:33,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:33,361 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] [2018-02-04 12:03:33,362 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1854244690, now seen corresponding path program 1 times [2018-02-04 12:03:33,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:33,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:33,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:33,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:33,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:33,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:33,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:33,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:03:33,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:03:33,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:03:33,385 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-02-04 12:03:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:33,389 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-04 12:03:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:03:33,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-02-04 12:03:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:33,391 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:03:33,392 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:03:33,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:03:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:03:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 12:03:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:03:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-04 12:03:33,394 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-02-04 12:03:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:33,394 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-04 12:03:33,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:03:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-04 12:03:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:03:33,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:33,395 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] [2018-02-04 12:03:33,395 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2022484201, now seen corresponding path program 1 times [2018-02-04 12:03:33,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:33,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:33,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:33,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:33,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:33,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:33,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 12:03:33,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:03:33,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:03:33,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:03:33,578 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-02-04 12:03:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:33,753 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-02-04 12:03:33,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:03:33,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-04 12:03:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:33,753 INFO L225 Difference]: With dead ends: 69 [2018-02-04 12:03:33,753 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:03:33,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:03:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:03:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 12:03:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:03:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-02-04 12:03:33,755 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-02-04 12:03:33,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:33,755 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-02-04 12:03:33,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:03:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-02-04 12:03:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:03:33,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:33,756 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] [2018-02-04 12:03:33,756 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash -349255061, now seen corresponding path program 1 times [2018-02-04 12:03:33,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:33,756 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:33,757 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,757 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:33,757 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:33,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:33,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:33,947 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:03:33,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:34,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:34,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:03:34,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:03:34,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:34,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:34,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:03:34,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:03:34,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:03:34,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:03:34,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:03:34,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:03:34,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 12:03:34,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:03:34,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 12:03:34,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:03:34,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 12:03:34,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:03:34,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:34,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-04 12:03:34,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:34,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:34,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:34,356 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-02-04 12:03:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:34,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:34,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-02-04 12:03:34,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:03:34,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:03:34,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:03:34,468 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-02-04 12:03:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:35,030 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-02-04 12:03:35,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:03:35,030 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-02-04 12:03:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:35,031 INFO L225 Difference]: With dead ends: 66 [2018-02-04 12:03:35,031 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 12:03:35,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:03:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 12:03:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-04 12:03:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 12:03:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 12:03:35,033 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2018-02-04 12:03:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:35,034 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 12:03:35,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:03:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 12:03:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 12:03:35,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:35,035 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:03:35,035 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2057994991, now seen corresponding path program 1 times [2018-02-04 12:03:35,035 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:35,035 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:35,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:35,036 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:35,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:35,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:35,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:35,240 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:03:35,247 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:35,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:35,271 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 12:03:35,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 11 treesize of output 10 [2018-02-04 12:03:35,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:35,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:35,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:03:35,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:03:35,540 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 29 treesize of output 29 [2018-02-04 12:03:35,556 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 21 treesize of output 23 [2018-02-04 12:03:35,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:35,571 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 25 treesize of output 18 [2018-02-04 12:03:35,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:35,589 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 16 [2018-02-04 12:03:35,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:35,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:03:35,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:35,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2018-02-04 12:03:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:35,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:35,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-02-04 12:03:35,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:03:35,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:03:35,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:03:35,693 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 24 states. [2018-02-04 12:03:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:36,320 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-04 12:03:36,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:03:36,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-02-04 12:03:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:36,321 INFO L225 Difference]: With dead ends: 64 [2018-02-04 12:03:36,321 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 12:03:36,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 12:03:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 12:03:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-02-04 12:03:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 12:03:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-02-04 12:03:36,324 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2018-02-04 12:03:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:36,324 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-02-04 12:03:36,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:03:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-02-04 12:03:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:03:36,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:36,326 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:03:36,326 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1216715776, now seen corresponding path program 2 times [2018-02-04 12:03:36,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:36,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:36,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:36,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:36,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:36,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:36,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:36,629 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:03:36,637 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:03:36,653 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:03:36,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:03:36,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:36,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:03:36,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:03:36,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:03:36,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:36,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:03:36,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:36,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:36,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:03:36,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:03:36,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:03:36,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:03:36,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 12:03:36,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 12:03:36,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:03:36,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:03:36,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-02-04 12:03:36,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-02-04 12:03:36,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:03:36,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:36,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:03:36,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:36,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:36,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:36,994 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-02-04 12:03:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:37,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:37,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-02-04 12:03:37,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:03:37,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:03:37,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:03:37,089 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 26 states. [2018-02-04 12:03:38,270 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 71 DAG size of output 52 [2018-02-04 12:03:40,366 WARN L146 SmtUtils]: Spent 2060ms on a formula simplification. DAG size of input: 76 DAG size of output 56 [2018-02-04 12:03:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:40,693 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 12:03:40,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:03:40,693 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-02-04 12:03:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:40,694 INFO L225 Difference]: With dead ends: 57 [2018-02-04 12:03:40,694 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 12:03:40,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 12:03:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 12:03:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-02-04 12:03:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:03:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-04 12:03:40,698 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2018-02-04 12:03:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:40,698 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-04 12:03:40,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:03:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-04 12:03:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 12:03:40,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:40,699 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:40,700 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 12:03:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash -936516614, now seen corresponding path program 2 times [2018-02-04 12:03:40,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:40,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:40,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:40,701 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:03:40,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:40,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:41,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:41,084 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:03:41,089 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:03:41,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:03:41,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:03:41,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:41,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:03:41,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:41,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:41,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:03:41,133 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 12:03:41,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:03:41,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:41,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:41,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:41,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 12:03:41,273 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 30 treesize of output 30 [2018-02-04 12:03:41,284 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 22 treesize of output 25 [2018-02-04 12:03:41,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:41,292 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 19 [2018-02-04 12:03:41,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:41,301 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 19 treesize of output 17 [2018-02-04 12:03:41,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:41,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:03:41,316 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 12:03:41,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-02-04 12:03:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:41,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:41,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-02-04 12:03:41,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:03:41,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:03:41,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:03:41,402 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 26 states. [2018-02-04 12:03:42,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:42,118 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-02-04 12:03:42,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:03:42,118 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-02-04 12:03:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:42,119 INFO L225 Difference]: With dead ends: 55 [2018-02-04 12:03:42,119 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:03:42,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:03:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:03:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:03:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:03:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:03:42,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-02-04 12:03:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:42,119 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:03:42,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:03:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:03:42,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:03:42,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:03:42 BoogieIcfgContainer [2018-02-04 12:03:42,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:03:42,123 INFO L168 Benchmark]: Toolchain (without parser) took 10784.13 ms. Allocated memory was 402.1 MB in the beginning and 747.6 MB in the end (delta: 345.5 MB). Free memory was 358.8 MB in the beginning and 583.1 MB in the end (delta: -224.3 MB). Peak memory consumption was 121.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:42,124 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:03:42,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.12 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 348.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:42,124 INFO L168 Benchmark]: Boogie Preprocessor took 25.63 ms. Allocated memory is still 402.1 MB. Free memory was 348.2 MB in the beginning and 346.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:42,124 INFO L168 Benchmark]: RCFGBuilder took 233.47 ms. Allocated memory is still 402.1 MB. Free memory was 346.9 MB in the beginning and 324.3 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:42,124 INFO L168 Benchmark]: TraceAbstraction took 10360.25 ms. Allocated memory was 402.1 MB in the beginning and 747.6 MB in the end (delta: 345.5 MB). Free memory was 324.3 MB in the beginning and 583.1 MB in the end (delta: -258.9 MB). Peak memory consumption was 86.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:03:42,125 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.12 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 348.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.63 ms. Allocated memory is still 402.1 MB. Free memory was 348.2 MB in the beginning and 346.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 233.47 ms. Allocated memory is still 402.1 MB. Free memory was 346.9 MB in the beginning and 324.3 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10360.25 ms. Allocated memory was 402.1 MB in the beginning and 747.6 MB in the end (delta: 345.5 MB). Free memory was 324.3 MB in the beginning and 583.1 MB in the end (delta: -258.9 MB). Peak memory consumption was 86.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 15 error locations. SAFE Result, 10.3s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 1049 SDslu, 2531 SDs, 0 SdLazy, 2222 SolverSat, 133 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 554 ConstructedInterpolants, 51 QuantifiedInterpolants, 243997 SizeOfPredicates, 41 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 29/109 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-03-42-129.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-03-42-129.csv Received shutdown request...