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_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:43:24,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:43:24,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:43:24,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:43:24,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:43:24,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:43:24,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:43:24,204 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:43:24,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:43:24,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:43:24,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:43:24,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:43:24,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:43:24,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:43:24,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:43:24,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:43:24,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:43:24,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:43:24,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:43:24,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:43:24,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:43:24,226 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:43:24,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:43:24,227 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:43:24,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:43:24,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:43:24,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:43:24,230 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:43:24,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:43:24,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:43:24,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:43:24,232 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:43:24,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:43:24,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:43:24,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:43:24,242 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:43:24,242 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:43:24,243 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:43:24,243 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:43:24,243 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:43:24,243 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:43:24,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:43:24,244 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:43:24,244 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:43:24,244 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:43:24,244 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:43:24,244 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:43:24,244 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:43:24,244 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:43:24,245 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:43:24,245 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:43:24,245 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:43:24,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:43:24,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:43:24,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:43:24,246 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:43:24,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:43:24,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:43:24,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:43:24,246 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:43:24,247 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:43:24,247 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:43:24,247 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:43:24,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:43:24,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:43:24,247 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:43:24,247 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:43:24,248 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:43:24,248 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:43:24,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:43:24,294 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:43:24,297 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:43:24,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:43:24,299 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:43:24,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:43:24,466 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:43:24,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:43:24,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:43:24,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:43:24,479 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:43:24,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f741a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24, skipping insertion in model container [2018-01-25 02:43:24,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,499 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:43:24,539 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:43:24,671 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:43:24,691 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:43:24,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24 WrapperNode [2018-01-25 02:43:24,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:43:24,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:43:24,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:43:24,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:43:24,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (1/1) ... [2018-01-25 02:43:24,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:43:24,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:43:24,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:43:24,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:43:24,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (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-25 02:43:24,815 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:43:24,815 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:43:24,816 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-25 02:43:24,816 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:43:24,816 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:43:24,816 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:43:24,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:43:24,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:43:24,816 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:43:24,817 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:43:24,817 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-25 02:43:24,817 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:43:24,817 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:43:24,817 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:43:25,102 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:43:25,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:43:25 BoogieIcfgContainer [2018-01-25 02:43:25,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:43:25,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:43:25,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:43:25,106 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:43:25,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:43:24" (1/3) ... [2018-01-25 02:43:25,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f8e321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:43:25, skipping insertion in model container [2018-01-25 02:43:25,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:43:24" (2/3) ... [2018-01-25 02:43:25,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f8e321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:43:25, skipping insertion in model container [2018-01-25 02:43:25,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:43:25" (3/3) ... [2018-01-25 02:43:25,110 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:43:25,119 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:43:25,126 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 02:43:25,174 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:43:25,174 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:43:25,175 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:43:25,175 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:43:25,175 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:43:25,175 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:43:25,175 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:43:25,175 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:43:25,176 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:43:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-25 02:43:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:43:25,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:25,215 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:25,216 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:25,222 INFO L82 PathProgramCache]: Analyzing trace with hash -839073384, now seen corresponding path program 1 times [2018-01-25 02:43:25,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:25,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:25,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:25,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:25,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:25,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:25,504 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-25 02:43:25,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:25,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:43:25,508 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:25,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:43:25,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:43:25,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:43:25,590 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-01-25 02:43:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:25,683 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-25 02:43:25,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:43:25,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:43:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:25,697 INFO L225 Difference]: With dead ends: 70 [2018-01-25 02:43:25,698 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 02:43:25,702 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:43:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 02:43:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 02:43:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:43:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-25 02:43:25,745 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-01-25 02:43:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:25,746 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-25 02:43:25,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:43:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-25 02:43:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:43:25,747 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:25,747 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:25,747 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash -839073383, now seen corresponding path program 1 times [2018-01-25 02:43:25,748 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:25,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:25,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:25,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:25,749 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:25,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:25,945 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-25 02:43:25,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:25,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:43:25,946 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:25,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:43:25,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:43:25,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:43:25,949 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-25 02:43:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:26,063 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-25 02:43:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:43:26,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:43:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:26,066 INFO L225 Difference]: With dead ends: 41 [2018-01-25 02:43:26,066 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 02:43:26,067 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:43:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 02:43:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-25 02:43:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 02:43:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-25 02:43:26,074 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-01-25 02:43:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:26,074 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-25 02:43:26,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:43:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-25 02:43:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:43:26,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:26,076 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:26,076 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash -241471094, now seen corresponding path program 1 times [2018-01-25 02:43:26,076 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:26,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:26,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,078 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:26,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:26,127 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-25 02:43:26,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:26,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:43:26,127 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:26,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:43:26,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:43:26,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:43:26,128 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-01-25 02:43:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:26,219 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-25 02:43:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:43:26,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:43:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:26,220 INFO L225 Difference]: With dead ends: 40 [2018-01-25 02:43:26,220 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 02:43:26,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:43:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 02:43:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-25 02:43:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 02:43:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-25 02:43:26,227 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-01-25 02:43:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:26,227 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-25 02:43:26,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:43:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-25 02:43:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:43:26,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:26,228 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:26,228 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash -241471093, now seen corresponding path program 1 times [2018-01-25 02:43:26,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:26,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:26,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:26,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:26,315 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-25 02:43:26,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:26,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:43:26,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:26,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:43:26,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:43:26,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:43:26,316 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-25 02:43:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:26,363 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-25 02:43:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:43:26,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:43:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:26,364 INFO L225 Difference]: With dead ends: 39 [2018-01-25 02:43:26,365 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 02:43:26,365 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:43:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 02:43:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-25 02:43:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 02:43:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-25 02:43:26,369 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-25 02:43:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:26,370 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-25 02:43:26,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:43:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-25 02:43:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:43:26,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:26,370 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:26,370 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701620, now seen corresponding path program 1 times [2018-01-25 02:43:26,371 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:26,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:26,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,372 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:26,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:26,419 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-25 02:43:26,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:26,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:43:26,420 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:26,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:43:26,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:43:26,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:43:26,421 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-01-25 02:43:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:26,514 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-01-25 02:43:26,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:43:26,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 02:43:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:26,515 INFO L225 Difference]: With dead ends: 38 [2018-01-25 02:43:26,516 INFO L226 Difference]: Without dead ends: 37 [2018-01-25 02:43:26,516 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:43:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-25 02:43:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-25 02:43:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 02:43:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-25 02:43:26,522 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-01-25 02:43:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:26,523 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-25 02:43:26,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:43:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-25 02:43:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:43:26,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:26,524 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:26,524 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701619, now seen corresponding path program 1 times [2018-01-25 02:43:26,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:26,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:26,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,526 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:26,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:26,716 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-25 02:43:26,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:26,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:43:26,717 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:26,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:43:26,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:43:26,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:43:26,718 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-01-25 02:43:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:26,888 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-25 02:43:26,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:43:26,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 02:43:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:26,893 INFO L225 Difference]: With dead ends: 42 [2018-01-25 02:43:26,893 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 02:43:26,893 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:43:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 02:43:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-01-25 02:43:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 02:43:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-25 02:43:26,898 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-01-25 02:43:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:26,899 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-25 02:43:26,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:43:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-25 02:43:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:43:26,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:26,900 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:26,900 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash 929099078, now seen corresponding path program 1 times [2018-01-25 02:43:26,901 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:26,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:26,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:26,902 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:26,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:26,997 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-25 02:43:26,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:26,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:43:26,998 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:26,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:43:26,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:43:26,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:43:27,000 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-01-25 02:43:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:27,201 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-25 02:43:27,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:43:27,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-25 02:43:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:27,202 INFO L225 Difference]: With dead ends: 41 [2018-01-25 02:43:27,202 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 02:43:27,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:43:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 02:43:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-25 02:43:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 02:43:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-25 02:43:27,207 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-01-25 02:43:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:27,207 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-25 02:43:27,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:43:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-25 02:43:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:43:27,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:27,208 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:27,208 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:27,208 INFO L82 PathProgramCache]: Analyzing trace with hash 929099079, now seen corresponding path program 1 times [2018-01-25 02:43:27,208 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:27,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:27,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:27,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:27,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:27,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:27,354 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-25 02:43:27,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:27,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 02:43:27,355 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:27,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:43:27,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:43:27,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:43:27,355 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-01-25 02:43:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:27,474 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-25 02:43:27,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:43:27,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 02:43:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:27,475 INFO L225 Difference]: With dead ends: 44 [2018-01-25 02:43:27,475 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 02:43:27,476 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:43:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 02:43:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-01-25 02:43:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:43:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-25 02:43:27,482 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2018-01-25 02:43:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:27,482 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-25 02:43:27,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:43:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-25 02:43:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:43:27,483 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:27,483 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:27,483 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1211791035, now seen corresponding path program 1 times [2018-01-25 02:43:27,483 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:27,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:27,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:27,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:27,484 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:27,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:43:27,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:43:27,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:43:27,669 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:43:27,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 02:43:27,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 02:43:27,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:43:27,670 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-01-25 02:43:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:43:28,238 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-01-25 02:43:28,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 02:43:28,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-01-25 02:43:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:43:28,240 INFO L225 Difference]: With dead ends: 101 [2018-01-25 02:43:28,240 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 02:43:28,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-01-25 02:43:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 02:43:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-01-25 02:43:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 02:43:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-25 02:43:28,251 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-01-25 02:43:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:43:28,251 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-25 02:43:28,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 02:43:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-25 02:43:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:43:28,253 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:43:28,253 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:43:28,253 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:43:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash 394142585, now seen corresponding path program 1 times [2018-01-25 02:43:28,254 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:43:28,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:28,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:28,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:43:28,255 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:43:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:28,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:43:28,507 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-25 02:43:28,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:43:28,507 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:43:28,508 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 02:43:28,510 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [15], [19], [20], [22], [23], [27], [33], [44], [49], [55], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-25 02:43:28,569 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:43:28,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:44:07,925 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:44:07,927 INFO L268 AbstractInterpreter]: Visited 26 different actions 36 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-25 02:44:07,984 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:44:07,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:44:07,985 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 02:44:08,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:08,004 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:44:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:08,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:44:08,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 02:44:08,097 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-25 02:44:08,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:44:08,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:44:08,105 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-25 02:44:08,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:44:08,614 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 20 treesize of output 16 [2018-01-25 02:44:08,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-25 02:44:08,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:44:08,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:44:08,734 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-25 02:44:08,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-25 02:44:08,923 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-25 02:44:08,923 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:44:09,319 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 02:44:09,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,331 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 13 treesize of output 11 [2018-01-25 02:44:09,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:44:09,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,353 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 02:44:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:09,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:44:09,384 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:44:09,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:09,388 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:44:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:09,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:44:09,513 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-25 02:44:09,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 02:44:09,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:44:09,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:44:09,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:44:09,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 02:44:10,758 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-25 02:44:10,765 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-25 02:44:10,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:44:10,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:44:10,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:44:10,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-25 02:44:10,988 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-25 02:44:10,989 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:44:11,173 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 13 treesize of output 11 [2018-01-25 02:44:11,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-01-25 02:44:11,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:44:11,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:44:11,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:44:11,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 02:44:11,349 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-25 02:44:11,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:44:11,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 13, 13] total 46 [2018-01-25 02:44:11,351 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:44:11,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 02:44:11,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 02:44:11,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1980, Unknown=1, NotChecked=0, Total=2162 [2018-01-25 02:44:11,352 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-01-25 02:44:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:13,030 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-01-25 02:44:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 02:44:13,030 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-01-25 02:44:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:13,033 INFO L225 Difference]: With dead ends: 79 [2018-01-25 02:44:13,033 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 02:44:13,035 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=358, Invalid=3063, Unknown=1, NotChecked=0, Total=3422 [2018-01-25 02:44:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 02:44:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-01-25 02:44:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 02:44:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-25 02:44:13,052 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 27 [2018-01-25 02:44:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:13,053 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-25 02:44:13,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 02:44:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-25 02:44:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:44:13,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:13,054 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:13,054 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:13,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1089255981, now seen corresponding path program 1 times [2018-01-25 02:44:13,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:13,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:13,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:13,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:13,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:13,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:13,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:44:13,534 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:44:13,535 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 02:44:13,535 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [15], [19], [20], [23], [27], [31], [44], [49], [53], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-25 02:44:13,536 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:44:13,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:44:20,049 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:44:20,049 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:44:20,049 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:44:20,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:44:20,050 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 02:44:20,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:20,057 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:44:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:20,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:44:20,085 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:44:20,086 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:44:20,091 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:44:20,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:44:20 BoogieIcfgContainer [2018-01-25 02:44:20,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:44:20,093 INFO L168 Benchmark]: Toolchain (without parser) took 55625.66 ms. Allocated memory was 305.1 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 264.0 MB in the beginning and 407.9 MB in the end (delta: -143.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-25 02:44:20,094 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:44:20,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.28 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 254.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:44:20,094 INFO L168 Benchmark]: Boogie Preprocessor took 39.47 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 251.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:44:20,095 INFO L168 Benchmark]: RCFGBuilder took 361.73 ms. Allocated memory is still 305.1 MB. Free memory was 251.9 MB in the beginning and 233.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-25 02:44:20,096 INFO L168 Benchmark]: TraceAbstraction took 54987.87 ms. Allocated memory was 305.1 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 233.0 MB in the beginning and 407.9 MB in the end (delta: -175.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-25 02:44:20,098 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.18 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.28 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 254.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.47 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 251.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 361.73 ms. Allocated memory is still 305.1 MB. Free memory was 251.9 MB in the beginning and 233.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54987.87 ms. Allocated memory was 305.1 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 233.0 MB in the beginning and 407.9 MB in the end (delta: -175.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 330 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.405183 RENAME_VARIABLES(MILLISECONDS) : 0.307626 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.342853 PROJECTAWAY(MILLISECONDS) : 0.222117 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.063226 DISJOIN(MILLISECONDS) : 0.454625 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.345689 ADD_EQUALITY(MILLISECONDS) : 0.053572 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015555 #CONJOIN_DISJUNCTIVE : 65 #RENAME_VARIABLES : 106 #UNFREEZE : 0 #CONJOIN : 116 #PROJECTAWAY : 88 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 101 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. TIMEOUT Result, 54.9s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 324 SDtfs, 473 SDslu, 1077 SDs, 0 SdLazy, 796 SolverSat, 81 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 45.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 284 ConstructedInterpolants, 15 QuantifiedInterpolants, 49520 SizeOfPredicates, 30 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 2/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-44-20-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-44-20-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-44-20-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-44-20-113.csv Completed graceful shutdown