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_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:46:37,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:46:37,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:46:37,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:46:37,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:46:37,822 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:46:37,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:46:37,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:46:37,834 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:46:37,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:46:37,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:46:37,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:46:37,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:46:37,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:46:37,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:46:37,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:46:37,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:46:37,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:46:37,853 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:46:37,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:46:37,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:46:37,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:46:37,858 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:46:37,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:46:37,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:46:37,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:46:37,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:46:37,862 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:46:37,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:46:37,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:46:37,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:46:37,864 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:46:37,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:46:37,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:46:37,873 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:46:37,874 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:46:37,874 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:46:37,874 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:46:37,874 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:46:37,874 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:46:37,874 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:46:37,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:46:37,875 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:46:37,875 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:46:37,875 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:46:37,876 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:46:37,876 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:46:37,876 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:46:37,876 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:46:37,876 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:46:37,876 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:46:37,876 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:46:37,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:46:37,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:46:37,877 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:46:37,877 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:46:37,877 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:46:37,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:46:37,878 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:46:37,878 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:46:37,878 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:46:37,878 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:46:37,878 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:46:37,878 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:46:37,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:46:37,879 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:46:37,879 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:46:37,880 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:46:37,880 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:46:37,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:46:37,926 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:46:37,930 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:46:37,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:46:37,932 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:46:37,932 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-25 02:46:38,183 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:46:38,188 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:46:38,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:46:38,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:46:38,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:46:38,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfe6cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38, skipping insertion in model container [2018-01-25 02:46:38,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,227 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:46:38,296 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:46:38,430 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:46:38,454 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:46:38,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38 WrapperNode [2018-01-25 02:46:38,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:46:38,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:46:38,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:46:38,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:46:38,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (1/1) ... [2018-01-25 02:46:38,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:46:38,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:46:38,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:46:38,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:46:38,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (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:46:38,561 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:46:38,562 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:46:38,562 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-25 02:46:38,562 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:46:38,562 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:46:38,562 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:46:38,562 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:46:38,563 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:46:38,563 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:46:38,563 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:46:38,563 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-25 02:46:38,563 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:46:38,563 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:46:38,564 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:46:38,806 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:46:38,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:46:38 BoogieIcfgContainer [2018-01-25 02:46:38,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:46:38,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:46:38,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:46:38,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:46:38,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:46:38" (1/3) ... [2018-01-25 02:46:38,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0168b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:46:38, skipping insertion in model container [2018-01-25 02:46:38,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:38" (2/3) ... [2018-01-25 02:46:38,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0168b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:46:38, skipping insertion in model container [2018-01-25 02:46:38,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:46:38" (3/3) ... [2018-01-25 02:46:38,814 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:46:38,822 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:46:38,828 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 02:46:38,882 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:46:38,883 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:46:38,883 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:46:38,883 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:46:38,883 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:46:38,883 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:46:38,883 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:46:38,884 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:46:38,884 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:46:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-25 02:46:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:46:38,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:38,920 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:46:38,920 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:38,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510132, now seen corresponding path program 1 times [2018-01-25 02:46:38,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:38,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:38,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:38,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:38,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:39,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:39,272 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:46:39,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:39,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:46:39,274 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:39,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:46:39,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:46:39,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:46:39,377 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-01-25 02:46:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:39,496 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-01-25 02:46:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:46:39,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:46:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:39,510 INFO L225 Difference]: With dead ends: 58 [2018-01-25 02:46:39,510 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 02:46:39,514 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:46:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 02:46:39,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 02:46:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:46:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-25 02:46:39,559 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-01-25 02:46:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:39,560 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-25 02:46:39,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:46:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-25 02:46:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:46:39,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:39,561 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:46:39,561 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510131, now seen corresponding path program 1 times [2018-01-25 02:46:39,561 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:39,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:39,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:39,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:39,563 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:39,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:39,705 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:46:39,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:39,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:46:39,706 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:39,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:46:39,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:46:39,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:46:39,709 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-25 02:46:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:39,808 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-25 02:46:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:46:39,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:46:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:39,810 INFO L225 Difference]: With dead ends: 41 [2018-01-25 02:46:39,810 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 02:46:39,811 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-25 02:46:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 02:46:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-25 02:46:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 02:46:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-25 02:46:39,818 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-01-25 02:46:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:39,818 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-25 02:46:39,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:46:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-25 02:46:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:46:39,819 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:39,820 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:46:39,820 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695343, now seen corresponding path program 1 times [2018-01-25 02:46:39,820 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:39,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:39,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:39,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:39,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:39,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:39,871 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:46:39,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:39,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:46:39,871 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:39,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:46:39,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:46:39,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:46:39,872 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-01-25 02:46:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:39,913 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-25 02:46:39,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:46:39,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:46:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:39,914 INFO L225 Difference]: With dead ends: 40 [2018-01-25 02:46:39,914 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 02:46:39,914 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:46:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 02:46:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-25 02:46:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 02:46:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-25 02:46:39,918 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-01-25 02:46:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:39,919 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-25 02:46:39,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:46:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-25 02:46:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:46:39,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:39,919 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:46:39,919 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695344, now seen corresponding path program 1 times [2018-01-25 02:46:39,920 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:39,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:39,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:39,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:39,921 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:39,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:40,042 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:46:40,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:40,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:46:40,043 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:40,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:46:40,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:46:40,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:46:40,043 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-25 02:46:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:40,079 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-25 02:46:40,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:46:40,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:46:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:40,081 INFO L225 Difference]: With dead ends: 39 [2018-01-25 02:46:40,081 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 02:46:40,081 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:46:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 02:46:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-25 02:46:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 02:46:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-25 02:46:40,087 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-25 02:46:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:40,088 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-25 02:46:40,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:46:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-25 02:46:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:46:40,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:40,089 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-25 02:46:40,089 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash -559562515, now seen corresponding path program 1 times [2018-01-25 02:46:40,089 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:40,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:40,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:40,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:40,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:40,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:40,150 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:46:40,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:40,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:46:40,150 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:40,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:46:40,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:46:40,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:46:40,151 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-01-25 02:46:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:40,267 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-01-25 02:46:40,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:46:40,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 02:46:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:40,269 INFO L225 Difference]: With dead ends: 38 [2018-01-25 02:46:40,269 INFO L226 Difference]: Without dead ends: 37 [2018-01-25 02:46:40,270 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:46:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-25 02:46:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-25 02:46:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 02:46:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-25 02:46:40,276 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-01-25 02:46:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:40,277 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-25 02:46:40,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:46:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-25 02:46:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:46:40,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:40,278 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-25 02:46:40,279 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:40,279 INFO L82 PathProgramCache]: Analyzing trace with hash -559562514, now seen corresponding path program 1 times [2018-01-25 02:46:40,280 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:40,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:40,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:40,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:40,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:40,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:40,439 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:46:40,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:40,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:46:40,439 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:40,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:46:40,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:46:40,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:46:40,441 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-01-25 02:46:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:40,579 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-25 02:46:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:46:40,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-25 02:46:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:40,580 INFO L225 Difference]: With dead ends: 41 [2018-01-25 02:46:40,580 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 02:46:40,581 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:46:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 02:46:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-25 02:46:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 02:46:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-25 02:46:40,587 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-01-25 02:46:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:40,587 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-25 02:46:40,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:46:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-25 02:46:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:46:40,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:40,588 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-25 02:46:40,588 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796544, now seen corresponding path program 1 times [2018-01-25 02:46:40,588 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:40,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:40,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:40,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:40,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:40,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:46:40,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:40,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:46:40,643 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:40,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:46:40,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:46:40,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:46:40,644 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2018-01-25 02:46:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:40,749 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-25 02:46:40,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:46:40,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-25 02:46:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:40,751 INFO L225 Difference]: With dead ends: 40 [2018-01-25 02:46:40,751 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 02:46:40,751 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:46:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 02:46:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-01-25 02:46:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 02:46:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-25 02:46:40,757 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2018-01-25 02:46:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:40,757 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-25 02:46:40,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:46:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-25 02:46:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:46:40,758 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:40,758 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-25 02:46:40,758 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796543, now seen corresponding path program 1 times [2018-01-25 02:46:40,758 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:40,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:40,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:40,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:40,759 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:40,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:40,930 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:46:40,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:40,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 02:46:40,930 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:40,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:46:40,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:46:40,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:46:40,931 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-01-25 02:46:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:41,060 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-25 02:46:41,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:46:41,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-01-25 02:46:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:41,061 INFO L225 Difference]: With dead ends: 43 [2018-01-25 02:46:41,062 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 02:46:41,062 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:46:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 02:46:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-01-25 02:46:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 02:46:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-25 02:46:41,067 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2018-01-25 02:46:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:41,067 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-25 02:46:41,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:46:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-25 02:46:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:46:41,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:41,069 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-25 02:46:41,069 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-25 02:46:41,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1264210553, now seen corresponding path program 1 times [2018-01-25 02:46:41,069 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:41,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:41,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:41,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:41,070 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:41,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:41,501 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 16 DAG size of output 14 [2018-01-25 02:46:41,713 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 33 DAG size of output 21 [2018-01-25 02:46:42,164 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:46:42,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:42,164 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:46:42,165 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 02:46:42,166 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-25 02:46:42,230 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:46:42,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:47:38,843 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:47:38,844 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-25 02:47:38,859 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:47:38,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:47:38,859 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:47:38,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:38,875 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:47:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:38,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:47:39,091 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:47:39,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:39,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:39,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:47:39,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:47:39,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:47:39,413 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-25 02:47:39,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:39,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:39,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 02:47:39,521 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-25 02:47:39,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 02:47:39,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:39,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:39,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:39,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 Received shutdown request... [2018-01-25 02:47:39,548 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:47:39,548 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:47:39,552 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:47:39,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:47:39 BoogieIcfgContainer [2018-01-25 02:47:39,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:47:39,554 INFO L168 Benchmark]: Toolchain (without parser) took 61371.07 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 266.1 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 549.5 MB. Max. memory is 5.3 GB. [2018-01-25 02:47:39,555 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 308.8 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:47:39,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.31 ms. Allocated memory is still 308.8 MB. Free memory was 266.1 MB in the beginning and 256.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:47:39,556 INFO L168 Benchmark]: Boogie Preprocessor took 38.40 ms. Allocated memory is still 308.8 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:47:39,556 INFO L168 Benchmark]: RCFGBuilder took 303.60 ms. Allocated memory is still 308.8 MB. Free memory was 254.0 MB in the beginning and 237.5 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 5.3 GB. [2018-01-25 02:47:39,556 INFO L168 Benchmark]: TraceAbstraction took 60745.86 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 235.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 518.9 MB. Max. memory is 5.3 GB. [2018-01-25 02:47:39,558 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.14 ms. Allocated memory is still 308.8 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 275.31 ms. Allocated memory is still 308.8 MB. Free memory was 266.1 MB in the beginning and 256.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.40 ms. Allocated memory is still 308.8 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 303.60 ms. Allocated memory is still 308.8 MB. Free memory was 254.0 MB in the beginning and 237.5 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60745.86 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 235.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 518.9 MB. 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.307411 RENAME_VARIABLES(MILLISECONDS) : 0.822368 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.238564 PROJECTAWAY(MILLISECONDS) : 0.112246 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.087858 DISJOIN(MILLISECONDS) : 0.594549 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.857021 ADD_EQUALITY(MILLISECONDS) : 0.034632 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009236 #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 analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 26 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. TIMEOUT Result, 60.6s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 266 SDtfs, 264 SDslu, 548 SDs, 0 SdLazy, 377 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s 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, 56.6s 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, 0.8s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 7579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-47-39-569.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_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-47-39-569.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_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-47-39-569.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_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-47-39-569.csv Completed graceful shutdown