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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:46:39,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:46:39,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:46:39,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:46:39,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:46:39,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:46:39,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:46:39,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:46:39,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:46:39,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:46:39,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:46:39,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:46:39,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:46:39,301 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:46:39,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:46:39,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:46:39,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:46:39,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:46:39,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:46:39,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:46:39,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:46:39,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:46:39,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:46:39,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:46:39,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:46:39,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:46:39,313 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:46:39,313 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:46:39,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:46:39,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:46:39,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:46:39,314 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:46:39,324 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:46:39,324 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:46:39,325 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:46:39,326 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:46:39,326 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:46:39,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:46:39,326 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:46:39,326 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:46:39,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:46:39,327 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:46:39,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:46:39,327 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:46:39,327 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:46:39,327 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:46:39,327 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:46:39,328 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:46:39,328 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:46:39,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:46:39,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:46:39,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:46:39,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:46:39,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:46:39,329 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:46:39,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:46:39,329 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:46:39,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:46:39,370 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:46:39,374 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:46:39,375 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:46:39,376 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:46:39,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:46:39,551 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:46:39,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:46:39,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:46:39,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:46:39,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:46:39,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ecf5d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39, skipping insertion in model container [2018-02-02 08:46:39,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,569 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:46:39,591 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:46:39,671 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:46:39,687 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:46:39,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39 WrapperNode [2018-02-02 08:46:39,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:46:39,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:46:39,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:46:39,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:46:39,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (1/1) ... [2018-02-02 08:46:39,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:46:39,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:46:39,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:46:39,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:46:39,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (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-02 08:46:39,768 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:46:39,768 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:46:39,768 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-02 08:46:39,768 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-02 08:46:39,768 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-02-02 08:46:39,769 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:46:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:46:40,027 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:46:40,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:46:40 BoogieIcfgContainer [2018-02-02 08:46:40,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:46:40,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:46:40,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:46:40,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:46:40,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:46:39" (1/3) ... [2018-02-02 08:46:40,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360734bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:46:40, skipping insertion in model container [2018-02-02 08:46:40,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:46:39" (2/3) ... [2018-02-02 08:46:40,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360734bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:46:40, skipping insertion in model container [2018-02-02 08:46:40,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:46:40" (3/3) ... [2018-02-02 08:46:40,034 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:46:40,040 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:46:40,045 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-02 08:46:40,068 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:46:40,068 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:46:40,069 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:46:40,069 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:46:40,069 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:46:40,069 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:46:40,069 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:46:40,069 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:46:40,070 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:46:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-02-02 08:46:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:46:40,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:40,088 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:40,088 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-02-02 08:46:40,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:40,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:40,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:40,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:40,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:40,231 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-02 08:46:40,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:40,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:46:40,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:46:40,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:46:40,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:46:40,317 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-02-02 08:46:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:40,409 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-02 08:46:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:46:40,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 08:46:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:40,419 INFO L225 Difference]: With dead ends: 89 [2018-02-02 08:46:40,419 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 08:46:40,421 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-02 08:46:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 08:46:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-02 08:46:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 08:46:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-02 08:46:40,449 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-02-02 08:46:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:40,449 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-02 08:46:40,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:46:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-02 08:46:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:46:40,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:40,450 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:40,450 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:40,450 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-02-02 08:46:40,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:40,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:40,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:40,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:40,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:40,549 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-02 08:46:40,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:40,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:46:40,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:46:40,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:46:40,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:46:40,552 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-02-02 08:46:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:40,605 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-02-02 08:46:40,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:46:40,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 08:46:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:40,606 INFO L225 Difference]: With dead ends: 85 [2018-02-02 08:46:40,607 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 08:46:40,607 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-02 08:46:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 08:46:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-02 08:46:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 08:46:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-02-02 08:46:40,614 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-02-02 08:46:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:40,614 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-02-02 08:46:40,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:46:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-02-02 08:46:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:46:40,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:40,615 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:40,615 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:40,615 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-02-02 08:46:40,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:40,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:40,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:40,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:40,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:40,647 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-02 08:46:40,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:40,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:46:40,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:46:40,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:46:40,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:46:40,648 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-02-02 08:46:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:40,708 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-02 08:46:40,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:46:40,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:46:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:40,710 INFO L225 Difference]: With dead ends: 84 [2018-02-02 08:46:40,710 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 08:46:40,711 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-02 08:46:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 08:46:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 08:46:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 08:46:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-02 08:46:40,716 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-02-02 08:46:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:40,716 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-02 08:46:40,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:46:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-02 08:46:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:46:40,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:40,717 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:40,717 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-02-02 08:46:40,717 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:40,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:40,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:40,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:40,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:40,781 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-02 08:46:40,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:40,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:46:40,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:46:40,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:46:40,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:46:40,782 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-02-02 08:46:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:40,814 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-02 08:46:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:46:40,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 08:46:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:40,816 INFO L225 Difference]: With dead ends: 83 [2018-02-02 08:46:40,816 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 08:46:40,816 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-02 08:46:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 08:46:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 08:46:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 08:46:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-02 08:46:40,821 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-02-02 08:46:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:40,821 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-02 08:46:40,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:46:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-02 08:46:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:46:40,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:40,822 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:40,822 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-02-02 08:46:40,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:40,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:40,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:40,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:40,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:40,861 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-02 08:46:40,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:40,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:46:40,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:46:40,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:46:40,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:46:40,862 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-02-02 08:46:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:40,934 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-02-02 08:46:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:46:40,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 08:46:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:40,935 INFO L225 Difference]: With dead ends: 82 [2018-02-02 08:46:40,935 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 08:46:40,936 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-02 08:46:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 08:46:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 08:46:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 08:46:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 08:46:40,940 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-02-02 08:46:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:40,940 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 08:46:40,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:46:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 08:46:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:46:40,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:40,941 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:40,941 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-02-02 08:46:40,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:40,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:40,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:40,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:40,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:41,011 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-02 08:46:41,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:41,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:46:41,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:46:41,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:46:41,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:46:41,012 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-02-02 08:46:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:41,085 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-02 08:46:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:46:41,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 08:46:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:41,086 INFO L225 Difference]: With dead ends: 81 [2018-02-02 08:46:41,086 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 08:46:41,087 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-02 08:46:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 08:46:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 08:46:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 08:46:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-02 08:46:41,090 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-02-02 08:46:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:41,091 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-02 08:46:41,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:46:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-02 08:46:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:46:41,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:41,092 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-02 08:46:41,092 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-02-02 08:46:41,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:41,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:41,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:41,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:41,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:41,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:41,136 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-02 08:46:41,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:41,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:46:41,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:46:41,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:46:41,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:46:41,137 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-02-02 08:46:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:41,252 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-02 08:46:41,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:46:41,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 08:46:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:41,253 INFO L225 Difference]: With dead ends: 80 [2018-02-02 08:46:41,253 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 08:46:41,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:46:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 08:46:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 08:46:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 08:46:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-02 08:46:41,257 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-02-02 08:46:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:41,257 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-02 08:46:41,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:46:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-02 08:46:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:46:41,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:41,258 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-02 08:46:41,258 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-02-02 08:46:41,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:41,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:41,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:41,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:41,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:41,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:41,371 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-02 08:46:41,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:41,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:46:41,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:46:41,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:46:41,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:46:41,372 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-02-02 08:46:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:41,499 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-02 08:46:41,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:46:41,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-02 08:46:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:41,502 INFO L225 Difference]: With dead ends: 104 [2018-02-02 08:46:41,502 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 08:46:41,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:46:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 08:46:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-02-02 08:46:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 08:46:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-02 08:46:41,506 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-02-02 08:46:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:41,506 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-02 08:46:41,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:46:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-02 08:46:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:46:41,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:41,507 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-02 08:46:41,507 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-02-02 08:46:41,507 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:41,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:41,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:41,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:41,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:41,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:41,720 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-02 08:46:41,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:41,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 08:46:41,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:46:41,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:46:41,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:46:41,722 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-02-02 08:46:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:42,004 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-02 08:46:42,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:46:42,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-02 08:46:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:42,005 INFO L225 Difference]: With dead ends: 104 [2018-02-02 08:46:42,005 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 08:46:42,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:46:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 08:46:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-02-02 08:46:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:46:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-02 08:46:42,008 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-02-02 08:46:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:42,008 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-02 08:46:42,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:46:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-02 08:46:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 08:46:42,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:42,009 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:42,009 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-02-02 08:46:42,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:42,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:42,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:42,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:42,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:42,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:42,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:42,232 INFO L209 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-02 08:46:42,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:42,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:42,307 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-02 08:46:42,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:42,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:42,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:46:42,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 08:46:42,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 08:46:42,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:42,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:42,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:42,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-02 08:46:42,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 08:46:42,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 08:46:42,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:42,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:42,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:42,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-02 08:46:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:42,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:42,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 08:46:42,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:46:42,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:46:42,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:46:42,573 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 22 states. [2018-02-02 08:46:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:43,296 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-02-02 08:46:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:46:43,296 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-02-02 08:46:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:43,297 INFO L225 Difference]: With dead ends: 100 [2018-02-02 08:46:43,297 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 08:46:43,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 08:46:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 08:46:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-02 08:46:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 08:46:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-02-02 08:46:43,302 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2018-02-02 08:46:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:43,303 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-02-02 08:46:43,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:46:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-02-02 08:46:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:46:43,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:43,303 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:43,303 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-02-02 08:46:43,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:43,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:43,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:43,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:43,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:43,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:43,384 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-02 08:46:43,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:43,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:46:43,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:46:43,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:46:43,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:46:43,385 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-02-02 08:46:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:43,530 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-02-02 08:46:43,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:46:43,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 08:46:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:43,531 INFO L225 Difference]: With dead ends: 92 [2018-02-02 08:46:43,531 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 08:46:43,532 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-02 08:46:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 08:46:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-02 08:46:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 08:46:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-02 08:46:43,534 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-02-02 08:46:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:43,534 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-02 08:46:43,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:46:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-02 08:46:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 08:46:43,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:43,535 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:43,535 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-02-02 08:46:43,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:43,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:43,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:43,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:43,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:43,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:43,586 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-02 08:46:43,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:43,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:46:43,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:46:43,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:46:43,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:46:43,587 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 6 states. [2018-02-02 08:46:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:43,634 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 08:46:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:46:43,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 08:46:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:43,635 INFO L225 Difference]: With dead ends: 67 [2018-02-02 08:46:43,635 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 08:46:43,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:46:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 08:46:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 08:46:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 08:46:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-02-02 08:46:43,637 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 31 [2018-02-02 08:46:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:43,637 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-02-02 08:46:43,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:46:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-02-02 08:46:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 08:46:43,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:43,638 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:43,638 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-02-02 08:46:43,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:43,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:43,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:43,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:43,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:43,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:43,742 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-02 08:46:43,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:43,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:46:43,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:46:43,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:46:43,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:46:43,743 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-02-02 08:46:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:43,816 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-02-02 08:46:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:46:43,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 08:46:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:43,817 INFO L225 Difference]: With dead ends: 72 [2018-02-02 08:46:43,817 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 08:46:43,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:46:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 08:46:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-02-02 08:46:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 08:46:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-02 08:46:43,819 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-02-02 08:46:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:43,819 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-02 08:46:43,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:46:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-02 08:46:43,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 08:46:43,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:43,819 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:43,819 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:43,819 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-02-02 08:46:43,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:43,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:43,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:43,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:43,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:43,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:43,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:43,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 08:46:43,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:46:43,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:46:43,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:46:43,961 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-02-02 08:46:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:44,124 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-02 08:46:44,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:46:44,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-02 08:46:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:44,124 INFO L225 Difference]: With dead ends: 89 [2018-02-02 08:46:44,124 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 08:46:44,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:46:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 08:46:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 08:46:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 08:46:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 08:46:44,131 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-02 08:46:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:44,131 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 08:46:44,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:46:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 08:46:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 08:46:44,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:44,132 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:46:44,132 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:46:44,132 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-02-02 08:46:44,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:44,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:44,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:44,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:44,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:44,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:44,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:44,355 INFO L209 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-02 08:46:44,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:44,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:44,380 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-02 08:46:44,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:44,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:44,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:46:44,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:44,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:44,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02 08:46:44,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:44,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:44,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:46:44,441 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-02 08:46:44,442 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-02 08:46:44,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:44,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:44,448 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-02 08:46:44,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 08:46:44,475 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-02 08:46:44,477 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-02 08:46:44,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:44,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:44,485 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-02 08:46:44,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 08:46:52,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 52 [2018-02-02 08:46:52,817 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 44 treesize of output 42 [2018-02-02 08:46:52,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:52,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-02-02 08:46:52,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:52,941 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 28 treesize of output 31 [2018-02-02 08:46:52,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:52,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-02-02 08:46:52,980 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:53,022 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 28 treesize of output 31 [2018-02-02 08:46:53,023 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:53,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-02-02 08:46:53,046 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:53,079 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 18 [2018-02-02 08:46:53,079 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:53,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 08:46:53,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:53,121 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:72, output treesize:29 [2018-02-02 08:46:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:53,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:53,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2018-02-02 08:46:53,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:46:53,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:46:53,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=681, Unknown=4, NotChecked=0, Total=756 [2018-02-02 08:46:53,211 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 28 states. [2018-02-02 08:46:56,163 WARN L146 SmtUtils]: Spent 639ms on a formula simplification. DAG size of input: 75 DAG size of output 55 [2018-02-02 08:46:58,534 WARN L146 SmtUtils]: Spent 2023ms on a formula simplification. DAG size of input: 54 DAG size of output 45 [2018-02-02 08:47:02,609 WARN L146 SmtUtils]: Spent 2036ms on a formula simplification. DAG size of input: 54 DAG size of output 45 [2018-02-02 08:47:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:10,823 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-02-02 08:47:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:47:10,823 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2018-02-02 08:47:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:10,824 INFO L225 Difference]: With dead ends: 81 [2018-02-02 08:47:10,824 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 08:47:10,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=213, Invalid=1422, Unknown=5, NotChecked=0, Total=1640 [2018-02-02 08:47:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 08:47:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-02 08:47:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 08:47:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-02 08:47:10,826 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-02-02 08:47:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:10,827 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-02 08:47:10,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:47:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-02 08:47:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 08:47:10,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:10,828 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:10,828 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-02-02 08:47:10,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:10,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:10,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:10,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:10,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:10,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:10,880 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-02 08:47:10,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:47:10,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:47:10,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:47:10,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:47:10,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:47:10,881 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-02-02 08:47:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:10,947 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-02-02 08:47:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:47:10,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 08:47:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:10,948 INFO L225 Difference]: With dead ends: 77 [2018-02-02 08:47:10,948 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 08:47:10,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:47:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 08:47:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 08:47:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 08:47:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-02 08:47:10,950 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-02-02 08:47:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:10,950 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-02 08:47:10,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:47:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-02 08:47:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 08:47:10,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:10,950 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:10,950 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:10,951 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-02-02 08:47:10,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:10,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:10,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:10,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:10,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:10,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:11,029 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-02 08:47:11,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:47:11,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:47:11,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:47:11,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:47:11,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:47:11,030 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-02-02 08:47:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:11,078 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-02 08:47:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:47:11,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 08:47:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:11,079 INFO L225 Difference]: With dead ends: 111 [2018-02-02 08:47:11,079 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 08:47:11,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:47:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 08:47:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-02 08:47:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 08:47:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-02 08:47:11,083 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-02-02 08:47:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:11,083 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-02 08:47:11,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:47:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-02 08:47:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 08:47:11,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:11,084 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:11,084 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-02-02 08:47:11,084 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:11,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:11,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:11,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:11,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:11,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:47:11,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:47:11,503 INFO L209 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-02 08:47:11,508 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:47:11,522 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:47:11,526 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:47:11,528 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:47:11,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:47:11,539 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-02 08:47:11,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:47:11,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:47:11,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:11,600 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-02 08:47:11,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:11,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:11,611 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-02 08:47:11,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-02 08:47:11,668 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-02 08:47:11,670 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-02 08:47:11,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,677 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-02 08:47:11,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-02 08:47:11,709 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-02 08:47:11,711 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-02 08:47:11,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:11,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 08:47:11,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-02 08:47:12,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-02 08:47:12,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-02 08:47:12,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:47:12,140 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-02 08:47:12,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:12,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:47:12,149 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-02 08:47:12,150 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-02-02 08:47:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:47:12,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:47:12,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-02-02 08:47:12,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 08:47:12,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 08:47:12,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-02-02 08:47:12,305 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 30 states. [2018-02-02 08:47:14,461 WARN L146 SmtUtils]: Spent 1007ms on a formula simplification. DAG size of input: 69 DAG size of output 56 [2018-02-02 08:47:16,595 WARN L146 SmtUtils]: Spent 2046ms on a formula simplification. DAG size of input: 61 DAG size of output 47 [2018-02-02 08:47:25,402 WARN L146 SmtUtils]: Spent 3131ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-02-02 08:47:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:26,292 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-02-02 08:47:26,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:47:26,292 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-02-02 08:47:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:26,293 INFO L225 Difference]: With dead ends: 112 [2018-02-02 08:47:26,293 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 08:47:26,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=255, Invalid=1815, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 08:47:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 08:47:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-02-02 08:47:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 08:47:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 08:47:26,295 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2018-02-02 08:47:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:26,296 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 08:47:26,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 08:47:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 08:47:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 08:47:26,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:26,296 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:26,296 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-02-02 08:47:26,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:26,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:26,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:26,297 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:47:26,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:26,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:47:26,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:47:26,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 08:47:26,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 08:47:26,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 08:47:26,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:47:26,554 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 16 states. [2018-02-02 08:47:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:26,907 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-02-02 08:47:26,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:47:26,908 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-02 08:47:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:26,908 INFO L225 Difference]: With dead ends: 119 [2018-02-02 08:47:26,908 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 08:47:26,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:47:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 08:47:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2018-02-02 08:47:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 08:47:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2018-02-02 08:47:26,911 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 43 [2018-02-02 08:47:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:26,911 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2018-02-02 08:47:26,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 08:47:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2018-02-02 08:47:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 08:47:26,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:26,912 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:26,912 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:26,912 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-02-02 08:47:26,912 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:26,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:26,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:26,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:26,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:26,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:47:26,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:47:26,970 INFO L209 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-02 08:47:26,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:26,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:47:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:47:27,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:47:27,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-02-02 08:47:27,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:47:27,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:47:27,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:47:27,073 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 12 states. [2018-02-02 08:47:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:27,191 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2018-02-02 08:47:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:47:27,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-02 08:47:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:27,192 INFO L225 Difference]: With dead ends: 97 [2018-02-02 08:47:27,193 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 08:47:27,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:47:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 08:47:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-02 08:47:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 08:47:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2018-02-02 08:47:27,196 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 45 [2018-02-02 08:47:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:27,196 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2018-02-02 08:47:27,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:47:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2018-02-02 08:47:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 08:47:27,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:27,197 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:27,197 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-02-02 08:47:27,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:27,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:27,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:27,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:27,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:27,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:47:27,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:47:27,350 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:47:27,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:27,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:47:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:47:27,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:47:27,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-02-02 08:47:27,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 08:47:27,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 08:47:27,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:47:27,544 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 23 states. [2018-02-02 08:47:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:27,842 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-02-02 08:47:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:47:27,842 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-02-02 08:47:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:27,843 INFO L225 Difference]: With dead ends: 141 [2018-02-02 08:47:27,843 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 08:47:27,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 08:47:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 08:47:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-02-02 08:47:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 08:47:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2018-02-02 08:47:27,847 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 45 [2018-02-02 08:47:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:27,847 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2018-02-02 08:47:27,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 08:47:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-02-02 08:47:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 08:47:27,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:27,848 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:27,848 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:27,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-02-02 08:47:27,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:27,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:27,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:27,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:27,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:27,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:47:27,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:47:27,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:47:27,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:47:27,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:47:27,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:47:27,901 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 8 states. [2018-02-02 08:47:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:27,974 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2018-02-02 08:47:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:47:27,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 08:47:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:27,977 INFO L225 Difference]: With dead ends: 117 [2018-02-02 08:47:27,978 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 08:47:27,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:47:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 08:47:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-02 08:47:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 08:47:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2018-02-02 08:47:27,982 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 47 [2018-02-02 08:47:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:27,982 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2018-02-02 08:47:27,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:47:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-02-02 08:47:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 08:47:27,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:27,983 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:27,983 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-02-02 08:47:27,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:27,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:27,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:27,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:27,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:27,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:47:28,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:47:28,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:47:28,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:47:28,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:47:28,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:47:28,038 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand 5 states. [2018-02-02 08:47:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:28,075 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2018-02-02 08:47:28,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:47:28,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 08:47:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:28,076 INFO L225 Difference]: With dead ends: 119 [2018-02-02 08:47:28,076 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 08:47:28,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:47:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 08:47:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-02-02 08:47:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 08:47:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2018-02-02 08:47:28,079 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 47 [2018-02-02 08:47:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:28,079 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2018-02-02 08:47:28,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:47:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2018-02-02 08:47:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:47:28,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:28,080 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:28,080 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-02-02 08:47:28,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:28,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:28,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:28,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:28,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:28,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:47:28,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:47:28,494 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:47:28,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:28,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:47:28,526 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-02 08:47:28,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,530 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-02 08:47:28,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:47:28,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:28,555 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-02 08:47:28,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:28,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:28,562 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-02 08:47:28,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-02 08:47:28,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 08:47:28,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 08:47:28,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-02 08:47:28,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-02 08:47:28,633 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-02 08:47:28,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:28,640 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-02 08:47:28,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-02-02 08:47:30,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-02-02 08:47:30,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-02 08:47:30,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:47:30,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-02 08:47:30,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:30,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:47:30,070 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-02 08:47:30,070 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-02 08:47:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:47:30,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:47:30,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2018-02-02 08:47:30,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 08:47:30,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 08:47:30,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=791, Unknown=1, NotChecked=0, Total=870 [2018-02-02 08:47:30,179 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 30 states. [2018-02-02 08:47:32,600 WARN L146 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 48 DAG size of output 32 [2018-02-02 08:47:34,061 WARN L146 SmtUtils]: Spent 1245ms on a formula simplification. DAG size of input: 54 DAG size of output 40 [2018-02-02 08:47:34,981 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 73 DAG size of output 54 [2018-02-02 08:47:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:35,657 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-02-02 08:47:35,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:47:35,657 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-02-02 08:47:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:35,658 INFO L225 Difference]: With dead ends: 133 [2018-02-02 08:47:35,658 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 08:47:35,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=278, Invalid=1977, Unknown=1, NotChecked=0, Total=2256 [2018-02-02 08:47:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 08:47:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 76. [2018-02-02 08:47:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 08:47:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-02-02 08:47:35,660 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 48 [2018-02-02 08:47:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:35,660 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-02-02 08:47:35,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 08:47:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-02-02 08:47:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 08:47:35,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:35,661 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:35,661 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-02-02 08:47:35,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:35,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:35,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:35,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:35,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:35,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 08:47:35,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:47:35,710 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:47:35,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:35,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:47:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:47:35,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:47:35,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 10 [2018-02-02 08:47:35,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:47:35,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:47:35,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:47:35,777 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 11 states. [2018-02-02 08:47:35,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:35,871 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-02-02 08:47:35,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:47:35,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-02-02 08:47:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:35,872 INFO L225 Difference]: With dead ends: 75 [2018-02-02 08:47:35,872 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 08:47:35,872 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:47:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 08:47:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-02 08:47:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 08:47:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-02-02 08:47:35,873 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 49 [2018-02-02 08:47:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:35,873 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-02-02 08:47:35,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:47:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-02-02 08:47:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 08:47:35,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:35,874 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:35,874 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-02-02 08:47:35,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:35,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:35,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:35,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:35,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:35,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:47:36,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:47:36,020 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:47:36,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:36,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:47:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:47:36,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:47:36,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-02-02 08:47:36,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 08:47:36,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 08:47:36,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-02-02 08:47:36,165 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 25 states. [2018-02-02 08:47:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:47:36,494 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2018-02-02 08:47:36,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:47:36,494 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-02-02 08:47:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:47:36,495 INFO L225 Difference]: With dead ends: 106 [2018-02-02 08:47:36,495 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 08:47:36,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 08:47:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 08:47:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-02-02 08:47:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 08:47:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-02-02 08:47:36,497 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 49 [2018-02-02 08:47:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:47:36,497 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-02-02 08:47:36,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 08:47:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-02-02 08:47:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 08:47:36,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:47:36,498 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:47:36,498 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 08:47:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-02-02 08:47:36,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:47:36,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:47:36,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:36,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:36,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:47:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:36,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:47:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:47:36,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:47:36,604 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:47:36,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:47:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:47:36,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:47:36,644 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-02 08:47:36,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:36,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:36,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:47:36,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:36,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:36,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:47:36,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:36,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:36,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:47:36,719 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-02 08:47:36,720 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-02 08:47:36,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:36,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:36,732 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-02 08:47:36,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 08:47:36,749 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-02 08:47:36,751 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-02 08:47:36,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:36,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:47:36,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 08:47:36,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-02 08:47:41,050 WARN L143 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 57 [2018-02-02 08:47:43,118 WARN L143 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 62 [2018-02-02 08:47:45,182 WARN L143 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 63 [2018-02-02 08:47:47,247 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 63 [2018-02-02 08:47:47,662 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 53 treesize of output 45 [2018-02-02 08:47:47,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-02-02 08:47:47,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:47:47,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:47:47,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-02-02 08:47:47,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:47:47,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:47:47,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:47:47,706 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:75, output treesize:51 [2018-02-02 08:47:47,792 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-02 08:47:47,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:47:47,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 34 [2018-02-02 08:47:47,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 08:47:47,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 08:47:47,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1033, Unknown=1, NotChecked=0, Total=1122 [2018-02-02 08:47:47,811 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 34 states. Received shutdown request... [2018-02-02 08:47:52,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:47:52,224 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:47:52,227 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:47:52,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:47:52 BoogieIcfgContainer [2018-02-02 08:47:52,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:47:52,228 INFO L168 Benchmark]: Toolchain (without parser) took 72675.89 ms. Allocated memory was 405.3 MB in the beginning and 803.7 MB in the end (delta: 398.5 MB). Free memory was 362.0 MB in the beginning and 578.0 MB in the end (delta: -216.1 MB). Peak memory consumption was 182.4 MB. Max. memory is 5.3 GB. [2018-02-02 08:47:52,228 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 405.3 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:47:52,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.92 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 351.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:47:52,229 INFO L168 Benchmark]: Boogie Preprocessor took 32.38 ms. Allocated memory is still 405.3 MB. Free memory was 351.4 MB in the beginning and 348.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:47:52,229 INFO L168 Benchmark]: RCFGBuilder took 300.22 ms. Allocated memory is still 405.3 MB. Free memory was 348.8 MB in the beginning and 320.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-02 08:47:52,229 INFO L168 Benchmark]: TraceAbstraction took 72198.60 ms. Allocated memory was 405.3 MB in the beginning and 803.7 MB in the end (delta: 398.5 MB). Free memory was 320.9 MB in the beginning and 578.0 MB in the end (delta: -257.1 MB). Peak memory consumption was 141.4 MB. Max. memory is 5.3 GB. [2018-02-02 08:47:52,230 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.17 ms. Allocated memory is still 405.3 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 141.92 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 351.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.38 ms. Allocated memory is still 405.3 MB. Free memory was 351.4 MB in the beginning and 348.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 300.22 ms. Allocated memory is still 405.3 MB. Free memory was 348.8 MB in the beginning and 320.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 72198.60 ms. Allocated memory was 405.3 MB in the beginning and 803.7 MB in the end (delta: 398.5 MB). Free memory was 320.9 MB in the beginning and 578.0 MB in the end (delta: -257.1 MB). Peak memory consumption was 141.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 72.1s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 45.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1756 SDtfs, 1834 SDslu, 10011 SDs, 0 SdLazy, 6332 SolverSat, 395 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 318 SyntacticMatches, 17 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2111 ImplicationChecksByTransitivity, 46.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=21, 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, 26 MinimizatonAttempts, 178 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 1282 NumberOfCodeBlocks, 1282 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1246 ConstructedInterpolants, 121 QuantifiedInterpolants, 472366 SizeOfPredicates, 113 NumberOfNonLiveVariables, 1745 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 36 InterpolantComputations, 20 PerfectInterpolantSequences, 34/87 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-47-52-236.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-47-52-236.csv Completed graceful shutdown