java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:48:20,523 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:48:20,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:48:20,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:48:20,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:48:20,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:48:20,538 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:48:20,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:48:20,540 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:48:20,541 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:48:20,541 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:48:20,542 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:48:20,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:48:20,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:48:20,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:48:20,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:48:20,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:48:20,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:48:20,551 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:48:20,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:48:20,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:48:20,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:48:20,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:48:20,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:48:20,557 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:48:20,558 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:48:20,558 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:48:20,559 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:48:20,559 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:48:20,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:48:20,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:48:20,560 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:48:20,570 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:48:20,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:48:20,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:48:20,571 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:48:20,571 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:48:20,571 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:48:20,572 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:48:20,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:48:20,572 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:48:20,573 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:48:20,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:48:20,573 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:48:20,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:48:20,573 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:48:20,574 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:48:20,574 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:48:20,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:48:20,574 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:48:20,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:48:20,575 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:48:20,575 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:48:20,575 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:48:20,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:48:20,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:48:20,576 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:48:20,576 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:48:20,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:48:20,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:48:20,577 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:48:20,577 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:48:20,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:48:20,577 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:48:20,578 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:48:20,578 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:48:20,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:48:20,624 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:48:20,628 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:48:20,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:48:20,631 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:48:20,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:48:20,793 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:48:20,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:48:20,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:48:20,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:48:20,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:48:20,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:20,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca156b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20, skipping insertion in model container [2018-01-24 11:48:20,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:20,820 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:48:20,857 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:48:20,970 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:48:20,987 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:48:20,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20 WrapperNode [2018-01-24 11:48:20,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:48:20,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:48:20,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:48:20,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:48:21,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:21,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:21,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:21,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:21,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:21,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:21,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (1/1) ... [2018-01-24 11:48:21,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:48:21,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:48:21,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:48:21,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:48:21,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:48:21,075 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:48:21,075 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:48:21,075 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-24 11:48:21,075 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-24 11:48:21,076 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-01-24 11:48:21,076 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:48:21,076 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:48:21,076 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:48:21,076 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:48:21,076 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:48:21,077 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:48:21,077 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:48:21,077 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-24 11:48:21,077 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-24 11:48:21,077 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-01-24 11:48:21,077 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:48:21,077 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:48:21,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:48:21,400 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:48:21,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:48:21 BoogieIcfgContainer [2018-01-24 11:48:21,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:48:21,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:48:21,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:48:21,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:48:21,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:48:20" (1/3) ... [2018-01-24 11:48:21,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8772f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:48:21, skipping insertion in model container [2018-01-24 11:48:21,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:20" (2/3) ... [2018-01-24 11:48:21,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8772f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:48:21, skipping insertion in model container [2018-01-24 11:48:21,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:48:21" (3/3) ... [2018-01-24 11:48:21,410 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:48:21,419 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:48:21,426 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-24 11:48:21,462 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:48:21,462 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:48:21,463 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:48:21,463 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:48:21,463 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:48:21,463 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:48:21,463 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:48:21,463 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:48:21,464 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:48:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-01-24 11:48:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:48:21,486 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:21,488 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:21,488 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-01-24 11:48:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-01-24 11:48:21,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:21,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:21,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:21,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:21,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:21,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:21,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:21,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:48:21,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:48:21,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:48:21,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:48:21,817 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-01-24 11:48:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:21,959 INFO L93 Difference]: Finished difference Result 147 states and 171 transitions. [2018-01-24 11:48:21,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:48:21,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 11:48:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:21,968 INFO L225 Difference]: With dead ends: 147 [2018-01-24 11:48:21,968 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 11:48:21,971 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:48:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 11:48:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-24 11:48:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 11:48:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-01-24 11:48:22,009 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-01-24 11:48:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:22,009 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-01-24 11:48:22,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:48:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-01-24 11:48:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:48:22,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:22,010 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:22,010 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-01-24 11:48:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-01-24 11:48:22,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:22,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:22,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:22,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:22,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:22,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:22,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:48:22,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:48:22,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:48:22,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:48:22,172 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-01-24 11:48:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:22,345 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-01-24 11:48:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:48:22,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 11:48:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:22,347 INFO L225 Difference]: With dead ends: 86 [2018-01-24 11:48:22,347 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 11:48:22,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:48:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 11:48:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-24 11:48:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 11:48:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-24 11:48:22,358 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-01-24 11:48:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:22,359 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-24 11:48:22,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:48:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-24 11:48:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:48:22,360 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:22,360 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:22,360 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-01-24 11:48:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-01-24 11:48:22,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:22,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:22,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:22,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:22,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:22,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:22,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:48:22,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:48:22,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:48:22,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:48:22,416 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-01-24 11:48:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:22,488 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-24 11:48:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:48:22,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:48:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:22,490 INFO L225 Difference]: With dead ends: 85 [2018-01-24 11:48:22,490 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 11:48:22,491 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:48:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 11:48:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-24 11:48:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 11:48:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-01-24 11:48:22,499 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-01-24 11:48:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:22,500 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-01-24 11:48:22,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:48:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-01-24 11:48:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:48:22,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:22,501 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:22,501 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-01-24 11:48:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-01-24 11:48:22,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:22,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:22,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:22,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:22,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:22,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:22,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:48:22,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:48:22,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:48:22,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:48:22,582 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-01-24 11:48:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:22,616 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-01-24 11:48:22,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:48:22,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:48:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:22,618 INFO L225 Difference]: With dead ends: 84 [2018-01-24 11:48:22,618 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 11:48:22,618 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:48:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 11:48:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-24 11:48:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 11:48:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-24 11:48:22,625 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-01-24 11:48:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:22,626 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-24 11:48:22,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:48:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-24 11:48:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:48:22,627 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:22,627 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:22,627 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-01-24 11:48:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-01-24 11:48:22,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:22,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:22,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:22,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:22,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:22,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:22,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:48:22,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:48:22,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:48:22,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:48:22,673 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-01-24 11:48:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:22,755 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-01-24 11:48:22,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:48:22,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 11:48:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:22,756 INFO L225 Difference]: With dead ends: 83 [2018-01-24 11:48:22,756 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 11:48:22,757 INFO L525 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-01-24 11:48:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 11:48:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 11:48:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 11:48:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-24 11:48:22,762 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-01-24 11:48:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:22,762 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-24 11:48:22,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:48:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-24 11:48:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:48:22,763 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:22,763 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:22,763 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-01-24 11:48:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-01-24 11:48:22,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:22,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:22,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:22,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:22,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:22,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:22,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:48:22,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:48:22,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:48:22,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:48:22,840 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-01-24 11:48:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:22,939 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-24 11:48:22,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:48:22,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 11:48:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:22,940 INFO L225 Difference]: With dead ends: 82 [2018-01-24 11:48:22,940 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 11:48:22,940 INFO L525 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-01-24 11:48:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 11:48:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-24 11:48:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 11:48:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-24 11:48:22,949 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-01-24 11:48:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:22,949 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-24 11:48:22,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:48:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-24 11:48:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:48:22,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:22,951 INFO L322 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-01-24 11:48:22,951 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-01-24 11:48:22,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-01-24 11:48:22,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:22,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:22,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:22,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:22,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:23,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:23,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:48:23,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:48:23,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:48:23,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:48:23,031 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-01-24 11:48:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:23,169 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-01-24 11:48:23,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:48:23,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 11:48:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:23,171 INFO L225 Difference]: With dead ends: 81 [2018-01-24 11:48:23,171 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 11:48:23,171 INFO L525 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-01-24 11:48:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 11:48:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 11:48:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 11:48:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-24 11:48:23,179 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-01-24 11:48:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:23,180 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-24 11:48:23,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:48:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-24 11:48:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:48:23,181 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:23,181 INFO L322 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-01-24 11:48:23,181 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-01-24 11:48:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-01-24 11:48:23,181 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:23,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:23,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:23,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:23,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:23,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:23,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:23,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:48:23,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:48:23,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:48:23,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:48:23,352 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-01-24 11:48:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:23,524 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-01-24 11:48:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:48:23,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 11:48:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:23,527 INFO L225 Difference]: With dead ends: 165 [2018-01-24 11:48:23,528 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 11:48:23,528 INFO L525 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-01-24 11:48:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 11:48:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-01-24 11:48:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 11:48:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-01-24 11:48:23,535 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-01-24 11:48:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:23,535 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-01-24 11:48:23,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:48:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-01-24 11:48:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:48:23,536 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:23,536 INFO L322 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-01-24 11:48:23,536 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-01-24 11:48:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-01-24 11:48:23,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:23,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:23,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:23,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:23,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:23,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:24,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:24,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 11:48:24,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:48:24,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:48:24,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:48:24,037 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 16 states. [2018-01-24 11:48:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:24,860 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-01-24 11:48:24,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 11:48:24,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-24 11:48:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:24,863 INFO L225 Difference]: With dead ends: 153 [2018-01-24 11:48:24,863 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 11:48:24,863 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:48:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 11:48:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2018-01-24 11:48:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 11:48:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2018-01-24 11:48:24,882 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 23 [2018-01-24 11:48:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:24,883 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2018-01-24 11:48:24,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:48:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-01-24 11:48:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:48:24,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:24,884 INFO L322 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-01-24 11:48:24,885 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-01-24 11:48:24,885 INFO L82 PathProgramCache]: Analyzing trace with hash -197547585, now seen corresponding path program 1 times [2018-01-24 11:48:24,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:24,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:24,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:24,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:24,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:24,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:25,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:25,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 11:48:25,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:48:25,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:48:25,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:48:25,102 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 13 states. [2018-01-24 11:48:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:25,455 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2018-01-24 11:48:25,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:48:25,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-01-24 11:48:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:25,456 INFO L225 Difference]: With dead ends: 150 [2018-01-24 11:48:25,456 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 11:48:25,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:48:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 11:48:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2018-01-24 11:48:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 11:48:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-01-24 11:48:25,467 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-01-24 11:48:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:25,467 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-01-24 11:48:25,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:48:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-01-24 11:48:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:48:25,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:25,469 INFO L322 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-01-24 11:48:25,469 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-01-24 11:48:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-01-24 11:48:25,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:25,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:25,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:25,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:25,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:25,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:25,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:48:25,697 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:48:25,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:25,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:48:25,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:48:25,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:25,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:25,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:48:25,814 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-01-24 11:48:25,816 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-01-24 11:48:25,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:25,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:25,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:25,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 11:48:25,936 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-01-24 11:48:25,942 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-01-24 11:48:25,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:48:25,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:25,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:25,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 11:48:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:26,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:48:26,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-24 11:48:26,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 11:48:26,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 11:48:26,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:48:26,044 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 22 states. [2018-01-24 11:48:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:26,801 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-24 11:48:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:48:26,840 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-01-24 11:48:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:26,841 INFO L225 Difference]: With dead ends: 101 [2018-01-24 11:48:26,841 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 11:48:26,842 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 11:48:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 11:48:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-01-24 11:48:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 11:48:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-01-24 11:48:26,852 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2018-01-24 11:48:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:26,852 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-01-24 11:48:26,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 11:48:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-01-24 11:48:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:48:26,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:26,854 INFO L322 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-01-24 11:48:26,854 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-01-24 11:48:26,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-01-24 11:48:26,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:26,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:26,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:26,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:26,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:26,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:26,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:26,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:48:26,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:48:26,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:48:26,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:48:26,982 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-01-24 11:48:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:27,187 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-01-24 11:48:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:48:27,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 11:48:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:27,188 INFO L225 Difference]: With dead ends: 93 [2018-01-24 11:48:27,188 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 11:48:27,188 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:48:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 11:48:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-24 11:48:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 11:48:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-24 11:48:27,193 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-01-24 11:48:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:27,193 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-24 11:48:27,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:48:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-24 11:48:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:48:27,194 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:27,194 INFO L322 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-01-24 11:48:27,194 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-01-24 11:48:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-01-24 11:48:27,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:27,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:27,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:27,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:27,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:27,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:27,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:27,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:48:27,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:48:27,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:48:27,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:48:27,240 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 6 states. [2018-01-24 11:48:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:27,326 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-24 11:48:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:48:27,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 11:48:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:27,327 INFO L225 Difference]: With dead ends: 68 [2018-01-24 11:48:27,327 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 11:48:27,327 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:48:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 11:48:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 11:48:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 11:48:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-24 11:48:27,333 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 31 [2018-01-24 11:48:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:27,333 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-24 11:48:27,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:48:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-24 11:48:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:48:27,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:27,334 INFO L322 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-01-24 11:48:27,334 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-01-24 11:48:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-01-24 11:48:27,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:27,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:27,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:27,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:27,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:27,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:27,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:27,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:48:27,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:48:27,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:48:27,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:48:27,490 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-01-24 11:48:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:27,612 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-24 11:48:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:48:27,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-24 11:48:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:27,613 INFO L225 Difference]: With dead ends: 73 [2018-01-24 11:48:27,613 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 11:48:27,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:48:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 11:48:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-01-24 11:48:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 11:48:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-01-24 11:48:27,622 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-01-24 11:48:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:27,622 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-01-24 11:48:27,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:48:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-01-24 11:48:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 11:48:27,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:27,623 INFO L322 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-01-24 11:48:27,623 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-01-24 11:48:27,624 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-01-24 11:48:27,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:27,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:27,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:27,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:27,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:27,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:27,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:27,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 11:48:27,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:48:27,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:48:27,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:48:27,848 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-01-24 11:48:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:28,040 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-01-24 11:48:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:48:28,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-24 11:48:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:28,041 INFO L225 Difference]: With dead ends: 127 [2018-01-24 11:48:28,041 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 11:48:28,041 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:48:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 11:48:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 11:48:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 11:48:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 11:48:28,051 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-01-24 11:48:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:28,051 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 11:48:28,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:48:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 11:48:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 11:48:28,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:28,052 INFO L322 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-01-24 11:48:28,052 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-01-24 11:48:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-01-24 11:48:28,053 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:28,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:28,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:28,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:28,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:28,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:28,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:48:28,330 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:48:28,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:28,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:48:28,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:48:28,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:28,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:28,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:48:28,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:28,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:28,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:48:28,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:28,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:28,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 11:48:28,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:48:28,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:48:28,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:28,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:28,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:48:28,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 11:48:28,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 11:48:28,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:48:28,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:28,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:28,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 11:48:28,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 11:48:33,630 WARN L146 SmtUtils]: Spent 2605ms on a formula simplification. DAG size of input: 54 DAG size of output 43 [2018-01-24 11:48:33,759 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-01-24 11:48:33,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-01-24 11:48:33,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:33,812 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 36 treesize of output 39 [2018-01-24 11:48:33,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:48:33,852 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 31 treesize of output 23 [2018-01-24 11:48:33,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:33,855 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 16 treesize of output 8 [2018-01-24 11:48:33,855 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:33,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-01-24 11:48:33,892 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:33,932 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-01-24 11:48:33,933 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-24 11:48:33,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-01-24 11:48:33,958 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:33,981 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 24 treesize of output 22 [2018-01-24 11:48:33,982 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-24 11:48:34,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 11:48:34,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:34,041 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:72, output treesize:29 [2018-01-24 11:48:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:34,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:48:34,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2018-01-24 11:48:34,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 11:48:34,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 11:48:34,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=681, Unknown=1, NotChecked=0, Total=756 [2018-01-24 11:48:34,137 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 28 states. [2018-01-24 11:48:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:37,893 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-01-24 11:48:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:48:37,893 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2018-01-24 11:48:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:37,894 INFO L225 Difference]: With dead ends: 82 [2018-01-24 11:48:37,894 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 11:48:37,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=204, Invalid=1355, Unknown=1, NotChecked=0, Total=1560 [2018-01-24 11:48:37,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 11:48:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-01-24 11:48:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 11:48:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-24 11:48:37,906 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-01-24 11:48:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:37,906 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-24 11:48:37,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 11:48:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-24 11:48:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 11:48:37,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:37,907 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:37,907 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-01-24 11:48:37,907 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-01-24 11:48:37,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:37,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:37,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:37,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:37,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:37,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:37,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:37,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:48:37,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:48:37,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:48:37,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:48:37,987 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-01-24 11:48:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:38,112 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-01-24 11:48:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:48:38,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-24 11:48:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:38,113 INFO L225 Difference]: With dead ends: 79 [2018-01-24 11:48:38,113 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 11:48:38,114 INFO L525 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-01-24 11:48:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 11:48:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 11:48:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 11:48:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-01-24 11:48:38,128 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-01-24 11:48:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:38,129 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-01-24 11:48:38,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:48:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-01-24 11:48:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 11:48:38,130 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:38,130 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:38,130 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-01-24 11:48:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-01-24 11:48:38,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:38,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:38,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:38,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:38,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:38,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:38,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:38,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:48:38,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:48:38,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:48:38,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:48:38,249 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-01-24 11:48:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:38,346 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-01-24 11:48:38,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:48:38,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-01-24 11:48:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:38,348 INFO L225 Difference]: With dead ends: 152 [2018-01-24 11:48:38,348 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 11:48:38,349 INFO L525 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-01-24 11:48:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 11:48:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-01-24 11:48:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 11:48:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-01-24 11:48:38,367 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-01-24 11:48:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:38,367 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-01-24 11:48:38,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:48:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-01-24 11:48:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:48:38,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:38,368 INFO L322 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-01-24 11:48:38,368 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-01-24 11:48:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-01-24 11:48:38,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:38,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:38,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:38,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:38,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:38,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:38,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:48:38,813 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:48:38,818 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:48:38,834 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:48:38,840 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:48:38,843 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:48:38,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:48:38,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:48:38,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:38,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:48:38,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:38,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:38,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:48:38,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:38,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:48:38,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:38,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:38,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:38,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:48:38,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:38,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:38,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 11:48:38,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:48:38,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:48:38,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:38,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:38,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:48:38,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 11:48:39,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 11:48:39,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:48:39,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:39,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:39,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 11:48:39,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-24 11:48:40,303 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-01-24 11:48:40,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 11:48:40,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:40,315 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-01-24 11:48:40,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:48:40,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:40,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:40,328 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 11:48:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:40,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:48:40,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-01-24 11:48:40,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 11:48:40,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 11:48:40,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-01-24 11:48:40,438 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 30 states. [2018-01-24 11:48:41,584 WARN L146 SmtUtils]: Spent 371ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-01-24 11:48:42,534 WARN L146 SmtUtils]: Spent 387ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-01-24 11:48:42,941 WARN L146 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 61 DAG size of output 47 [2018-01-24 11:48:43,505 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 68 DAG size of output 52 [2018-01-24 11:48:43,759 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-01-24 11:48:45,337 WARN L146 SmtUtils]: Spent 1530ms on a formula simplification. DAG size of input: 78 DAG size of output 58 [2018-01-24 11:48:45,788 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 54 DAG size of output 43 [2018-01-24 11:48:46,339 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 58 DAG size of output 47 [2018-01-24 11:48:46,673 WARN L146 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 68 DAG size of output 53 [2018-01-24 11:48:46,950 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 72 DAG size of output 57 [2018-01-24 11:48:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:49,530 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-24 11:48:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 11:48:49,530 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-01-24 11:48:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:49,531 INFO L225 Difference]: With dead ends: 113 [2018-01-24 11:48:49,531 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 11:48:49,532 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 11:48:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 11:48:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-01-24 11:48:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 11:48:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-24 11:48:49,541 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2018-01-24 11:48:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:49,542 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-24 11:48:49,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 11:48:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-24 11:48:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 11:48:49,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:49,543 INFO L322 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-01-24 11:48:49,543 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-01-24 11:48:49,543 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-01-24 11:48:49,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:49,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:49,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:49,544 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:48:49,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:49,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:49,759 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 21 DAG size of output 15 [2018-01-24 11:48:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:48:49,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:49,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 11:48:49,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:48:49,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:48:49,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:48:49,932 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 16 states. [2018-01-24 11:48:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:50,355 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-01-24 11:48:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:48:50,375 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-01-24 11:48:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:50,375 INFO L225 Difference]: With dead ends: 121 [2018-01-24 11:48:50,376 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 11:48:50,376 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:48:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 11:48:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2018-01-24 11:48:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 11:48:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2018-01-24 11:48:50,395 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 43 [2018-01-24 11:48:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:50,396 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2018-01-24 11:48:50,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:48:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2018-01-24 11:48:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 11:48:50,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:50,397 INFO L322 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-01-24 11:48:50,397 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-01-24 11:48:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-01-24 11:48:50,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:50,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:50,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:50,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:50,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:50,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:50,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:48:50,475 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:48:50,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:50,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:48:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:48:50,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:48:50,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-01-24 11:48:50,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:48:50,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:48:50,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:48:50,577 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 12 states. [2018-01-24 11:48:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:50,697 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-01-24 11:48:50,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:48:50,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-01-24 11:48:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:50,698 INFO L225 Difference]: With dead ends: 98 [2018-01-24 11:48:50,698 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 11:48:50,699 INFO L525 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-01-24 11:48:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 11:48:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-24 11:48:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 11:48:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2018-01-24 11:48:50,711 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 45 [2018-01-24 11:48:50,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:50,711 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2018-01-24 11:48:50,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:48:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2018-01-24 11:48:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 11:48:50,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:50,712 INFO L322 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-01-24 11:48:50,712 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-01-24 11:48:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-01-24 11:48:50,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:50,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:50,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:50,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:50,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:50,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:50,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:48:50,852 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:48:50,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:50,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:48:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:48:51,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:48:51,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-01-24 11:48:51,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 11:48:51,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 11:48:51,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:48:51,010 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 23 states. [2018-01-24 11:48:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:51,390 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2018-01-24 11:48:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:48:51,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-01-24 11:48:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:51,392 INFO L225 Difference]: With dead ends: 142 [2018-01-24 11:48:51,392 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 11:48:51,392 INFO L525 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-01-24 11:48:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 11:48:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-01-24 11:48:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 11:48:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2018-01-24 11:48:51,408 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 45 [2018-01-24 11:48:51,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:51,408 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2018-01-24 11:48:51,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 11:48:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-01-24 11:48:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 11:48:51,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:51,409 INFO L322 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-01-24 11:48:51,409 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-01-24 11:48:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-01-24 11:48:51,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:51,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:51,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:51,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:51,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:48:51,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:51,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:48:51,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:48:51,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:48:51,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:48:51,528 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 8 states. [2018-01-24 11:48:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:51,637 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2018-01-24 11:48:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:48:51,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-24 11:48:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:51,640 INFO L225 Difference]: With dead ends: 118 [2018-01-24 11:48:51,640 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 11:48:51,640 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:48:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 11:48:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-24 11:48:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 11:48:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2018-01-24 11:48:51,656 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 47 [2018-01-24 11:48:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:51,656 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2018-01-24 11:48:51,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:48:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-01-24 11:48:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 11:48:51,656 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:51,656 INFO L322 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-01-24 11:48:51,656 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-01-24 11:48:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-01-24 11:48:51,657 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:51,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:51,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:51,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:51,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:48:51,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:51,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:48:51,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:48:51,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:48:51,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:48:51,774 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand 5 states. [2018-01-24 11:48:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:51,930 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2018-01-24 11:48:51,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:48:51,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-24 11:48:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:51,931 INFO L225 Difference]: With dead ends: 121 [2018-01-24 11:48:51,932 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 11:48:51,932 INFO L525 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-01-24 11:48:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 11:48:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-01-24 11:48:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 11:48:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2018-01-24 11:48:51,943 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 47 [2018-01-24 11:48:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:51,943 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2018-01-24 11:48:51,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:48:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2018-01-24 11:48:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 11:48:51,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:51,944 INFO L322 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-01-24 11:48:51,944 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-01-24 11:48:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-01-24 11:48:51,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:51,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:51,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:51,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:51,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:52,181 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 23 DAG size of output 17 [2018-01-24 11:48:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:48:52,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:48:52,484 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:48:52,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:52,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:48:52,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:48:52,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:48:52,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:48:52,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:52,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:48:52,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:52,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:52,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:48:52,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 11:48:52,624 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-01-24 11:48:52,626 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-01-24 11:48:52,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 11:48:52,656 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-01-24 11:48:52,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:48:52,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:52,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 11:48:52,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-24 11:48:53,138 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-01-24 11:48:53,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-01-24 11:48:53,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:53,148 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-01-24 11:48:53,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:48:53,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:53,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:53,157 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-01-24 11:48:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:48:53,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:48:53,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2018-01-24 11:48:53,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 11:48:53,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 11:48:53,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-01-24 11:48:53,285 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 30 states. [2018-01-24 11:48:56,274 WARN L146 SmtUtils]: Spent 2099ms on a formula simplification. DAG size of input: 48 DAG size of output 32 [2018-01-24 11:48:56,654 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 63 DAG size of output 49 [2018-01-24 11:48:56,940 WARN L146 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 54 DAG size of output 40 [2018-01-24 11:48:57,500 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 61 DAG size of output 45 [2018-01-24 11:48:57,725 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 69 DAG size of output 51 [2018-01-24 11:48:57,985 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 73 DAG size of output 54 [2018-01-24 11:48:58,261 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 47 DAG size of output 36 [2018-01-24 11:49:00,887 WARN L146 SmtUtils]: Spent 256ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-01-24 11:49:01,471 WARN L146 SmtUtils]: Spent 429ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-01-24 11:49:03,722 WARN L146 SmtUtils]: Spent 2199ms on a formula simplification. DAG size of input: 63 DAG size of output 50 [2018-01-24 11:49:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:04,508 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-01-24 11:49:04,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 11:49:04,508 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-01-24 11:49:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:04,509 INFO L225 Difference]: With dead ends: 134 [2018-01-24 11:49:04,509 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 11:49:04,510 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 11:49:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 11:49:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 76. [2018-01-24 11:49:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 11:49:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-01-24 11:49:04,519 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 48 [2018-01-24 11:49:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:04,519 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-01-24 11:49:04,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 11:49:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-01-24 11:49:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 11:49:04,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:04,520 INFO L322 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-01-24 11:49:04,520 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-01-24 11:49:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-01-24 11:49:04,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:04,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:04,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:04,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:04,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 11:49:04,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:04,639 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:04,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:04,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:49:04,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:49:04,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 10 [2018-01-24 11:49:04,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:49:04,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:49:04,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:49:04,801 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 11 states. [2018-01-24 11:49:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:05,025 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-24 11:49:05,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:49:05,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-01-24 11:49:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:05,026 INFO L225 Difference]: With dead ends: 76 [2018-01-24 11:49:05,026 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 11:49:05,026 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:49:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 11:49:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-24 11:49:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 11:49:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-01-24 11:49:05,035 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 49 [2018-01-24 11:49:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:05,035 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-01-24 11:49:05,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:49:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-01-24 11:49:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 11:49:05,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:05,036 INFO L322 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-01-24 11:49:05,036 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-01-24 11:49:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-01-24 11:49:05,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:05,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:05,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:05,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:05,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:05,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:05,570 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:05,570 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:05,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:05,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:05,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:05,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-01-24 11:49:05,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 11:49:05,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 11:49:05,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-01-24 11:49:05,779 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 25 states. [2018-01-24 11:49:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:06,166 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-01-24 11:49:06,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 11:49:06,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-01-24 11:49:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:06,167 INFO L225 Difference]: With dead ends: 107 [2018-01-24 11:49:06,167 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 11:49:06,168 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 11:49:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 11:49:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-01-24 11:49:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 11:49:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-01-24 11:49:06,178 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 49 [2018-01-24 11:49:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:06,178 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-01-24 11:49:06,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 11:49:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-01-24 11:49:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 11:49:06,179 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:06,179 INFO L322 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-01-24 11:49:06,179 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 11:49:06,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-01-24 11:49:06,179 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:06,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:06,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:06,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:06,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:06,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:06,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:06,319 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:49:06,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:06,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:06,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:49:06,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:06,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:06,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:49:06,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:49:06,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:49:06,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:49:06,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:06,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:06,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 11:49:06,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:49:06,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:49:06,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:06,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:06,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:49:06,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 11:49:06,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 11:49:06,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:49:06,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:06,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:06,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 11:49:06,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-24 11:49:09,018 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 57 [2018-01-24 11:49:15,712 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-01-24 11:49:15,715 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-01-24 11:49:15,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:15,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:49:15,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-24 11:49:15,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:49:15,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:15,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:49:15,775 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:75, output treesize:51 [2018-01-24 11:49:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:15,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:15,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 34 [2018-01-24 11:49:15,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 11:49:15,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 11:49:15,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1033, Unknown=2, NotChecked=0, Total=1122 [2018-01-24 11:49:15,890 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 34 states. Received shutdown request... [2018-01-24 11:49:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 11:49:22,788 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 11:49:22,792 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 11:49:22,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:49:22 BoogieIcfgContainer [2018-01-24 11:49:22,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:49:22,793 INFO L168 Benchmark]: Toolchain (without parser) took 61999.50 ms. Allocated memory was 294.1 MB in the beginning and 604.5 MB in the end (delta: 310.4 MB). Free memory was 254.2 MB in the beginning and 511.2 MB in the end (delta: -257.0 MB). Peak memory consumption was 53.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:22,795 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 294.1 MB. Free memory is still 260.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:49:22,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.33 ms. Allocated memory is still 294.1 MB. Free memory was 253.2 MB in the beginning and 243.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:22,795 INFO L168 Benchmark]: Boogie Preprocessor took 34.40 ms. Allocated memory is still 294.1 MB. Free memory was 242.1 MB in the beginning and 241.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 11:49:22,796 INFO L168 Benchmark]: RCFGBuilder took 372.12 ms. Allocated memory is still 294.1 MB. Free memory was 241.1 MB in the beginning and 215.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:22,796 INFO L168 Benchmark]: TraceAbstraction took 61390.30 ms. Allocated memory was 294.1 MB in the beginning and 604.5 MB in the end (delta: 310.4 MB). Free memory was 214.5 MB in the beginning and 511.2 MB in the end (delta: -296.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:22,798 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 294.1 MB. Free memory is still 260.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.33 ms. Allocated memory is still 294.1 MB. Free memory was 253.2 MB in the beginning and 243.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.40 ms. Allocated memory is still 294.1 MB. Free memory was 242.1 MB in the beginning and 241.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 372.12 ms. Allocated memory is still 294.1 MB. Free memory was 241.1 MB in the beginning and 215.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61390.30 ms. Allocated memory was 294.1 MB in the beginning and 604.5 MB in the end (delta: 310.4 MB). Free memory was 214.5 MB in the beginning and 511.2 MB in the end (delta: -296.8 MB). Peak memory consumption was 13.6 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 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 33 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 61.3s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 36.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1827 SDtfs, 2053 SDslu, 10867 SDs, 0 SdLazy, 7173 SolverSat, 455 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 839 GetRequests, 324 SyntacticMatches, 15 SemanticMatches, 499 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 37.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, 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, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 244 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 1305 NumberOfCodeBlocks, 1305 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1268 ConstructedInterpolants, 121 QuantifiedInterpolants, 474343 SizeOfPredicates, 113 NumberOfNonLiveVariables, 1745 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 37 InterpolantComputations, 21 PerfectInterpolantSequences, 34/87 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-49-22-806.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-49-22-806.csv Completed graceful shutdown