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/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:52:27,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:52:27,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:52:27,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:52:27,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:52:27,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:52:27,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:52:27,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:52:27,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:52:27,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:52:27,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:52:27,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:52:27,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:52:27,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:52:27,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:52:27,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:52:27,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:52:27,461 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:52:27,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:52:27,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:52:27,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:52:27,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:52:27,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:52:27,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:52:27,467 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:52:27,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:52:27,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:52:27,469 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:52:27,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:52:27,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:52:27,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:52:27,470 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 18:52:27,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:52:27,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:52:27,480 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:52:27,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:52:27,481 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:52:27,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:52:27,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:52:27,481 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:52:27,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:52:27,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:52:27,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:52:27,482 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:52:27,482 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:52:27,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:52:27,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:52:27,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:52:27,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:52:27,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:52:27,482 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:52:27,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:52:27,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:52:27,483 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:52:27,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:52:27,483 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:52:27,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:52:27,518 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:52:27,520 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:52:27,521 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:52:27,521 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:52:27,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-02-04 18:52:27,603 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:52:27,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:52:27,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:52:27,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:52:27,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:52:27,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fffaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27, skipping insertion in model container [2018-02-04 18:52:27,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,629 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:52:27,645 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:52:27,750 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:52:27,761 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:52:27,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27 WrapperNode [2018-02-04 18:52:27,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:52:27,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:52:27,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:52:27,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:52:27,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (1/1) ... [2018-02-04 18:52:27,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:52:27,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:52:27,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:52:27,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:52:27,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (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 18:52:27,838 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:52:27,838 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:52:27,838 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 18:52:27,839 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:52:27,839 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:52:27,839 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:52:27,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:52:27,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:52:27,839 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:52:27,839 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 18:52:27,840 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:52:27,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:52:27,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:52:28,009 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:52:28,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:52:28 BoogieIcfgContainer [2018-02-04 18:52:28,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:52:28,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:52:28,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:52:28,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:52:28,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:52:27" (1/3) ... [2018-02-04 18:52:28,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638f6261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:52:28, skipping insertion in model container [2018-02-04 18:52:28,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:27" (2/3) ... [2018-02-04 18:52:28,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638f6261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:52:28, skipping insertion in model container [2018-02-04 18:52:28,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:52:28" (3/3) ... [2018-02-04 18:52:28,015 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-02-04 18:52:28,022 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:52:28,027 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 18:52:28,061 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:52:28,061 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:52:28,061 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:52:28,061 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:52:28,062 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:52:28,062 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:52:28,062 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:52:28,062 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:52:28,063 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:52:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 18:52:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 18:52:28,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:28,085 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:28,085 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 18:52:28,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:28,091 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:28,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:28,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:28,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:28,219 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 18:52:28,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:28,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:52:28,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:52:28,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:52:28,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:52:28,232 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 18:52:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:28,282 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 18:52:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:52:28,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 18:52:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:28,291 INFO L225 Difference]: With dead ends: 63 [2018-02-04 18:52:28,291 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 18:52:28,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 18:52:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 18:52:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 18:52:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 18:52:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 18:52:28,374 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 18:52:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:28,374 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 18:52:28,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:52:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 18:52:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 18:52:28,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:28,374 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:28,374 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 18:52:28,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:28,375 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:28,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:28,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:28,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:28,437 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 18:52:28,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:28,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:52:28,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:52:28,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:52:28,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:28,440 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-02-04 18:52:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:28,568 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-04 18:52:28,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:52:28,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 18:52:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:28,569 INFO L225 Difference]: With dead ends: 65 [2018-02-04 18:52:28,569 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 18:52:28,570 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 18:52:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 18:52:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-04 18:52:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 18:52:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 18:52:28,576 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-02-04 18:52:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:28,577 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 18:52:28,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:52:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 18:52:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 18:52:28,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:28,578 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:28,578 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:28,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 18:52:28,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:28,578 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:28,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:28,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:28,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:28,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:28,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:52:28,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:52:28,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:52:28,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:28,627 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-02-04 18:52:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:28,666 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-04 18:52:28,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:52:28,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 18:52:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:28,667 INFO L225 Difference]: With dead ends: 65 [2018-02-04 18:52:28,668 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 18:52:28,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:52:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 18:52:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-02-04 18:52:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 18:52:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-04 18:52:28,671 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-02-04 18:52:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:28,671 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-04 18:52:28,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:52:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-04 18:52:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:52:28,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:28,672 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:28,672 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-02-04 18:52:28,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:28,672 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:28,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:28,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:28,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 18:52:28,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:28,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:52:28,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:52:28,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:52:28,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:52:28,713 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-02-04 18:52:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:28,735 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-02-04 18:52:28,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:52:28,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 18:52:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:28,737 INFO L225 Difference]: With dead ends: 64 [2018-02-04 18:52:28,737 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 18:52:28,737 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 18:52:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 18:52:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-02-04 18:52:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 18:52:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 18:52:28,740 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-02-04 18:52:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:28,740 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 18:52:28,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:52:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 18:52:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:52:28,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:28,741 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:28,741 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:28,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-02-04 18:52:28,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:28,741 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:28,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:28,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:28,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:52:28,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:28,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:28,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:28,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:28,923 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 18:52:28,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:28,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:28,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:52:28,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:28,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 18:52:28,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:52:28,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:52:28,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:52:28,972 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-02-04 18:52:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:29,116 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 18:52:29,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:52:29,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-04 18:52:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:29,118 INFO L225 Difference]: With dead ends: 68 [2018-02-04 18:52:29,118 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 18:52:29,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:52:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 18:52:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-02-04 18:52:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 18:52:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-04 18:52:29,121 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 29 [2018-02-04 18:52:29,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:29,121 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-04 18:52:29,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:52:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-04 18:52:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:52:29,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:29,122 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:29,122 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-02-04 18:52:29,122 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:29,122 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:29,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,123 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:29,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:29,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:52:29,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:29,178 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:29,178 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:29,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:29,200 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 18:52:29,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:52:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:52:29,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:29,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-02-04 18:52:29,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:52:29,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:52:29,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:52:29,215 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 7 states. [2018-02-04 18:52:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:29,252 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 18:52:29,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:52:29,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 18:52:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:29,253 INFO L225 Difference]: With dead ends: 60 [2018-02-04 18:52:29,253 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 18:52:29,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:52:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 18:52:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 18:52:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 18:52:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 18:52:29,258 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 29 [2018-02-04 18:52:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:29,259 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 18:52:29,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:52:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 18:52:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:52:29,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:29,259 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] [2018-02-04 18:52:29,260 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 18:52:29,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:29,260 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:29,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,260 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:29,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:29,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:29,319 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 18:52:29,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:29,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:29,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:29,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:29,352 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 18:52:29,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:29,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2018-02-04 18:52:29,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:52:29,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:52:29,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:52:29,354 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2018-02-04 18:52:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:29,510 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-04 18:52:29,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:52:29,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 18:52:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:29,511 INFO L225 Difference]: With dead ends: 89 [2018-02-04 18:52:29,511 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 18:52:29,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:52:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 18:52:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2018-02-04 18:52:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 18:52:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 18:52:29,515 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 31 [2018-02-04 18:52:29,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:29,515 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 18:52:29,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:52:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 18:52:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 18:52:29,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:29,516 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:29,516 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash -193392944, now seen corresponding path program 1 times [2018-02-04 18:52:29,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:29,517 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:29,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:29,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:29,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:29,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:29,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:29,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:29,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 18:52:29,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:29,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-02-04 18:52:29,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:52:29,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:52:29,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:52:29,626 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 12 states. [2018-02-04 18:52:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:29,722 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-04 18:52:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:52:29,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 18:52:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:29,724 INFO L225 Difference]: With dead ends: 101 [2018-02-04 18:52:29,724 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 18:52:29,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:52:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 18:52:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2018-02-04 18:52:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 18:52:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 18:52:29,728 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-04 18:52:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:29,728 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 18:52:29,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:52:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 18:52:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 18:52:29,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:29,729 INFO L351 BasicCegarLoop]: trace histogram [3, 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 18:52:29,729 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:29,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 2 times [2018-02-04 18:52:29,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:29,729 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:29,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,730 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:29,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:29,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:52:29,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:29,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:29,765 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:29,776 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 18:52:29,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:29,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:29,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,792 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 18:52:29,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,794 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 18:52:29,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 18:52:29,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,816 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 18:52:29,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,819 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 18:52:29,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 18:52:29,839 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-02-04 18:52:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 18:52:29,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:29,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-02-04 18:52:29,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:52:29,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:52:29,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-02-04 18:52:29,844 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-02-04 18:52:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:30,003 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-04 18:52:30,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:52:30,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 18:52:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:30,005 INFO L225 Difference]: With dead ends: 111 [2018-02-04 18:52:30,005 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 18:52:30,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=175, Unknown=1, NotChecked=28, Total=272 [2018-02-04 18:52:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 18:52:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-04 18:52:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 18:52:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-02-04 18:52:30,009 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2018-02-04 18:52:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:30,009 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-02-04 18:52:30,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:52:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-02-04 18:52:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 18:52:30,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:30,010 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:30,013 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1139004847, now seen corresponding path program 2 times [2018-02-04 18:52:30,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:30,013 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:30,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:30,014 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:30,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:30,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 18:52:30,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:30,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:52:30,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:52:30,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:52:30,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:52:30,066 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 7 states. [2018-02-04 18:52:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:30,129 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-02-04 18:52:30,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:52:30,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-02-04 18:52:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:30,130 INFO L225 Difference]: With dead ends: 68 [2018-02-04 18:52:30,130 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 18:52:30,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:52:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 18:52:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 18:52:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 18:52:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-02-04 18:52:30,137 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 52 [2018-02-04 18:52:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:30,137 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-02-04 18:52:30,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:52:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-02-04 18:52:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 18:52:30,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:30,139 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:30,139 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2136218585, now seen corresponding path program 3 times [2018-02-04 18:52:30,139 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:30,139 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:30,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:30,140 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:30,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:30,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 18:52:30,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:30,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:30,205 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:52:30,215 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 18:52:30,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:30,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 18:52:30,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:30,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-02-04 18:52:30,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:52:30,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:52:30,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:52:30,303 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2018-02-04 18:52:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:30,506 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-02-04 18:52:30,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 18:52:30,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-04 18:52:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:30,506 INFO L225 Difference]: With dead ends: 89 [2018-02-04 18:52:30,506 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 18:52:30,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:52:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 18:52:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 18:52:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 18:52:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 18:52:30,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-02-04 18:52:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:30,508 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 18:52:30,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:52:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 18:52:30,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 18:52:30,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:52:30 BoogieIcfgContainer [2018-02-04 18:52:30,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:52:30,512 INFO L168 Benchmark]: Toolchain (without parser) took 2909.33 ms. Allocated memory was 408.4 MB in the beginning and 662.7 MB in the end (delta: 254.3 MB). Free memory was 363.7 MB in the beginning and 555.1 MB in the end (delta: -191.4 MB). Peak memory consumption was 62.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:30,513 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 408.4 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:52:30,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.62 ms. Allocated memory is still 408.4 MB. Free memory was 363.7 MB in the beginning and 355.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:30,513 INFO L168 Benchmark]: Boogie Preprocessor took 21.26 ms. Allocated memory is still 408.4 MB. Free memory was 355.8 MB in the beginning and 353.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:30,514 INFO L168 Benchmark]: RCFGBuilder took 222.13 ms. Allocated memory is still 408.4 MB. Free memory was 353.1 MB in the beginning and 335.6 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:30,514 INFO L168 Benchmark]: TraceAbstraction took 2501.58 ms. Allocated memory was 408.4 MB in the beginning and 662.7 MB in the end (delta: 254.3 MB). Free memory was 335.6 MB in the beginning and 555.1 MB in the end (delta: -219.5 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:30,515 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 408.4 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.62 ms. Allocated memory is still 408.4 MB. Free memory was 363.7 MB in the beginning and 355.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.26 ms. Allocated memory is still 408.4 MB. Free memory was 355.8 MB in the beginning and 353.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 222.13 ms. Allocated memory is still 408.4 MB. Free memory was 353.1 MB in the beginning and 335.6 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2501.58 ms. Allocated memory was 408.4 MB in the beginning and 662.7 MB in the end (delta: 254.3 MB). Free memory was 335.6 MB in the beginning and 555.1 MB in the end (delta: -219.5 MB). Peak memory consumption was 34.8 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: 16]: 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: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 2.4s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 341 SDtfs, 564 SDslu, 889 SDs, 0 SdLazy, 990 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 220 SyntacticMatches, 10 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=8, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 92 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 590 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 573 ConstructedInterpolants, 26 QuantifiedInterpolants, 68749 SizeOfPredicates, 13 NumberOfNonLiveVariables, 569 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 238/296 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/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-52-30-521.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-52-30-521.csv Received shutdown request...