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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:14:23,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:14:23,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:14:23,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:14:23,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:14:23,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:14:23,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:14:23,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:14:23,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:14:23,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:14:23,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:14:23,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:14:23,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:14:23,238 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:14:23,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:14:23,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:14:23,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:14:23,243 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:14:23,244 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:14:23,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:14:23,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:14:23,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:14:23,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:14:23,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:14:23,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:14:23,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:14:23,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:14:23,251 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:14:23,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:14:23,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:14:23,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:14:23,252 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:14:23,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:14:23,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:14:23,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:14:23,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:14:23,264 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:14:23,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:14:23,265 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:14:23,265 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:14:23,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:14:23,265 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:14:23,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:14:23,265 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:14:23,266 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:14:23,266 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:14:23,266 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:14:23,266 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:14:23,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:14:23,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:14:23,267 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:14:23,267 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:14:23,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:14:23,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:14:23,267 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:14:23,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:14:23,267 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:14:23,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:14:23,310 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:14:23,316 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:14:23,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:14:23,317 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:14:23,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-02-04 04:14:23,429 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:14:23,430 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:14:23,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:14:23,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:14:23,437 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:14:23,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4d4829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23, skipping insertion in model container [2018-02-04 04:14:23,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,453 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:14:23,467 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:14:23,556 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:14:23,568 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:14:23,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23 WrapperNode [2018-02-04 04:14:23,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:14:23,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:14:23,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:14:23,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:14:23,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (1/1) ... [2018-02-04 04:14:23,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:14:23,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:14:23,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:14:23,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:14:23,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 04:14:23,630 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:14:23,630 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:14:23,630 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 04:14:23,630 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:14:23,630 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:14:23,630 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:14:23,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:14:23,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:14:23,631 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:14:23,631 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 04:14:23,631 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:14:23,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:14:23,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:14:23,742 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:14:23,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:14:23 BoogieIcfgContainer [2018-02-04 04:14:23,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:14:23,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:14:23,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:14:23,745 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:14:23,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:14:23" (1/3) ... [2018-02-04 04:14:23,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184becfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:14:23, skipping insertion in model container [2018-02-04 04:14:23,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:14:23" (2/3) ... [2018-02-04 04:14:23,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184becfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:14:23, skipping insertion in model container [2018-02-04 04:14:23,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:14:23" (3/3) ... [2018-02-04 04:14:23,747 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-02-04 04:14:23,752 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:14:23,756 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-02-04 04:14:23,779 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:14:23,779 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:14:23,779 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:14:23,779 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:14:23,779 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:14:23,779 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:14:23,779 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:14:23,779 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:14:23,780 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:14:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-02-04 04:14:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 04:14:23,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:23,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:23,794 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:23,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-02-04 04:14:23,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:23,802 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:23,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:23,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:23,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:23,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:23,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:23,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:14:23,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 04:14:23,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 04:14:23,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:14:23,911 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-02-04 04:14:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:23,923 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-02-04 04:14:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 04:14:23,924 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-04 04:14:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:23,930 INFO L225 Difference]: With dead ends: 49 [2018-02-04 04:14:23,930 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 04:14:23,931 INFO L554 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-02-04 04:14:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 04:14:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 04:14:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 04:14:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 04:14:23,955 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-02-04 04:14:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:23,956 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 04:14:23,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 04:14:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 04:14:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 04:14:23,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:23,956 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:23,957 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-02-04 04:14:23,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:23,957 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:23,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:23,959 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:23,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:23,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:23,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:23,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:14:24,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:14:24,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:14:24,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:24,002 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-02-04 04:14:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:24,124 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-04 04:14:24,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:14:24,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 04:14:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:24,127 INFO L225 Difference]: With dead ends: 67 [2018-02-04 04:14:24,127 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 04:14:24,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:24,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 04:14:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-02-04 04:14:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 04:14:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 04:14:24,136 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-02-04 04:14:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:24,136 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 04:14:24,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:14:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 04:14:24,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 04:14:24,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:24,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:24,137 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-02-04 04:14:24,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:24,138 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:24,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:24,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:24,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:24,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:24,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:14:24,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:14:24,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:14:24,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:24,205 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-02-04 04:14:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:24,295 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-02-04 04:14:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:24,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 04:14:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:24,297 INFO L225 Difference]: With dead ends: 73 [2018-02-04 04:14:24,297 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 04:14:24,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 04:14:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-02-04 04:14:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 04:14:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 04:14:24,302 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-02-04 04:14:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:24,302 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 04:14:24,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:14:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 04:14:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:14:24,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:24,303 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:24,303 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-02-04 04:14:24,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:24,303 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:24,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:24,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:24,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:24,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:24,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:14:24,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:14:24,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:14:24,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:24,351 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-02-04 04:14:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:24,366 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 04:14:24,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:14:24,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-02-04 04:14:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:24,369 INFO L225 Difference]: With dead ends: 55 [2018-02-04 04:14:24,369 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 04:14:24,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:14:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 04:14:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 04:14:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 04:14:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 04:14:24,374 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-02-04 04:14:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:24,374 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 04:14:24,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:14:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 04:14:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:14:24,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:24,375 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:24,375 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-02-04 04:14:24,376 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:24,376 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:24,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:24,377 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:24,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:24,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:24,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:14:24,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:14:24,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:14:24,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:14:24,440 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-02-04 04:14:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:24,485 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 04:14:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:14:24,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 04:14:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:24,486 INFO L225 Difference]: With dead ends: 65 [2018-02-04 04:14:24,486 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 04:14:24,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:14:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 04:14:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-02-04 04:14:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 04:14:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-04 04:14:24,494 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-02-04 04:14:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:24,495 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-04 04:14:24,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:14:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-04 04:14:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 04:14:24,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:24,496 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:24,496 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-02-04 04:14:24,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:24,496 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:24,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:24,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:24,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:14:24,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:24,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:14:24,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:14:24,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:14:24,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:24,546 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-02-04 04:14:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:24,654 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 04:14:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:24,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 04:14:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:24,655 INFO L225 Difference]: With dead ends: 69 [2018-02-04 04:14:24,655 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 04:14:24,657 INFO L554 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-02-04 04:14:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 04:14:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-02-04 04:14:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 04:14:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-04 04:14:24,661 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-02-04 04:14:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:24,661 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-04 04:14:24,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:14:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-04 04:14:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 04:14:24,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:24,662 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:24,662 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-02-04 04:14:24,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:24,662 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:24,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:24,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:24,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:24,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:24,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:24,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:24,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:24,839 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-02-04 04:14:24,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:24,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:14:24,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:14:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:14:24,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:14:24,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-02-04 04:14:24,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:14:24,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:14:24,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:14:24,886 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 11 states. [2018-02-04 04:14:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:25,047 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-04 04:14:25,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:14:25,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-04 04:14:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:25,048 INFO L225 Difference]: With dead ends: 74 [2018-02-04 04:14:25,048 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 04:14:25,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:14:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 04:14:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2018-02-04 04:14:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 04:14:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 04:14:25,053 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2018-02-04 04:14:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:25,053 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 04:14:25,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:14:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 04:14:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 04:14:25,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,054 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,054 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-02-04 04:14:25,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,054 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,055 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:25,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:25,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:14:25,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:14:25,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:14:25,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:25,086 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2018-02-04 04:14:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:25,119 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 04:14:25,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:14:25,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 04:14:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:25,120 INFO L225 Difference]: With dead ends: 59 [2018-02-04 04:14:25,120 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 04:14:25,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 04:14:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 04:14:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 04:14:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-04 04:14:25,125 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29 [2018-02-04 04:14:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:25,125 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-04 04:14:25,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:14:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-04 04:14:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:14:25,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,126 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,127 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-02-04 04:14:25,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,127 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,128 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:14:25,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:14:25,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:14:25,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:14:25,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:14:25,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:25,244 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-02-04 04:14:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:25,282 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 04:14:25,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:14:25,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 04:14:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:25,282 INFO L225 Difference]: With dead ends: 64 [2018-02-04 04:14:25,282 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 04:14:25,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:14:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 04:14:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-02-04 04:14:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 04:14:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-04 04:14:25,285 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 32 [2018-02-04 04:14:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:25,285 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-04 04:14:25,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:14:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-04 04:14:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:14:25,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,286 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,286 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:25,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-02-04 04:14:25,286 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,286 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,287 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:25,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:25,308 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:25,309 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:25,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:25,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 04:14:25,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:14:25,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:14:25,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:25,327 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-02-04 04:14:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:25,351 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-02-04 04:14:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:14:25,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 04:14:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:25,352 INFO L225 Difference]: With dead ends: 83 [2018-02-04 04:14:25,352 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 04:14:25,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:14:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 04:14:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-02-04 04:14:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 04:14:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 04:14:25,356 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-04 04:14:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:25,356 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 04:14:25,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:14:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 04:14:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 04:14:25,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,357 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,357 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-02-04 04:14:25,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,358 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,358 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,359 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:25,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:25,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:25,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:14:25,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:25,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-02-04 04:14:25,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:14:25,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:14:25,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:14:25,462 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 11 states. [2018-02-04 04:14:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:25,591 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-02-04 04:14:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:14:25,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-04 04:14:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:25,591 INFO L225 Difference]: With dead ends: 98 [2018-02-04 04:14:25,592 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 04:14:25,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:14:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 04:14:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2018-02-04 04:14:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 04:14:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-04 04:14:25,596 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 34 [2018-02-04 04:14:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:25,596 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-04 04:14:25,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:14:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-04 04:14:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 04:14:25,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,597 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,597 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-02-04 04:14:25,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,598 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,599 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:14:25,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:14:25,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:25,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:25,630 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:25,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:14:25,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:25,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:25,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:14:25,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 04:14:25,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:25,665 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-02-04 04:14:25,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 04:14:25,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:14:25,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 04:14:25,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:14:25,688 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-02-04 04:14:25,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 04:14:25,703 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (store |c_old(#valid)| |main_~#b~0.base| 0) |c_#valid|))) is different from true [2018-02-04 04:14:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 04:14:25,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:14:25,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-02-04 04:14:25,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:14:25,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:14:25,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-02-04 04:14:25,708 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 9 states. [2018-02-04 04:14:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:25,841 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-02-04 04:14:25,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:14:25,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-04 04:14:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:25,841 INFO L225 Difference]: With dead ends: 109 [2018-02-04 04:14:25,842 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 04:14:25,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=175, Unknown=1, NotChecked=28, Total=272 [2018-02-04 04:14:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 04:14:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-02-04 04:14:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 04:14:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 04:14:25,844 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 45 [2018-02-04 04:14:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:25,844 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 04:14:25,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:14:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 04:14:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 04:14:25,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:14:25,845 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:14:25,845 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 04:14:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-02-04 04:14:25,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:14:25,846 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:14:25,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,846 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:14:25,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:14:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:14:25,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:14:25,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:25,933 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:25,934 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:14:25,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:14:25,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:25,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:14:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 04:14:26,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:14:26,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 15 [2018-02-04 04:14:26,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:14:26,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:14:26,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:14:26,020 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 15 states. [2018-02-04 04:14:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:14:26,253 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-02-04 04:14:26,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:14:26,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-02-04 04:14:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:14:26,253 INFO L225 Difference]: With dead ends: 88 [2018-02-04 04:14:26,253 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 04:14:26,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:14:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 04:14:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 04:14:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 04:14:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 04:14:26,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-02-04 04:14:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:14:26,254 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 04:14:26,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:14:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 04:14:26,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 04:14:26,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:14:26 BoogieIcfgContainer [2018-02-04 04:14:26,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:14:26,259 INFO L168 Benchmark]: Toolchain (without parser) took 2829.95 ms. Allocated memory was 401.6 MB in the beginning and 661.7 MB in the end (delta: 260.0 MB). Free memory was 359.8 MB in the beginning and 572.4 MB in the end (delta: -212.7 MB). Peak memory consumption was 47.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:26,260 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:14:26,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.01 ms. Allocated memory is still 401.6 MB. Free memory was 359.8 MB in the beginning and 351.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:26,260 INFO L168 Benchmark]: Boogie Preprocessor took 22.63 ms. Allocated memory is still 401.6 MB. Free memory was 351.7 MB in the beginning and 350.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:26,260 INFO L168 Benchmark]: RCFGBuilder took 146.19 ms. Allocated memory is still 401.6 MB. Free memory was 350.3 MB in the beginning and 332.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:26,260 INFO L168 Benchmark]: TraceAbstraction took 2515.15 ms. Allocated memory was 401.6 MB in the beginning and 661.7 MB in the end (delta: 260.0 MB). Free memory was 332.3 MB in the beginning and 572.4 MB in the end (delta: -240.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:26,262 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 143.01 ms. Allocated memory is still 401.6 MB. Free memory was 359.8 MB in the beginning and 351.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.63 ms. Allocated memory is still 401.6 MB. Free memory was 351.7 MB in the beginning and 350.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 146.19 ms. Allocated memory is still 401.6 MB. Free memory was 350.3 MB in the beginning and 332.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2515.15 ms. Allocated memory was 401.6 MB in the beginning and 661.7 MB in the end (delta: 260.0 MB). Free memory was 332.3 MB in the beginning and 572.4 MB in the end (delta: -240.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. SAFE Result, 2.4s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 448 SDtfs, 651 SDslu, 903 SDs, 0 SdLazy, 917 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 121 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 543 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 525 ConstructedInterpolants, 20 QuantifiedInterpolants, 62759 SizeOfPredicates, 10 NumberOfNonLiveVariables, 519 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 128/159 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-14-26-268.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-14-26-268.csv Received shutdown request...