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_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:31:56,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:31:56,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:31:56,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:31:56,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:31:56,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:31:56,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:31:56,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:31:56,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:31:56,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:31:56,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:31:56,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:31:56,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:31:56,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:31:56,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:31:56,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:31:56,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:31:56,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:31:56,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:31:56,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:31:56,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:31:56,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:31:56,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:31:56,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:31:56,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:31:56,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:31:56,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:31:56,930 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:31:56,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:31:56,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:31:56,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:31:56,932 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_SS.epf [2018-01-31 08:31:56,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:31:56,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:31:56,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:31:56,944 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:31:56,944 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:31:56,944 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:31:56,945 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:31:56,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:31:56,945 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:31:56,946 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:31:56,946 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:31:56,946 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:31:56,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:31:56,947 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:31:56,947 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:31:56,947 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:31:56,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:31:56,948 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:31:56,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:31:56,948 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:31:56,948 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:31:56,948 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:31:56,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:31:56,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:31:56,949 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:31:56,949 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:31:56,949 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:31:56,950 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:31:56,950 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:31:56,950 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:31:56,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:31:56,950 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:31:56,951 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:31:56,951 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:31:56,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:31:57,007 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:31:57,014 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:31:57,016 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:31:57,016 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:31:57,017 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-31 08:31:57,270 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:31:57,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:31:57,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:31:57,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:31:57,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:31:57,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2903df66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57, skipping insertion in model container [2018-01-31 08:31:57,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,318 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:31:57,370 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:31:57,554 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:31:57,579 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:31:57,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57 WrapperNode [2018-01-31 08:31:57,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:31:57,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:31:57,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:31:57,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:31:57,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (1/1) ... [2018-01-31 08:31:57,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:31:57,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:31:57,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:31:57,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:31:57,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (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-31 08:31:57,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:31:57,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:31:57,730 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-31 08:31:57,730 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-31 08:31:57,731 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-01-31 08:31:57,731 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:31:57,731 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:31:57,731 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:31:57,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:31:57,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:31:57,732 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:31:57,732 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:31:57,732 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-31 08:31:57,732 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-31 08:31:57,732 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-01-31 08:31:57,732 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:31:57,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:31:57,733 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:31:58,625 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:31:58,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:31:58 BoogieIcfgContainer [2018-01-31 08:31:58,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:31:58,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:31:58,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:31:58,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:31:58,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:31:57" (1/3) ... [2018-01-31 08:31:58,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453bed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:31:58, skipping insertion in model container [2018-01-31 08:31:58,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:31:57" (2/3) ... [2018-01-31 08:31:58,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453bed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:31:58, skipping insertion in model container [2018-01-31 08:31:58,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:31:58" (3/3) ... [2018-01-31 08:31:58,637 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:31:58,646 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:31:58,655 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-31 08:31:58,717 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:31:58,717 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:31:58,718 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:31:58,718 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:31:58,718 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:31:58,718 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:31:58,718 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:31:58,719 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:31:58,719 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:31:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-01-31 08:31:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:31:58,756 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:31:58,760 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:31:58,760 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-31 08:31:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash 242841825, now seen corresponding path program 1 times [2018-01-31 08:31:58,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:31:58,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:31:58,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:31:58,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:31:58,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:31:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:31:58,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:31:59,102 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-31 08:31:59,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:31:59,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:31:59,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:31:59,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:31:59,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:31:59,227 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2018-01-31 08:31:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:31:59,612 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2018-01-31 08:31:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:31:59,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-31 08:31:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:31:59,624 INFO L225 Difference]: With dead ends: 243 [2018-01-31 08:31:59,624 INFO L226 Difference]: Without dead ends: 146 [2018-01-31 08:31:59,627 INFO L554 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-31 08:31:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-31 08:31:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-01-31 08:31:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-31 08:31:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-01-31 08:31:59,671 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 19 [2018-01-31 08:31:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:31:59,672 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-01-31 08:31:59,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:31:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-01-31 08:31:59,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:31:59,673 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:31:59,673 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:31:59,673 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-31 08:31:59,674 INFO L82 PathProgramCache]: Analyzing trace with hash 242841826, now seen corresponding path program 1 times [2018-01-31 08:31:59,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:31:59,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:31:59,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:31:59,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:31:59,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:31:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:31:59,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:31:59,902 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-31 08:31:59,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:31:59,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:31:59,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:31:59,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:31:59,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:31:59,906 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 6 states. [2018-01-31 08:32:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:00,127 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-31 08:32:00,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:32:00,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-31 08:32:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:00,131 INFO L225 Difference]: With dead ends: 146 [2018-01-31 08:32:00,131 INFO L226 Difference]: Without dead ends: 145 [2018-01-31 08:32:00,132 INFO L554 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-31 08:32:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-31 08:32:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-01-31 08:32:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-31 08:32:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-01-31 08:32:00,146 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 19 [2018-01-31 08:32:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:00,147 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-01-31 08:32:00,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:32:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-01-31 08:32:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:32:00,148 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:00,148 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:00,148 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-31 08:32:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1061837988, now seen corresponding path program 1 times [2018-01-31 08:32:00,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:00,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:00,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:00,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:00,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:00,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:00,268 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-31 08:32:00,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:00,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:32:00,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:32:00,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:32:00,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:32:00,270 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 4 states. [2018-01-31 08:32:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:00,465 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-01-31 08:32:00,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:32:00,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-31 08:32:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:00,467 INFO L225 Difference]: With dead ends: 145 [2018-01-31 08:32:00,467 INFO L226 Difference]: Without dead ends: 144 [2018-01-31 08:32:00,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:32:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-31 08:32:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-01-31 08:32:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-31 08:32:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-01-31 08:32:00,479 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 20 [2018-01-31 08:32:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:00,479 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-01-31 08:32:00,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:32:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-01-31 08:32:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:32:00,480 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:00,480 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:00,481 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-31 08:32:00,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1061837987, now seen corresponding path program 1 times [2018-01-31 08:32:00,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:00,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:00,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:00,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:00,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:00,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:00,642 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-31 08:32:00,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:00,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:32:00,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:32:00,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:32:00,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:32:00,643 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 5 states. [2018-01-31 08:32:00,935 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:32:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:00,955 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-01-31 08:32:00,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:32:00,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-31 08:32:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:00,958 INFO L225 Difference]: With dead ends: 144 [2018-01-31 08:32:00,958 INFO L226 Difference]: Without dead ends: 143 [2018-01-31 08:32:00,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:32:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-31 08:32:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-31 08:32:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-31 08:32:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-31 08:32:00,969 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 20 [2018-01-31 08:32:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:00,970 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-31 08:32:00,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:32:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-31 08:32:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:32:00,971 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:00,971 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:00,971 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-31 08:32:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -736909339, now seen corresponding path program 1 times [2018-01-31 08:32:00,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:00,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:00,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:00,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:00,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:00,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:01,052 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-31 08:32:01,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:01,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:32:01,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:32:01,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:32:01,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:32:01,054 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 6 states. [2018-01-31 08:32:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:01,454 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-01-31 08:32:01,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:32:01,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-31 08:32:01,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:01,456 INFO L225 Difference]: With dead ends: 143 [2018-01-31 08:32:01,456 INFO L226 Difference]: Without dead ends: 142 [2018-01-31 08:32:01,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:32:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-31 08:32:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-01-31 08:32:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-31 08:32:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-01-31 08:32:01,467 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 29 [2018-01-31 08:32:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:01,468 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-01-31 08:32:01,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:32:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-01-31 08:32:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:32:01,469 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:01,469 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:01,469 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-31 08:32:01,470 INFO L82 PathProgramCache]: Analyzing trace with hash -736909338, now seen corresponding path program 1 times [2018-01-31 08:32:01,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:01,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:01,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:01,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:01,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:01,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:01,678 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-31 08:32:01,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:01,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:32:01,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:32:01,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:32:01,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:32:01,679 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 9 states. [2018-01-31 08:32:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:01,942 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-01-31 08:32:01,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:32:01,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-31 08:32:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:01,944 INFO L225 Difference]: With dead ends: 142 [2018-01-31 08:32:01,944 INFO L226 Difference]: Without dead ends: 141 [2018-01-31 08:32:01,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:32:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-31 08:32:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-31 08:32:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-31 08:32:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-01-31 08:32:01,953 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 29 [2018-01-31 08:32:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:01,954 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-01-31 08:32:01,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:32:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-01-31 08:32:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:32:01,955 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:01,955 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:01,955 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-31 08:32:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash -312650031, now seen corresponding path program 1 times [2018-01-31 08:32:01,956 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:01,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:01,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:01,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:01,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:01,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:32:02,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:02,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:32:02,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:32:02,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:32:02,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:32:02,056 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 9 states. [2018-01-31 08:32:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:02,407 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-01-31 08:32:02,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:32:02,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-31 08:32:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:02,411 INFO L225 Difference]: With dead ends: 141 [2018-01-31 08:32:02,411 INFO L226 Difference]: Without dead ends: 140 [2018-01-31 08:32:02,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:32:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-31 08:32:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-31 08:32:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-31 08:32:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-01-31 08:32:02,430 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 39 [2018-01-31 08:32:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:02,430 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-01-31 08:32:02,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:32:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-01-31 08:32:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:32:02,432 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:02,432 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:02,433 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-31 08:32:02,434 INFO L82 PathProgramCache]: Analyzing trace with hash -312650030, now seen corresponding path program 1 times [2018-01-31 08:32:02,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:02,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:02,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:02,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:02,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:02,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:02,994 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-31 08:32:02,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:02,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-31 08:32:02,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:32:02,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:32:02,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:32:02,996 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 16 states. [2018-01-31 08:32:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:04,131 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-31 08:32:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:32:04,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-01-31 08:32:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:04,166 INFO L225 Difference]: With dead ends: 154 [2018-01-31 08:32:04,166 INFO L226 Difference]: Without dead ends: 153 [2018-01-31 08:32:04,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2018-01-31 08:32:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-31 08:32:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 142. [2018-01-31 08:32:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-31 08:32:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-01-31 08:32:04,175 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 39 [2018-01-31 08:32:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:04,175 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-01-31 08:32:04,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:32:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-01-31 08:32:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:32:04,177 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:04,177 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:04,177 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-31 08:32:04,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1428996634, now seen corresponding path program 1 times [2018-01-31 08:32:04,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:04,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:04,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:04,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:04,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:04,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:04,454 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 19 DAG size of output 10 [2018-01-31 08:32:04,516 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-31 08:32:04,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:04,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:32:04,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:32:04,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:32:04,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:32:04,517 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 6 states. [2018-01-31 08:32:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:04,892 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-01-31 08:32:04,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:32:04,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-31 08:32:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:04,894 INFO L225 Difference]: With dead ends: 142 [2018-01-31 08:32:04,894 INFO L226 Difference]: Without dead ends: 122 [2018-01-31 08:32:04,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:32:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-31 08:32:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-31 08:32:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-31 08:32:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-31 08:32:04,902 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 43 [2018-01-31 08:32:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:04,902 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-31 08:32:04,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:32:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-31 08:32:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 08:32:04,904 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:04,904 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:04,904 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-31 08:32:04,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1512512824, now seen corresponding path program 1 times [2018-01-31 08:32:04,905 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:04,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:04,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:04,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:04,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:04,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:05,595 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-31 08:32:05,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:32:05,595 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-31 08:32:05,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:05,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:32:05,697 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-31 08:32:05,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:05,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:05,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:32:05,749 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-31 08:32:05,760 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-31 08:32:05,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:05,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:05,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:05,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-31 08:32:06,131 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-31 08:32:06,216 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-31 08:32:06,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:32:06,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:32:06,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:32:06,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-31 08:32:06,417 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-31 08:32:06,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:32:06,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-01-31 08:32:06,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:32:06,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:32:06,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:32:06,439 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 28 states. [2018-01-31 08:32:06,599 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-31 08:32:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:08,253 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-01-31 08:32:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:32:08,254 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-01-31 08:32:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:08,256 INFO L225 Difference]: With dead ends: 130 [2018-01-31 08:32:08,256 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 08:32:08,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=230, Invalid=1662, Unknown=0, NotChecked=0, Total=1892 [2018-01-31 08:32:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 08:32:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2018-01-31 08:32:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-31 08:32:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-31 08:32:08,266 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 46 [2018-01-31 08:32:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:08,266 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-31 08:32:08,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:32:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-31 08:32:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:32:08,267 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:08,267 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:08,267 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-31 08:32:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1611768986, now seen corresponding path program 1 times [2018-01-31 08:32:08,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:08,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:08,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:08,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:08,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:08,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:08,523 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-31 08:32:08,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:08,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:32:08,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:32:08,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:32:08,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:32:08,524 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 6 states. [2018-01-31 08:32:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:08,586 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-01-31 08:32:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:32:08,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-01-31 08:32:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:08,587 INFO L225 Difference]: With dead ends: 119 [2018-01-31 08:32:08,587 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:32:08,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:32:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:32:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-31 08:32:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:32:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-31 08:32:08,595 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 51 [2018-01-31 08:32:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:08,596 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-31 08:32:08,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:32:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-31 08:32:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:32:08,597 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:08,597 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:08,597 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-31 08:32:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1611768987, now seen corresponding path program 1 times [2018-01-31 08:32:08,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:08,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:08,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:08,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:08,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:08,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:08,944 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-31 08:32:08,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:08,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:32:08,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:32:08,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:32:08,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:32:08,946 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 9 states. [2018-01-31 08:32:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:09,097 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-01-31 08:32:09,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:32:09,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-01-31 08:32:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:09,099 INFO L225 Difference]: With dead ends: 127 [2018-01-31 08:32:09,099 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 08:32:09,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:32:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 08:32:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-01-31 08:32:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-31 08:32:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-31 08:32:09,109 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 51 [2018-01-31 08:32:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:09,109 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-31 08:32:09,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:32:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-31 08:32:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:32:09,110 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:09,110 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:09,111 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-31 08:32:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1187964416, now seen corresponding path program 1 times [2018-01-31 08:32:09,111 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:09,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:09,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:09,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:09,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:09,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:32:09,598 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:32:09,598 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-31 08:32:09,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:09,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:32:09,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:32:09,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:09,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:09,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:32:09,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:32:09,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:32:09,932 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-31 08:32:09,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:09,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:09,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:32:10,013 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-31 08:32:10,014 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-31 08:32:10,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:10,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:10,021 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-31 08:32:10,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-31 08:32:10,106 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-31 08:32:10,119 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-31 08:32:10,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:10,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:10,131 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-31 08:32:10,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-31 08:32:16,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-31 08:32:16,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:32:16,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:32:16,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-31 08:32:16,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:16,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:32:16,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:32:16,921 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-31 08:32:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:32:17,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:32:17,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 28 [2018-01-31 08:32:17,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:32:17,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:32:17,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=735, Unknown=2, NotChecked=0, Total=812 [2018-01-31 08:32:17,066 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 29 states. [2018-01-31 08:32:17,416 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 33 DAG size of output 22 [2018-01-31 08:32:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:42,330 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2018-01-31 08:32:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:32:42,331 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-01-31 08:32:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:42,332 INFO L225 Difference]: With dead ends: 192 [2018-01-31 08:32:42,332 INFO L226 Difference]: Without dead ends: 191 [2018-01-31 08:32:42,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=253, Invalid=1636, Unknown=3, NotChecked=0, Total=1892 [2018-01-31 08:32:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-31 08:32:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2018-01-31 08:32:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-31 08:32:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions. [2018-01-31 08:32:42,347 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 60 [2018-01-31 08:32:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:42,348 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions. [2018-01-31 08:32:42,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:32:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions. [2018-01-31 08:32:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-31 08:32:42,349 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:42,349 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:32:42,349 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-31 08:32:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash -404256531, now seen corresponding path program 1 times [2018-01-31 08:32:42,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:42,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:42,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:42,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:42,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:42,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:42,570 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-31 08:32:42,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:42,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:32:42,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:32:42,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:32:42,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:32:42,608 INFO L87 Difference]: Start difference. First operand 178 states and 201 transitions. Second operand 8 states. [2018-01-31 08:32:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:42,874 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2018-01-31 08:32:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:32:42,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-31 08:32:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:42,876 INFO L225 Difference]: With dead ends: 188 [2018-01-31 08:32:42,876 INFO L226 Difference]: Without dead ends: 186 [2018-01-31 08:32:42,877 INFO L554 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-31 08:32:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-31 08:32:42,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-01-31 08:32:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-31 08:32:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-01-31 08:32:42,893 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 63 [2018-01-31 08:32:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:42,893 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-01-31 08:32:42,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:32:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2018-01-31 08:32:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-31 08:32:42,894 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:42,895 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:32:42,895 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-31 08:32:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash -404256530, now seen corresponding path program 1 times [2018-01-31 08:32:42,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:42,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:42,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:42,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:42,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:42,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:43,909 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-31 08:32:43,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:43,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:32:43,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:32:43,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:32:43,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:32:43,914 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand 8 states. [2018-01-31 08:32:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:44,393 INFO L93 Difference]: Finished difference Result 358 states and 407 transitions. [2018-01-31 08:32:44,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:32:44,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-31 08:32:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:44,397 INFO L225 Difference]: With dead ends: 358 [2018-01-31 08:32:44,397 INFO L226 Difference]: Without dead ends: 245 [2018-01-31 08:32:44,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:32:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-31 08:32:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 237. [2018-01-31 08:32:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-31 08:32:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2018-01-31 08:32:44,428 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 63 [2018-01-31 08:32:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:44,429 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2018-01-31 08:32:44,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:32:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2018-01-31 08:32:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-31 08:32:44,430 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:44,430 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:44,430 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-31 08:32:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash -543419676, now seen corresponding path program 1 times [2018-01-31 08:32:44,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:44,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:44,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:44,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:44,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:44,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:44,884 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-31 08:32:44,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:44,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-31 08:32:44,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:32:44,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:32:44,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:32:44,885 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand 17 states. [2018-01-31 08:32:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:45,937 INFO L93 Difference]: Finished difference Result 274 states and 293 transitions. [2018-01-31 08:32:45,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:32:45,937 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-01-31 08:32:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:45,939 INFO L225 Difference]: With dead ends: 274 [2018-01-31 08:32:45,939 INFO L226 Difference]: Without dead ends: 272 [2018-01-31 08:32:45,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:32:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-31 08:32:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 245. [2018-01-31 08:32:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-31 08:32:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 275 transitions. [2018-01-31 08:32:45,964 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 275 transitions. Word has length 70 [2018-01-31 08:32:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:45,965 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 275 transitions. [2018-01-31 08:32:45,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:32:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 275 transitions. [2018-01-31 08:32:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:32:45,966 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:45,966 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:45,966 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-31 08:32:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1419483589, now seen corresponding path program 2 times [2018-01-31 08:32:45,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:45,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:45,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:45,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:45,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:45,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:32:46,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:32:46,520 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-31 08:32:46,525 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:32:46,547 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:32:46,564 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:32:46,569 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:32:46,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:32:46,581 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-31 08:32:46,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,587 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-31 08:32:46,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:32:46,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:32:46,640 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-31 08:32:46,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:32:46,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:32:46,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-31 08:32:46,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 08:32:46,708 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-31 08:32:46,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-31 08:32:46,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,717 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-31 08:32:46,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-31 08:32:46,752 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-31 08:32:46,754 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-31 08:32:46,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:46,766 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-31 08:32:46,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-31 08:32:53,776 WARN L143 SmtUtils]: Spent 728ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:32:53,857 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 46 treesize of output 58 [2018-01-31 08:32:53,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 49 [2018-01-31 08:32:53,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:32:53,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-01-31 08:32:53,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:53,979 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 37 treesize of output 27 [2018-01-31 08:32:53,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:53,981 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 18 treesize of output 8 [2018-01-31 08:32:53,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:54,020 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 46 treesize of output 44 [2018-01-31 08:32:54,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-31 08:32:54,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-01-31 08:32:54,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:54,105 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-31 08:32:54,106 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-31 08:32:54,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-01-31 08:32:54,132 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:54,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-01-31 08:32:54,157 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-31 08:32:54,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-31 08:32:54,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:32:54,190 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:70, output treesize:37 [2018-01-31 08:32:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:32:54,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:32:54,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2018-01-31 08:32:54,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 08:32:54,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 08:32:54,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1091, Unknown=3, NotChecked=0, Total=1190 [2018-01-31 08:32:54,329 INFO L87 Difference]: Start difference. First operand 245 states and 275 transitions. Second operand 35 states. [2018-01-31 08:32:58,610 WARN L146 SmtUtils]: Spent 3471ms on a formula simplification. DAG size of input: 64 DAG size of output 48 [2018-01-31 08:33:01,249 WARN L146 SmtUtils]: Spent 2502ms on a formula simplification. DAG size of input: 79 DAG size of output 58 [2018-01-31 08:33:01,409 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 87 DAG size of output 59 [2018-01-31 08:33:04,314 WARN L146 SmtUtils]: Spent 2752ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-01-31 08:33:07,882 WARN L146 SmtUtils]: Spent 1407ms on a formula simplification. DAG size of input: 90 DAG size of output 66 [2018-01-31 08:33:10,292 WARN L146 SmtUtils]: Spent 2212ms on a formula simplification. DAG size of input: 82 DAG size of output 61 [2018-01-31 08:33:10,580 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 88 DAG size of output 58 [2018-01-31 08:33:10,814 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 92 DAG size of output 67 [2018-01-31 08:33:16,789 WARN L146 SmtUtils]: Spent 3811ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-01-31 08:33:21,060 WARN L146 SmtUtils]: Spent 4052ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-01-31 08:33:30,048 WARN L146 SmtUtils]: Spent 2889ms on a formula simplification. DAG size of input: 67 DAG size of output 56 [2018-01-31 08:33:34,144 WARN L146 SmtUtils]: Spent 4050ms on a formula simplification. DAG size of input: 77 DAG size of output 62 [2018-01-31 08:33:34,308 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 81 DAG size of output 66 [2018-01-31 08:33:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:36,300 INFO L93 Difference]: Finished difference Result 260 states and 281 transitions. [2018-01-31 08:33:36,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:33:36,300 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2018-01-31 08:33:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:36,301 INFO L225 Difference]: With dead ends: 260 [2018-01-31 08:33:36,301 INFO L226 Difference]: Without dead ends: 203 [2018-01-31 08:33:36,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=413, Invalid=2663, Unknown=4, NotChecked=0, Total=3080 [2018-01-31 08:33:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-31 08:33:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2018-01-31 08:33:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-31 08:33:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 209 transitions. [2018-01-31 08:33:36,323 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 209 transitions. Word has length 69 [2018-01-31 08:33:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:36,323 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 209 transitions. [2018-01-31 08:33:36,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 08:33:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 209 transitions. [2018-01-31 08:33:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:33:36,324 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:36,324 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:33:36,324 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-31 08:33:36,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1283803242, now seen corresponding path program 1 times [2018-01-31 08:33:36,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:36,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:36,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:36,326 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:33:36,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:36,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:36,638 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-31 08:33:36,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:33:36,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:33:36,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:33:36,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:33:36,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:33:36,639 INFO L87 Difference]: Start difference. First operand 183 states and 209 transitions. Second operand 9 states. [2018-01-31 08:33:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:36,769 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2018-01-31 08:33:36,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:33:36,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-01-31 08:33:36,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:36,772 INFO L225 Difference]: With dead ends: 183 [2018-01-31 08:33:36,772 INFO L226 Difference]: Without dead ends: 182 [2018-01-31 08:33:36,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:33:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-31 08:33:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-31 08:33:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-31 08:33:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2018-01-31 08:33:36,787 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 73 [2018-01-31 08:33:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:36,787 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2018-01-31 08:33:36,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:33:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2018-01-31 08:33:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:33:36,787 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:36,788 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:33:36,788 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-31 08:33:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1283803241, now seen corresponding path program 1 times [2018-01-31 08:33:36,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:36,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:36,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:36,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:36,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:36,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:37,138 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-31 08:33:37,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:33:37,139 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-31 08:33:37,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:37,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:33:37,437 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-31 08:33:37,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:33:37,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 18 [2018-01-31 08:33:37,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:33:37,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:33:37,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:33:37,478 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand 19 states. [2018-01-31 08:33:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:33:38,108 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-01-31 08:33:38,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:33:38,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-01-31 08:33:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:33:38,110 INFO L225 Difference]: With dead ends: 204 [2018-01-31 08:33:38,110 INFO L226 Difference]: Without dead ends: 203 [2018-01-31 08:33:38,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:33:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-31 08:33:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2018-01-31 08:33:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:33:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2018-01-31 08:33:38,129 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 73 [2018-01-31 08:33:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:33:38,129 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2018-01-31 08:33:38,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:33:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2018-01-31 08:33:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:33:38,130 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:33:38,130 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:33:38,131 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-31 08:33:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2019894685, now seen corresponding path program 1 times [2018-01-31 08:33:38,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:33:38,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:33:38,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:38,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:33:38,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:33:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:38,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:33:38,610 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 23 DAG size of output 17 [2018-01-31 08:33:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:33:38,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:33:38,959 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) [2018-01-31 08:33:38,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:33:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:33:39,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:33:39,013 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-31 08:33:39,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,019 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-31 08:33:39,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:33:39,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:33:39,077 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-31 08:33:39,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:33:39,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:33:39,090 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-31 08:33:39,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 08:33:39,150 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-31 08:33:39,152 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-31 08:33:39,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-31 08:33:39,220 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-31 08:33:39,222 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-31 08:33:39,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:33:39,230 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-31 08:33:39,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-31 08:33:41,439 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-31 08:33:41,441 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-31 08:33:41,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:33:41,451 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-31 08:33:41,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:33:41,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:33:41,461 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-31 08:33:41,461 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-01-31 08:33:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:33:41,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:33:41,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 33 [2018-01-31 08:33:41,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-31 08:33:41,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-31 08:33:41,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:33:41,616 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand 34 states. [2018-01-31 08:33:42,198 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 48 DAG size of output 32 [2018-01-31 08:33:48,382 WARN L146 SmtUtils]: Spent 6076ms on a formula simplification. DAG size of input: 65 DAG size of output 40 [2018-01-31 08:33:52,111 WARN L146 SmtUtils]: Spent 1969ms on a formula simplification. DAG size of input: 58 DAG size of output 52 [2018-01-31 08:33:56,614 WARN L146 SmtUtils]: Spent 2659ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-01-31 08:33:59,417 WARN L146 SmtUtils]: Spent 2770ms on a formula simplification. DAG size of input: 59 DAG size of output 48 [2018-01-31 08:34:03,171 WARN L146 SmtUtils]: Spent 3722ms on a formula simplification. DAG size of input: 67 DAG size of output 54 [2018-01-31 08:34:06,834 WARN L146 SmtUtils]: Spent 3631ms on a formula simplification. DAG size of input: 71 DAG size of output 57 [2018-01-31 08:34:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:34:11,266 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-01-31 08:34:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:34:11,267 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 79 [2018-01-31 08:34:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:34:11,268 INFO L225 Difference]: With dead ends: 226 [2018-01-31 08:34:11,268 INFO L226 Difference]: Without dead ends: 224 [2018-01-31 08:34:11,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=353, Invalid=2727, Unknown=0, NotChecked=0, Total=3080 [2018-01-31 08:34:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-31 08:34:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 128. [2018-01-31 08:34:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-31 08:34:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-31 08:34:11,286 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 79 [2018-01-31 08:34:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:34:11,286 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-31 08:34:11,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-31 08:34:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-31 08:34:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:34:11,287 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:34:11,288 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:34:11,288 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-31 08:34:11,288 INFO L82 PathProgramCache]: Analyzing trace with hash 74819260, now seen corresponding path program 1 times [2018-01-31 08:34:11,288 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:34:11,288 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:34:11,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:11,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:11,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:11,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:34:11,391 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-31 08:34:11,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:34:11,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:34:11,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:34:11,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:34:11,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:34:11,392 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 9 states. [2018-01-31 08:34:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:34:11,532 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-31 08:34:11,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:34:11,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-31 08:34:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:34:11,533 INFO L225 Difference]: With dead ends: 128 [2018-01-31 08:34:11,534 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 08:34:11,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:34:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 08:34:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-31 08:34:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-31 08:34:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-31 08:34:11,548 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 80 [2018-01-31 08:34:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:34:11,548 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-31 08:34:11,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:34:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-31 08:34:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:34:11,550 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:34:11,550 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:34:11,550 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-31 08:34:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash 74819261, now seen corresponding path program 1 times [2018-01-31 08:34:11,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:34:11,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:34:11,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:11,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:11,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:11,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:34:11,750 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-31 08:34:11,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:34:11,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-31 08:34:11,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:34:11,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:34:11,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:34:11,752 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 13 states. [2018-01-31 08:34:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:34:11,994 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2018-01-31 08:34:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:34:11,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-01-31 08:34:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:34:11,997 INFO L225 Difference]: With dead ends: 203 [2018-01-31 08:34:11,997 INFO L226 Difference]: Without dead ends: 201 [2018-01-31 08:34:11,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:34:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-31 08:34:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-01-31 08:34:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-31 08:34:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 201 transitions. [2018-01-31 08:34:12,016 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 201 transitions. Word has length 80 [2018-01-31 08:34:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:34:12,017 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 201 transitions. [2018-01-31 08:34:12,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:34:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 201 transitions. [2018-01-31 08:34:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:34:12,018 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:34:12,018 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:34:12,018 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-31 08:34:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1584254756, now seen corresponding path program 1 times [2018-01-31 08:34:12,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:34:12,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:34:12,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:12,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:12,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:12,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:34:12,221 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-31 08:34:12,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:34:12,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:34:12,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:34:12,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:34:12,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:34:12,221 INFO L87 Difference]: Start difference. First operand 183 states and 201 transitions. Second operand 10 states. [2018-01-31 08:34:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:34:12,368 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2018-01-31 08:34:12,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:34:12,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2018-01-31 08:34:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:34:12,369 INFO L225 Difference]: With dead ends: 183 [2018-01-31 08:34:12,369 INFO L226 Difference]: Without dead ends: 182 [2018-01-31 08:34:12,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:34:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-31 08:34:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-31 08:34:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-31 08:34:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 199 transitions. [2018-01-31 08:34:12,389 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 199 transitions. Word has length 81 [2018-01-31 08:34:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:34:12,390 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 199 transitions. [2018-01-31 08:34:12,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:34:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 199 transitions. [2018-01-31 08:34:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:34:12,391 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:34:12,391 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:34:12,391 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-31 08:34:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1584254755, now seen corresponding path program 1 times [2018-01-31 08:34:12,391 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:34:12,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:34:12,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:12,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:12,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:12,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:34:13,013 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-31 08:34:13,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:34:13,013 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-31 08:34:13,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:13,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:34:13,108 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-31 08:34:13,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:34:13,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 20 [2018-01-31 08:34:13,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:34:13,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:34:13,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:34:13,129 INFO L87 Difference]: Start difference. First operand 182 states and 199 transitions. Second operand 21 states. [2018-01-31 08:34:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:34:13,626 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2018-01-31 08:34:13,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:34:13,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-01-31 08:34:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:34:13,628 INFO L225 Difference]: With dead ends: 260 [2018-01-31 08:34:13,628 INFO L226 Difference]: Without dead ends: 259 [2018-01-31 08:34:13,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:34:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-31 08:34:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 193. [2018-01-31 08:34:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-31 08:34:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2018-01-31 08:34:13,642 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 81 [2018-01-31 08:34:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:34:13,643 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2018-01-31 08:34:13,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:34:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2018-01-31 08:34:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-31 08:34:13,644 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:34:13,644 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:34:13,645 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-31 08:34:13,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1252384409, now seen corresponding path program 1 times [2018-01-31 08:34:13,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:34:13,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:34:13,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:13,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:13,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:13,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:34:13,811 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-31 08:34:13,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:34:13,812 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-31 08:34:13,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:13,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:34:13,865 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-31 08:34:13,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:34:13,876 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-31 08:34:13,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:34:13,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:34:13,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:34:13,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:34:13,970 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-31 08:34:13,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:34:14,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:34:14,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:34:14,024 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-31 08:34:14,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:34:14,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:34:14,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 08:34:14,063 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-31 08:34:14,064 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-31 08:34:14,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:34:14,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:34:14,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:34:14,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-31 08:34:14,091 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-31 08:34:14,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-31 08:34:14,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:34:14,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:34:14,101 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-31 08:34:14,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-31 08:34:16,412 WARN L146 SmtUtils]: Spent 991ms on a formula simplification. DAG size of input: 42 DAG size of output 25 [2018-01-31 08:34:17,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-31 08:34:17,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-31 08:34:17,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:34:17,607 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-31 08:34:17,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:34:17,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:34:17,629 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-31 08:34:17,629 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2018-01-31 08:34:17,820 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-31 08:34:17,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:34:17,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 38 [2018-01-31 08:34:17,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-31 08:34:17,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-31 08:34:17,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1309, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 08:34:17,841 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 38 states. [2018-01-31 08:34:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:34:24,039 INFO L93 Difference]: Finished difference Result 532 states and 587 transitions. [2018-01-31 08:34:24,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-31 08:34:24,040 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 89 [2018-01-31 08:34:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:34:24,042 INFO L225 Difference]: With dead ends: 532 [2018-01-31 08:34:24,042 INFO L226 Difference]: Without dead ends: 303 [2018-01-31 08:34:24,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1949 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=706, Invalid=8606, Unknown=0, NotChecked=0, Total=9312 [2018-01-31 08:34:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-31 08:34:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 238. [2018-01-31 08:34:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-31 08:34:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 262 transitions. [2018-01-31 08:34:24,081 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 262 transitions. Word has length 89 [2018-01-31 08:34:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:34:24,082 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 262 transitions. [2018-01-31 08:34:24,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-31 08:34:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 262 transitions. [2018-01-31 08:34:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-31 08:34:24,082 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:34:24,083 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:34:24,083 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-31 08:34:24,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1176926206, now seen corresponding path program 1 times [2018-01-31 08:34:24,083 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:34:24,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:34:24,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:24,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:24,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:24,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:34:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:34:24,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:34:24,877 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-31 08:34:24,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:24,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:34:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:34:25,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:34:25,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-01-31 08:34:25,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:34:25,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:34:25,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:34:25,430 INFO L87 Difference]: Start difference. First operand 238 states and 262 transitions. Second operand 24 states. [2018-01-31 08:34:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:34:26,047 INFO L93 Difference]: Finished difference Result 279 states and 304 transitions. [2018-01-31 08:34:26,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:34:26,047 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2018-01-31 08:34:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:34:26,049 INFO L225 Difference]: With dead ends: 279 [2018-01-31 08:34:26,049 INFO L226 Difference]: Without dead ends: 278 [2018-01-31 08:34:26,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:34:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-01-31 08:34:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 241. [2018-01-31 08:34:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-31 08:34:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 264 transitions. [2018-01-31 08:34:26,072 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 264 transitions. Word has length 99 [2018-01-31 08:34:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:34:26,073 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 264 transitions. [2018-01-31 08:34:26,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:34:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 264 transitions. [2018-01-31 08:34:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-31 08:34:26,074 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:34:26,074 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:34:26,074 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-31 08:34:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1409718852, now seen corresponding path program 1 times [2018-01-31 08:34:26,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:34:26,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:34:26,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:26,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:26,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:26,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:34:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:34:26,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:34:26,767 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-31 08:34:26,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:26,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:34:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:34:26,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:34:26,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 23 [2018-01-31 08:34:26,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:34:26,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:34:26,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:34:26,875 INFO L87 Difference]: Start difference. First operand 241 states and 264 transitions. Second operand 24 states. [2018-01-31 08:34:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:34:27,561 INFO L93 Difference]: Finished difference Result 339 states and 369 transitions. [2018-01-31 08:34:27,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:34:27,562 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-01-31 08:34:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:34:27,563 INFO L225 Difference]: With dead ends: 339 [2018-01-31 08:34:27,563 INFO L226 Difference]: Without dead ends: 338 [2018-01-31 08:34:27,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=1644, Unknown=0, NotChecked=0, Total=1806 [2018-01-31 08:34:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-01-31 08:34:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 238. [2018-01-31 08:34:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-31 08:34:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 262 transitions. [2018-01-31 08:34:27,585 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 262 transitions. Word has length 107 [2018-01-31 08:34:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:34:27,586 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 262 transitions. [2018-01-31 08:34:27,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:34:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 262 transitions. [2018-01-31 08:34:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-31 08:34:27,586 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:34:27,587 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:34:27,587 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-31 08:34:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1826501582, now seen corresponding path program 2 times [2018-01-31 08:34:27,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:34:27,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:34:27,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:27,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:34:27,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:34:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:34:27,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-31 08:34:28,391 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:34:28,397 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:34:28,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:34:28 BoogieIcfgContainer [2018-01-31 08:34:28,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:34:28,399 INFO L168 Benchmark]: Toolchain (without parser) took 151127.72 ms. Allocated memory was 300.4 MB in the beginning and 568.3 MB in the end (delta: 267.9 MB). Free memory was 260.1 MB in the beginning and 513.0 MB in the end (delta: -252.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:34:28,401 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 300.4 MB. Free memory is still 266.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:34:28,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.73 ms. Allocated memory is still 300.4 MB. Free memory was 259.1 MB in the beginning and 248.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:34:28,401 INFO L168 Benchmark]: Boogie Preprocessor took 54.00 ms. Allocated memory is still 300.4 MB. Free memory was 248.1 MB in the beginning and 246.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:34:28,401 INFO L168 Benchmark]: RCFGBuilder took 973.44 ms. Allocated memory is still 300.4 MB. Free memory was 246.2 MB in the beginning and 215.0 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:34:28,402 INFO L168 Benchmark]: TraceAbstraction took 149770.90 ms. Allocated memory was 300.4 MB in the beginning and 568.3 MB in the end (delta: 267.9 MB). Free memory was 215.0 MB in the beginning and 513.0 MB in the end (delta: -298.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:34:28,403 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 300.4 MB. Free memory is still 266.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 315.73 ms. Allocated memory is still 300.4 MB. Free memory was 259.1 MB in the beginning and 248.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.00 ms. Allocated memory is still 300.4 MB. Free memory was 248.1 MB in the beginning and 246.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 973.44 ms. Allocated memory is still 300.4 MB. Free memory was 246.2 MB in the beginning and 215.0 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 149770.90 ms. Allocated memory was 300.4 MB in the beginning and 568.3 MB in the end (delta: 267.9 MB). Free memory was 215.0 MB in the beginning and 513.0 MB in the end (delta: -298.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 150 locations, 21 error locations. TIMEOUT Result, 149.6s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 113.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3320 SDtfs, 4371 SDslu, 28742 SDs, 0 SdLazy, 11267 SolverSat, 476 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 48.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1267 GetRequests, 632 SyntacticMatches, 15 SemanticMatches, 620 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4639 ImplicationChecksByTransitivity, 92.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 497 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 2275 NumberOfCodeBlocks, 2275 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2239 ConstructedInterpolants, 173 QuantifiedInterpolants, 1479938 SizeOfPredicates, 172 NumberOfNonLiveVariables, 2087 ConjunctsInSsa, 426 ConjunctsInUnsatCore, 36 InterpolantComputations, 18 PerfectInterpolantSequences, 83/181 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-34-28-417.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_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-34-28-417.csv Completed graceful shutdown