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_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:22:11,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:22:11,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:22:11,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:22:11,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:22:11,561 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:22:11,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:22:11,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:22:11,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:22:11,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:22:11,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:22:11,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:22:11,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:22:11,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:22:11,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:22:11,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:22:11,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:22:11,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:22:11,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:22:11,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:22:11,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:22:11,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:22:11,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:22:11,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:22:11,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:22:11,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:22:11,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:22:11,588 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:22:11,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:22:11,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:22:11,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:22:11,589 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_precise.epf [2018-01-24 23:22:11,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:22:11,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:22:11,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:22:11,600 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:22:11,601 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:22:11,601 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:22:11,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:22:11,601 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:22:11,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:22:11,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:22:11,602 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:22:11,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:22:11,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:22:11,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:22:11,603 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:22:11,603 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:22:11,603 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:22:11,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:22:11,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:22:11,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:22:11,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:22:11,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:22:11,604 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:22:11,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:22:11,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:22:11,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:22:11,605 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:22:11,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:22:11,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:22:11,606 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:22:11,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:22:11,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:22:11,606 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:22:11,606 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:22:11,607 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:22:11,608 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:22:11,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:22:11,659 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:22:11,663 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:22:11,665 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:22:11,665 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:22:11,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:22:11,854 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:22:11,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:22:11,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:22:11,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:22:11,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:22:11,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:22:11" (1/1) ... [2018-01-24 23:22:11,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0999f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:11, skipping insertion in model container [2018-01-24 23:22:11,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:22:11" (1/1) ... [2018-01-24 23:22:11,883 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:22:11,923 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:22:12,044 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:22:12,060 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:22:12,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12 WrapperNode [2018-01-24 23:22:12,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:22:12,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:22:12,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:22:12,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:22:12,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (1/1) ... [2018-01-24 23:22:12,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (1/1) ... [2018-01-24 23:22:12,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (1/1) ... [2018-01-24 23:22:12,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (1/1) ... [2018-01-24 23:22:12,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (1/1) ... [2018-01-24 23:22:12,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (1/1) ... [2018-01-24 23:22:12,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (1/1) ... [2018-01-24 23:22:12,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:22:12,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:22:12,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:22:12,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:22:12,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:22:12,155 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:22:12,155 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:22:12,155 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-24 23:22:12,155 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:22:12,155 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:22:12,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:22:12,372 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:22:12,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:22:12 BoogieIcfgContainer [2018-01-24 23:22:12,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:22:12,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:22:12,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:22:12,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:22:12,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:22:11" (1/3) ... [2018-01-24 23:22:12,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d640ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:22:12, skipping insertion in model container [2018-01-24 23:22:12,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:22:12" (2/3) ... [2018-01-24 23:22:12,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d640ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:22:12, skipping insertion in model container [2018-01-24 23:22:12,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:22:12" (3/3) ... [2018-01-24 23:22:12,382 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:22:12,388 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:22:12,394 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 23:22:12,437 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:22:12,437 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:22:12,437 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:22:12,437 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:22:12,437 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:22:12,438 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:22:12,438 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:22:12,438 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:22:12,439 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:22:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-24 23:22:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:22:12,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:12,467 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:22:12,467 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510132, now seen corresponding path program 1 times [2018-01-24 23:22:12,475 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:12,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:12,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:12,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:12,518 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:12,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:12,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:22:12,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:22:12,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:22:12,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:22:12,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:22:12,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:22:12,798 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-01-24 23:22:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:22:12,942 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-01-24 23:22:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:22:12,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 23:22:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:22:12,952 INFO L225 Difference]: With dead ends: 58 [2018-01-24 23:22:12,952 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 23:22:12,956 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:22:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 23:22:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 23:22:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 23:22:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 23:22:12,990 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-01-24 23:22:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:22:12,990 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 23:22:12,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:22:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 23:22:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:22:12,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:12,991 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:22:12,991 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510131, now seen corresponding path program 1 times [2018-01-24 23:22:12,992 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:12,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:12,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:12,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:12,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:13,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:13,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:22:13,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:22:13,125 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:22:13,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:22:13,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:22:13,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:22:13,127 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-24 23:22:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:22:13,223 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 23:22:13,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:22:13,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 23:22:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:22:13,225 INFO L225 Difference]: With dead ends: 41 [2018-01-24 23:22:13,225 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 23:22:13,226 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:22:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 23:22:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 23:22:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 23:22:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 23:22:13,233 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-01-24 23:22:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:22:13,233 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 23:22:13,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:22:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 23:22:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:22:13,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:13,234 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:22:13,234 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:13,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695343, now seen corresponding path program 1 times [2018-01-24 23:22:13,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:13,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:13,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:13,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:13,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:22:13,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:22:13,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:22:13,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:22:13,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:22:13,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:22:13,276 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-01-24 23:22:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:22:13,338 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-24 23:22:13,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:22:13,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:22:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:22:13,340 INFO L225 Difference]: With dead ends: 40 [2018-01-24 23:22:13,340 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 23:22:13,341 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:22:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 23:22:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 23:22:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 23:22:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 23:22:13,346 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-01-24 23:22:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:22:13,347 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 23:22:13,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:22:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 23:22:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:22:13,348 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:13,348 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:22:13,348 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:13,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695344, now seen corresponding path program 1 times [2018-01-24 23:22:13,349 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:13,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:13,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,350 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:13,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:13,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:22:13,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:22:13,453 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:22:13,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:22:13,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:22:13,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:22:13,453 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-24 23:22:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:22:13,523 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 23:22:13,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:22:13,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:22:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:22:13,524 INFO L225 Difference]: With dead ends: 39 [2018-01-24 23:22:13,524 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 23:22:13,525 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:22:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 23:22:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 23:22:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 23:22:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 23:22:13,529 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-24 23:22:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:22:13,529 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 23:22:13,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:22:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 23:22:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:22:13,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:13,530 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:22:13,530 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash -559562515, now seen corresponding path program 1 times [2018-01-24 23:22:13,530 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:13,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:13,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,531 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:13,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:13,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:22:13,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:22:13,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:22:13,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:22:13,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:22:13,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:22:13,590 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-01-24 23:22:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:22:13,681 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-01-24 23:22:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:22:13,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 23:22:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:22:13,682 INFO L225 Difference]: With dead ends: 38 [2018-01-24 23:22:13,683 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 23:22:13,683 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:22:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 23:22:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 23:22:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 23:22:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-24 23:22:13,690 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-01-24 23:22:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:22:13,690 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-24 23:22:13,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:22:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-24 23:22:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:22:13,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:13,692 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:22:13,692 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash -559562514, now seen corresponding path program 1 times [2018-01-24 23:22:13,692 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:13,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:13,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,694 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:13,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:13,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:22:13,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:22:13,822 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:22:13,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:22:13,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:22:13,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:22:13,823 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-01-24 23:22:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:22:13,960 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 23:22:13,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:22:13,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-24 23:22:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:22:13,961 INFO L225 Difference]: With dead ends: 41 [2018-01-24 23:22:13,961 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 23:22:13,962 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-24 23:22:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 23:22:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 23:22:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 23:22:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 23:22:13,968 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-01-24 23:22:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:22:13,969 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 23:22:13,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:22:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 23:22:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 23:22:13,969 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:13,969 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] [2018-01-24 23:22:13,970 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796544, now seen corresponding path program 1 times [2018-01-24 23:22:13,970 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:13,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:13,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:13,971 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:13,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:14,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:22:14,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:22:14,060 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:22:14,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:22:14,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:22:14,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:22:14,061 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2018-01-24 23:22:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:22:14,153 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-24 23:22:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:22:14,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-24 23:22:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:22:14,154 INFO L225 Difference]: With dead ends: 40 [2018-01-24 23:22:14,154 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 23:22:14,155 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-24 23:22:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 23:22:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-01-24 23:22:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 23:22:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 23:22:14,160 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2018-01-24 23:22:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:22:14,161 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 23:22:14,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:22:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 23:22:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 23:22:14,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:14,162 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] [2018-01-24 23:22:14,162 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796543, now seen corresponding path program 1 times [2018-01-24 23:22:14,163 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:14,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:14,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:14,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:14,164 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:14,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:14,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:22:14,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 23:22:14,316 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:22:14,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 23:22:14,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 23:22:14,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:22:14,318 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-01-24 23:22:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:22:14,426 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-24 23:22:14,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:22:14,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-01-24 23:22:14,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:22:14,427 INFO L225 Difference]: With dead ends: 43 [2018-01-24 23:22:14,427 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 23:22:14,427 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-24 23:22:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 23:22:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-01-24 23:22:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 23:22:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 23:22:14,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2018-01-24 23:22:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:22:14,432 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 23:22:14,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 23:22:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 23:22:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:22:14,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:22:14,433 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] [2018-01-24 23:22:14,433 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 23:22:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1264210553, now seen corresponding path program 1 times [2018-01-24 23:22:14,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:22:14,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:14,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:14,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:22:14,434 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:22:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:14,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:22:14,788 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 33 DAG size of output 21 [2018-01-24 23:22:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:22:15,144 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:22:15,144 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:22:15,145 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 23:22:15,147 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [38], [39], [41], [42], [46], [47], [50], [55], [58], [67], [68], [69], [71] [2018-01-24 23:22:15,191 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:22:15,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:23:05,554 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:23:05,556 INFO L268 AbstractInterpreter]: Visited 25 different actions 34 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 23:23:05,569 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:23:05,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:23:05,569 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-24 23:23:05,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:23:05,589 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:23:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:23:05,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:23:05,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:23:05,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:23:05,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:05,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 23:23:06,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:23:06,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:23:06,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 23:23:06,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 23:23:06,455 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 11 treesize of output 8 [2018-01-24 23:23:06,469 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 8 treesize of output 7 [2018-01-24 23:23:06,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-24 23:23:06,624 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 22 treesize of output 23 [2018-01-24 23:23:06,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 23:23:06,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 23:23:06,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-24 23:23:06,974 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 25 treesize of output 23 [2018-01-24 23:23:06,978 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 11 treesize of output 3 [2018-01-24 23:23:06,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,985 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-24 23:23:06,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:06,990 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-01-24 23:23:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:23:07,089 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:23:07,304 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-24 23:23:07,329 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-24 23:23:07,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:23:07,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:07,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:23:07,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-01-24 23:23:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:23:07,386 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 23:23:07,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 11] imperfect sequences [20] total 40 [2018-01-24 23:23:07,387 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:23:07,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:23:07,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:23:07,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1432, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 23:23:07,388 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2018-01-24 23:23:09,767 WARN L143 SmtUtils]: Spent 2127ms on a formula simplification that was a NOOP. DAG size: 29 Received shutdown request... [2018-01-24 23:23:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:23:12,509 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:23:12,512 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:23:12,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:23:12 BoogieIcfgContainer [2018-01-24 23:23:12,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:23:12,513 INFO L168 Benchmark]: Toolchain (without parser) took 60658.09 ms. Allocated memory was 302.5 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 262.6 MB in the beginning and 532.0 MB in the end (delta: -269.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-24 23:23:12,513 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:23:12,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.21 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 23:23:12,514 INFO L168 Benchmark]: Boogie Preprocessor took 38.60 ms. Allocated memory is still 302.5 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:23:12,514 INFO L168 Benchmark]: RCFGBuilder took 268.40 ms. Allocated memory is still 302.5 MB. Free memory was 249.4 MB in the beginning and 232.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 23:23:12,514 INFO L168 Benchmark]: TraceAbstraction took 60137.05 ms. Allocated memory was 302.5 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 231.8 MB in the beginning and 532.0 MB in the end (delta: -300.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-24 23:23:12,515 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.26 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.21 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.60 ms. Allocated memory is still 302.5 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 268.40 ms. Allocated memory is still 302.5 MB. Free memory was 249.4 MB in the beginning and 232.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60137.05 ms. Allocated memory was 302.5 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 231.8 MB in the beginning and 532.0 MB in the end (delta: -300.2 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 : 24 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 313 LocStat_NO_SUPPORTING_DISEQUALITIES : 54 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.064522 RENAME_VARIABLES(MILLISECONDS) : 0.765164 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.003667 PROJECTAWAY(MILLISECONDS) : 0.117396 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054034 DISJOIN(MILLISECONDS) : 0.513783 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.796827 ADD_EQUALITY(MILLISECONDS) : 0.024162 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012048 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 98 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 11 #RENAME_VARIABLES_DISJUNCTIVE : 95 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 11 states, 15 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. TIMEOUT Result, 60.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 277 SDtfs, 278 SDslu, 651 SDs, 0 SdLazy, 468 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 50.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 199 ConstructedInterpolants, 6 QuantifiedInterpolants, 25979 SizeOfPredicates, 21 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 4/6 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_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-23-12-526.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-23-12-526.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-23-12-526.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-23-12-526.csv Completed graceful shutdown