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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:52:06,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:52:06,705 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:52:06,720 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:52:06,720 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:52:06,721 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:52:06,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:52:06,724 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:52:06,726 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:52:06,727 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:52:06,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:52:06,728 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:52:06,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:52:06,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:52:06,732 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:52:06,734 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:52:06,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:52:06,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:52:06,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:52:06,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:52:06,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:52:06,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:52:06,744 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:52:06,745 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:52:06,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:52:06,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:52:06,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:52:06,748 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:52:06,749 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:52:06,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:52:06,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:52:06,750 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:52:06,758 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:52:06,759 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:52:06,759 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:52:06,759 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:52:06,760 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:52:06,760 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:52:06,760 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:52:06,760 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:52:06,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:52:06,761 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:52:06,761 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:52:06,761 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:52:06,761 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:52:06,761 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:52:06,761 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:52:06,761 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:52:06,762 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:52:06,762 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:52:06,762 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:52:06,762 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:52:06,762 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:52:06,762 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:52:06,762 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:52:06,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:52:06,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:52:06,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:52:06,763 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:52:06,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:52:06,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:52:06,764 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:52:06,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:52:06,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:52:06,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:52:06,764 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:52:06,765 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:52:06,765 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:52:06,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:52:06,809 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:52:06,813 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:52:06,814 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:52:06,814 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:52:06,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-24 23:52:06,975 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:52:06,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:52:06,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:52:06,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:52:06,987 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:52:06,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:52:06" (1/1) ... [2018-01-24 23:52:06,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cccfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:06, skipping insertion in model container [2018-01-24 23:52:06,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:52:06" (1/1) ... [2018-01-24 23:52:07,005 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:52:07,045 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:52:07,167 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:52:07,187 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:52:07,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07 WrapperNode [2018-01-24 23:52:07,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:52:07,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:52:07,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:52:07,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:52:07,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (1/1) ... [2018-01-24 23:52:07,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (1/1) ... [2018-01-24 23:52:07,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (1/1) ... [2018-01-24 23:52:07,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (1/1) ... [2018-01-24 23:52:07,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (1/1) ... [2018-01-24 23:52:07,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (1/1) ... [2018-01-24 23:52:07,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (1/1) ... [2018-01-24 23:52:07,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:52:07,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:52:07,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:52:07,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:52:07,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (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:52:07,279 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:52:07,280 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:52:07,280 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 23:52:07,280 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:52:07,280 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:52:07,280 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:52:07,280 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:52:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:52:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:52:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 23:52:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 23:52:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:52:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 23:52:07,281 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:52:07,282 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:52:07,282 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:52:07,514 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:52:07,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:52:07 BoogieIcfgContainer [2018-01-24 23:52:07,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:52:07,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:52:07,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:52:07,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:52:07,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:52:06" (1/3) ... [2018-01-24 23:52:07,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdeed8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:52:07, skipping insertion in model container [2018-01-24 23:52:07,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:07" (2/3) ... [2018-01-24 23:52:07,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdeed8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:52:07, skipping insertion in model container [2018-01-24 23:52:07,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:52:07" (3/3) ... [2018-01-24 23:52:07,521 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-24 23:52:07,527 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:52:07,534 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 23:52:07,570 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:52:07,570 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:52:07,570 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:52:07,571 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:52:07,571 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:52:07,571 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:52:07,571 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:52:07,571 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:52:07,572 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:52:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-24 23:52:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 23:52:07,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:52:07,605 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:52:07,605 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 23:52:07,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-01-24 23:52:07,614 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:52:07,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:07,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:07,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:07,658 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:52:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:07,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:52:07,751 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:52:07,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:52:07,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:52:07,755 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:52:07,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 23:52:07,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 23:52:07,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 23:52:07,771 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-24 23:52:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:52:07,794 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-01-24 23:52:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 23:52:07,796 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 23:52:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:52:07,804 INFO L225 Difference]: With dead ends: 109 [2018-01-24 23:52:07,804 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 23:52:07,807 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 23:52:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 23:52:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 23:52:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 23:52:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 23:52:07,926 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-01-24 23:52:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:52:07,926 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 23:52:07,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 23:52:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 23:52:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:52:07,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:52:07,928 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:52:07,928 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 23:52:07,928 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-01-24 23:52:07,928 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:52:07,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:07,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:07,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:07,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:52:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:07,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:52:08,026 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:52:08,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:52:08,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:52:08,026 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:52:08,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:52:08,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:52:08,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:52:08,029 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-01-24 23:52:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:52:08,172 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-01-24 23:52:08,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:52:08,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:52:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:52:08,174 INFO L225 Difference]: With dead ends: 56 [2018-01-24 23:52:08,175 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 23:52:08,176 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:52:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 23:52:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 23:52:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 23:52:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 23:52:08,183 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-01-24 23:52:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:52:08,184 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 23:52:08,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:52:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 23:52:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:52:08,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:52:08,185 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:52:08,185 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 23:52:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-01-24 23:52:08,185 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:52:08,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:08,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:08,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:08,187 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:52:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:08,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:52:08,322 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:52:08,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:52:08,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:52:08,323 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:52:08,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:52:08,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:52:08,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:52:08,324 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-01-24 23:52:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:52:08,452 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-24 23:52:08,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:52:08,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:52:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:52:08,454 INFO L225 Difference]: With dead ends: 55 [2018-01-24 23:52:08,454 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 23:52:08,455 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:52:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 23:52:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 23:52:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 23:52:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-24 23:52:08,462 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-01-24 23:52:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:52:08,462 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-24 23:52:08,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:52:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-24 23:52:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:52:08,463 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:52:08,464 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] [2018-01-24 23:52:08,464 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 23:52:08,464 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-01-24 23:52:08,464 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:52:08,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:08,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:08,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:08,466 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:52:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:08,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:52:08,594 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:52:08,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:52:08,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:52:08,594 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:52:08,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:52:08,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:52:08,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:52:08,596 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-01-24 23:52:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:52:08,764 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-24 23:52:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:52:08,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 23:52:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:52:08,766 INFO L225 Difference]: With dead ends: 54 [2018-01-24 23:52:08,766 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 23:52:08,767 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:52:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 23:52:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 23:52:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 23:52:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 23:52:08,774 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-01-24 23:52:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:52:08,774 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 23:52:08,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:52:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 23:52:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:52:08,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:52:08,775 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] [2018-01-24 23:52:08,775 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 23:52:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-01-24 23:52:08,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:52:08,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:08,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:08,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:08,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:52:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:08,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:52:08,934 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:52:08,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:52:08,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:52:08,934 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:52:08,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:52:08,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:52:08,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:52:08,935 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-01-24 23:52:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:52:09,091 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 23:52:09,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:52:09,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 23:52:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:52:09,095 INFO L225 Difference]: With dead ends: 91 [2018-01-24 23:52:09,095 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 23:52:09,096 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:52:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 23:52:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-01-24 23:52:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:52:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 23:52:09,102 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-01-24 23:52:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:52:09,103 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 23:52:09,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:52:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 23:52:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:52:09,104 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:52:09,104 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:52:09,104 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 23:52:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-01-24 23:52:09,104 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:52:09,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:09,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:09,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:09,106 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:52:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:09,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:52:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:52:09,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:52:09,210 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:52:09,211 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 23:52:09,213 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [57], [58], [59], [60], [61], [64], [93], [94], [95], [97] [2018-01-24 23:52:09,268 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:52:09,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:52:29,210 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:52:29,211 INFO L268 AbstractInterpreter]: Visited 22 different actions 31 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-24 23:52:29,217 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:52:29,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:52:29,218 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:52:29,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:29,226 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:52:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:29,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:52:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:52:29,301 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:52:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:52:29,351 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 23:52:29,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-24 23:52:29,352 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:52:29,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:52:29,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:52:29,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:52:29,353 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-24 23:52:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:52:29,438 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-01-24 23:52:29,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:52:29,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 23:52:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:52:29,440 INFO L225 Difference]: With dead ends: 124 [2018-01-24 23:52:29,440 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 23:52:29,441 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:52:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 23:52:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-01-24 23:52:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 23:52:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-24 23:52:29,448 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-24 23:52:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:52:29,448 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-24 23:52:29,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:52:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-24 23:52:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:52:29,449 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:52:29,449 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:52:29,449 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-24 23:52:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-01-24 23:52:29,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:52:29,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:29,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:29,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:52:29,451 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:52:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:29,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:52:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:52:29,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:52:29,652 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:52:29,652 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 23:52:29,652 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [53], [57], [58], [59], [60], [61], [64], [93], [94], [95], [97] [2018-01-24 23:52:29,653 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:52:29,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:52:56,366 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:52:56,366 INFO L268 AbstractInterpreter]: Visited 23 different actions 58 times. Merged at 15 different actions 28 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-01-24 23:52:56,368 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:52:56,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:52:56,368 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:52:56,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:56,373 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:52:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:56,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:52:56,411 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:52:56,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:56,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:52:56,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 23:52:56,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 23:52:56,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:56,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 23:52:56,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-24 23:52:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:52:56,563 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:52:56,928 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-24 23:52:56,941 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:52:56,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:56,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:52:56,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:52:56,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-24 23:52:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:52:56,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:52:56,973 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 23:52:56,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:52:56,977 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:52:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:52:57,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:52:57,021 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:52:57,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,029 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:52:57,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-24 23:52:57,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:52:57,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-24 23:52:57,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:52:57,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:52:57,224 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:52:57,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 23:52:57,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-24 23:52:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:52:57,388 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:52:57,480 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-24 23:52:57,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-24 23:52:57,509 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 23:52:57,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:52:57,515 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-24 23:52:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:52:57,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 23:52:57,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 8, 8] total 24 [2018-01-24 23:52:57,524 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:52:57,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 23:52:57,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 23:52:57,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=479, Unknown=1, NotChecked=0, Total=600 [2018-01-24 23:52:57,525 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 13 states. Received shutdown request... [2018-01-24 23:52:57,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:52:57,889 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:52:57,893 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:52:57,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:52:57 BoogieIcfgContainer [2018-01-24 23:52:57,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:52:57,895 INFO L168 Benchmark]: Toolchain (without parser) took 50919.00 ms. Allocated memory was 307.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 267.8 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 105.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:52:57,895 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:52:57,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.67 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:52:57,896 INFO L168 Benchmark]: Boogie Preprocessor took 33.87 ms. Allocated memory is still 307.8 MB. Free memory was 256.8 MB in the beginning and 254.8 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:52:57,896 INFO L168 Benchmark]: RCFGBuilder took 283.74 ms. Allocated memory is still 307.8 MB. Free memory was 254.8 MB in the beginning and 236.1 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-01-24 23:52:57,897 INFO L168 Benchmark]: TraceAbstraction took 50378.99 ms. Allocated memory was 307.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 235.1 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 72.3 MB. Max. memory is 5.3 GB. [2018-01-24 23:52:57,898 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.15 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.67 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.87 ms. Allocated memory is still 307.8 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 283.74 ms. Allocated memory is still 307.8 MB. Free memory was 254.8 MB in the beginning and 236.1 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50378.99 ms. Allocated memory was 307.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 235.1 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 72.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 303 LocStat_NO_SUPPORTING_DISEQUALITIES : 46 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.803968 RENAME_VARIABLES(MILLISECONDS) : 0.426745 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.845538 PROJECTAWAY(MILLISECONDS) : 0.135963 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.035231 DISJOIN(MILLISECONDS) : 0.297855 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.450321 ADD_EQUALITY(MILLISECONDS) : 0.040196 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010879 #CONJOIN_DISJUNCTIVE : 51 #RENAME_VARIABLES : 93 #UNFREEZE : 0 #CONJOIN : 111 #PROJECTAWAY : 79 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 87 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 288 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.870573 RENAME_VARIABLES(MILLISECONDS) : 0.416815 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.885185 PROJECTAWAY(MILLISECONDS) : 0.117732 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.037618 DISJOIN(MILLISECONDS) : 0.245995 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.435665 ADD_EQUALITY(MILLISECONDS) : 0.012490 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011989 #CONJOIN_DISJUNCTIVE : 87 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 156 #PROJECTAWAY : 122 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 22 #RENAME_VARIABLES_DISJUNCTIVE : 159 #ADD_EQUALITY : 70 #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 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (74states) and interpolant automaton (currently 10 states, 13 states before enhancement), while ReachableStatesComputation was computing reachable states (115 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 50.3s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 309 SDtfs, 351 SDslu, 549 SDs, 0 SdLazy, 596 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 135 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 46.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 274 ConstructedInterpolants, 28 QuantifiedInterpolants, 52277 SizeOfPredicates, 14 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 22/39 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/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-52-57-908.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-52-57-908.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-52-57-908.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_23-52-57-908.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_23-52-57-908.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-52-57-908.csv Completed graceful shutdown